Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies

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.
Liste complète des métadonnées

https://hal.inria.fr/inria-00628088
Contributor : Swan Dubois <>
Submitted on : Friday, September 30, 2011 - 1:47:25 PM
Last modification on : Thursday, March 21, 2019 - 1:13:33 PM

Links full text

Identifiers

Citation

Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit, Vincent Villain. Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. ICDCN 2012 - 13th International Conference on Distributed Computing and Networking, Jan 2012, Hong Kong, China. pp.46-60, ⟨10.1007/978-3-642-25959-3_4⟩. ⟨inria-00628088⟩

Share

Metrics

Record views

226