The Community for Technology Leaders
Parallel and Distributed Systems, International Conference on (2002)
Taiwan, ROC
Dec. 17, 2002 to Dec. 20, 2002
ISSN: 1521-9097
ISBN: 0-7695-1760-9
pp: 425
Ajoy K. Datta , University of Nevada Las Vegas
Anthony B. Kenitzki , University of Nevada Las Vegas
Sébastien Tixeuil , Universit? Paris Sud
ABSTRACT
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing messages between parallel processors. Self-stabilization is a technique that guarantees tolerance to transient faults (e.g. memory corruption or communication hazard) for a given protocol. Self-stabilization guarantees that the network recovers to a correct behavior in finite time, without the need for human intervention. Self-stabilization also guarantees the safety property, meaning that once the network is in a legitimate state, it will remain there until another fault occurs.<div></div> This paper presents the first self-stabilizing network algorithm in the wormhole routing model, using the unidirectional ring topology. Our solution benefits from wormhole routing by providing high throughput and low latency, and from self-stabilization by ensuring automatic resilience to all possible transient failures.
INDEX TERMS
Distributed Algorithms, Fault-tolerance, Self-stabilization, Wormhole routing.
CITATION

A. B. Kenitzki, S. Tixeuil, M. Gradinariu and A. K. Datta, "Self-Stabilizing Wormhole Routing on Ring Networks," Parallel and Distributed Systems, International Conference on(ICPADS), Taiwan, ROC, 2002, pp. 425.
doi:10.1109/ICPADS.2002.1183434
92 ms
(Ver 3.3 (11022016))