A Deadlock-Free Dynamic Reconfiguration Protocol for Distributed Routing on Interconnection Networks

被引:0
|
作者
Kadhar, Mohiadeen Abdul [1 ]
机构
[1] Natl Coll Engn, Dept Informat Technol, Tirunelveli 627151, Tamil Nadu, India
关键词
Dynamic reconfiguration; RC; RT; deadlock; interconnection networks; distributed routing;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In interconnection networks, reconfiguration protocol is necessary to remap and reconnect the network paths, so that the network remains connected. However, the reconfiguration process brings the deadlock problem and prevention of deadlock is a tedious task in this situation. In existing works, very little work have considered deadlock problem and further, they paid no attention to reduce packet loss rate. In this paper, we propose a Token-Based (TB) robust deadlock-free dynamic reconfiguration protocol. When a device observes topology changes or detects faulty nodes, it triggers the reconfiguration process and it becomes the Reconfiguration Controller (RC). Initially, HELLO message is transmitted by the RC to all devices for which they respond with a network status message. The RC constructs the new routing function based on the received network status messages. To synchronize the old and new routing functions, the RC distributes Reconfiguration Token (RT) in an ordered way. First, it distributes to the devices that surrounds the failed device and then to other devices. Every device holds the packet until it gets packet according to new routing function and then starts the transmission. By simulation, we show efficacy of our reconfiguration protocol. The network evaluation parameter like throughput, latency (delay) and pocket loss are measured in the high and low load scenarios in NS2 network simulator. We compare the results with existing protocol Overlapping Static Reconfiguration (OSR). Based on the simulation results we have proved that the proposed token based reconfiguration protocol is produces better efficiency in all aspects.
引用
收藏
页码:616 / 622
页数:7
相关论文
共 50 条
  • [41] Deadlock-free interval routing schemes
    Flammini, M
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 351 - 362
  • [42] Deadlock-free interval routing schemes
    Flammini, M
    NETWORKS, 1999, 34 (01) : 47 - 60
  • [43] Deadlock-free dynamic network reconfiguration based on close up*/down* graphs
    Robles-Gomez, Antonio
    Bermudez, Aurelio
    Casado, Rafael
    Solheim, Ashild Gronstad
    EURO-PAR 2008 PARALLEL PROCESSING, PROCEEDINGS, 2008, 5168 : 940 - 949
  • [44] Balancing virtual channel utilization for deadlock-free routing in torus networks
    Zhigang Yu
    Dong Xiang
    Xinyu Wang
    The Journal of Supercomputing, 2015, 71 : 3094 - 3115
  • [45] Deadlock-Free Broadcast Routing in Dragonfly Networks without Virtual Channels
    Xiang, Dong
    Liu, Xiaowei
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (09) : 2520 - 2532
  • [46] Deadlock-free adaptive routing in fault-tolerant mesh networks
    Xiang, Dong
    Zhang, Yue-Li
    Jisuanji Xuebao/Chinese Journal of Computers, 2007, 30 (11): : 1954 - 1962
  • [47] Balancing virtual channel utilization for deadlock-free routing in torus networks
    Yu, Zhigang
    Xiang, Dong
    Wang, Xinyu
    JOURNAL OF SUPERCOMPUTING, 2015, 71 (08): : 3094 - 3115
  • [48] A new methodology for deriving deadlock-free routing strategies in processor networks
    Hadim, MB
    Sakho, I
    INTERNATIONAL SOCIETY FOR COMPUTERS AND THEIR APPLICATIONS 10TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, 1997, : 385 - 390
  • [49] On the flattest common supersequence method for deadlock-free routing in arbitrary networks
    Laing, AK
    Cypher, R
    Duncan, CA
    THEORY OF COMPUTING SYSTEMS, 2000, 33 (5-6) : 393 - 426
  • [50] Part II: A methodology for developing deadlock-free dynamic network reconfiguration processes
    Lysne, O
    Pinkston, TM
    Duato, J
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2005, 16 (05) : 428 - 443