Snap-Stabilizing message forwarding algorithm on tree topologies

Authors:
Alain Cournier;Swan Dubois;Anissa Lamani;Franck Petit;Vincent Villain
Affiliations:
MIS, Université of Picardie Jules Verne, France;LiP6/CNRS/INRIA-REGAL, Université Pierre et Marie Curie - Paris 6, France;MIS, Université of Picardie Jules Verne, France;LiP6/CNRS/INRIA-REGAL, Université Pierre et Marie Curie - Paris 6, France;MIS, Université of Picardie Jules Verne, France
Venue:
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Year:
2012

Citing 9
Cited 0

Log-space polynomial end-to-end communication

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks

IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing end-to-end communication

Journal of High Speed Networks
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Deadlock- and livelock-free packet switching networks

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
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
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Snap-stabilizing linear message forwarding

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor, where n is the number of processors in the network) making the solution not scalable or, they reserve all the buffers from the sender to the receiver to forward only one message. The only solution that uses a constant number of buffers per link was introduced in [1]. However the solution works only on a chain networks. In this paper, we propose a snap-stabilizing algorithm for the message forwarding problem that uses a constant number of buffers per link as in [1] but works on tree topologies.