Snap-stabilizing message forwarding algorithm on tree topologies

Alain Cournier 1 Swan Dubois 2 Anissa Lamani 3 Franck Petit 2 Vincent Villain 3
1 MIS, UPJV
MIS - Modélisation, Information & Systèmes
2 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
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 process, where n is the number of processes 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 [CDLPV10]. 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 [CDLPV10], but works on tree topologies.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/hal-00933930
Contributor : Franck Petit <>
Submitted on : Tuesday, January 21, 2014 - 12:34:12 PM
Last modification on : Friday, April 12, 2019 - 10:18:03 AM

Identifiers

  • HAL Id : hal-00933930, version 1

Citation

Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit, Vincent Villain. Snap-stabilizing message forwarding algorithm on tree topologies. Theoretical Computer Science, Elsevier, 2013, 496, pp.89-112. ⟨hal-00933930⟩

Share

Metrics

Record views

332