A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
A universal proof technique for deadlock-free routing in interconnection networks
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Deadlock- and livelock-free packet switching networks
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Introduction to Algorithms and Java CD-ROM
Introduction to Algorithms and Java CD-ROM
A snap-stabilizing point-to-point communication protocol in message-switched networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Route preserving stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Snap-stabilizing linear message forwarding
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Stabilizing data-link over non-FIFO channels with optimal fault-resilience
Information Processing Letters
Snap-Stabilizing message forwarding algorithm on tree topologies
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
| Hi-index | 0.01 |
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a message-switched network. In this problem, we must manage resources of the system to deliver messages to any processor of the network. In this purpose, we use information given by a routing algorithm. By the context of stabilization (in particular, the system starts in any configuration), this information can be corrupted. In [1], authors show that there exists snap-stabilizing algorithms for this problem (in the state model ). That implies that we can ask the system to begin forwarding messages without losses even if routing informations are initially corrupted. In this paper, we propose another snap-stabilizing algorithm for this problem which improves the space complexity of the one of [1].