2011/07/29 by Alain Cournier, Swan Dubois, Cournier, Alain +7
Computer Science · #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Interconnection Networks and Systems #Optimization and Search Problems #Parallel #and Cluster Computing (cs.DC) #cs.DC
paper · pdf · doi:10.48550/arxiv.1107.6014
2011
arxiv created 2011/07/29 · openalex publication_date 2011/07/29 · arxiv updated 2011/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.