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 条
  • [31] Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing
    Jie Wu
    Li Sheng
    The Journal of Supercomputing, 2005, 31 : 63 - 78
  • [32] Effective methodology for deadlock-free minimal routing in InfiniBand networks
    Sancho, JC
    Robles, A
    Flich, J
    López, P
    Duato, J
    2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDING, 2002, : 409 - 418
  • [33] A foundation for designing deadlock-free routing algorithms in wormhole networks
    Jayasimha, DN
    Schwiebert, L
    Manivannan, D
    May, JA
    JOURNAL OF THE ACM, 2003, 50 (02) : 250 - 275
  • [34] German methodologies for deadlock-free routing
    Park, H
    Agrawal, DP
    10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 638 - 643
  • [35] Transitively Deadlock-Free Routing Algorithms
    Quintin, Jean-Noel
    Vigneras, Pierre
    2016 2ND IEEE INTERNATIONAL WORKSHOP ON HIGH-PERFORMANCE INTERCONNECTION NETWORKS IN THE EXASCALE AND BIG-DATA ERA (HIPINEB), 2016, : 16 - 24
  • [36] Proof Pearl: A Formal Proof of Dally and Seitz' Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks
    Verbeek, Freek
    Schmaltz, Julien
    JOURNAL OF AUTOMATED REASONING, 2012, 48 (04) : 419 - 439
  • [37] Configuring Methods for Deadlock-Free Routing
    Olenev, Valentin
    Karandashev, Alexandr
    INTERNATIONAL JOURNAL OF TEACHER EDUCATION AND PROFESSIONAL DEVELOPMENT, 2020, 3 (01) : 1 - +
  • [38] Configuring Methods for Deadlock-Free Routing
    Olenev, Valentin
    Karandashev, Alexandr
    INTERNATIONAL JOURNAL OF EMBEDDED AND REAL-TIME COMMUNICATION SYSTEMS (IJERTCS), 2022, 13 (01):
  • [39] Proof Pearl: A Formal Proof of Dally and Seitz’ Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks
    Freek Verbeek
    Julien Schmaltz
    Journal of Automated Reasoning, 2012, 48 : 419 - 439