Paper Info
Title
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.
Year
DOI
Venue
2012
10.1007/978-3-642-25959-3_4
international conference of distributed computing and networking
Keywords
DocType
Volume
tree topology,message forwarding problem,n buffer,chain network,constant number,snap-stabilizing algorithm,significant number,previous work,network resource,snap-stabilizing message forwarding algorithm,cluster computing
Conference
abs/1107.6014
ISSN
Citations 
PageRank 
0304-3975
1
0.35
References 
Authors
10
5
Name
Order
Citations
PageRank
Alain Cournier128122.07
Swan Dubois214517.21
Anissa Lamani311811.31
Franck Petit473660.02
Vincent Villain554445.77