A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Log-space polynomial end-to-end communication
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Self-stabilizing end-to-end communication
Journal of High Speed Networks
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems
SRDS '08 Proceedings of the 2008 Symposium on Reliable Distributed Systems
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
Route preserving stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Snap-stabilizing prefix tree for peer-to-peer systems
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
D2HT: The Best of Both Worlds, Integrating RPS and DHT
EDCC '10 Proceedings of the 2010 European Dependable Computing Conference
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
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.00 |
In this paper, we present the first snap-stabilizing message forwarding protocol that uses a number of buffers per node being independent of any global parameter, that is 4 buffers per link. The protocol works on a linear chain of nodes, that is possibly an overlay on a large-scale and dynamic system, e.g., Peer-to-Peer systems, Grids, etc. Provided that the topology remains a linear chain and that nodes join and leave "neatly", the protocol tolerates topology changes. We expect that this protocol will be the base to get similar results on more general topologies.