Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies
Alain Cournier (MIS), Swan Dubois (LIP6), Anissa Lamani (MIS), Franck, Petit (LIP6), Vincent Villain (MIS)

TL;DR
This paper introduces a snap-stabilizing message forwarding algorithm that efficiently manages buffers on tree networks, improving scalability and robustness over previous solutions.
Contribution
It extends a buffer-efficient message forwarding algorithm to work on tree topologies with snap-stabilization guarantees.
Findings
Works on tree topologies, not just chains.
Uses constant buffers per link, scalable for large networks.
Provides snap-stabilization ensuring immediate correctness.
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 %while using D buffers (where D refers to the diameter of the network) . 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 the same complexity on the number of buffers as [1] and works on tree topologies.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Interconnection Networks and Systems · Optimization and Search Problems
