Name
Abstract | ||
|---|---|---|
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in the message forwarding problem in a message-switched network in which the system resources must be managed in order to deliver messages to any processor of the network. To this end, we use the information provided by a routing algorithm. In the context of an arbitrary initialization (due to stabilization), this information may be corrupted. In Cournier et al. (2009) [1] , we show that there exist snap-stabilizing algorithms for this problem (in the state model ). This implies that we can request the system to begin forwarding messages without losses even if routing information is initially corrupted. In this paper, we propose another snap-stabilizing algorithm for this problem which improves the space complexity of the one in Cournier et al. (2009) [1] . |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.tcs.2010.11.014 | Self-Stabilizing Systems |
Keywords | Field | DocType |
Message forwarding,Snap-stabilization,Self-stabilization | Message forwarding,Ask price,Existential quantification,Computer science,Theoretical computer science,State model,Point-to-point,Routing algorithm | Journal |
Volume | Issue | ISSN |
412 | 33 | Theoretical Computer Science |
Citations | PageRank | References |
3 | 0.42 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alain Cournier | 1 | 281 | 22.07 |
| Swan Dubois | 2 | 145 | 17.21 |
| Vincent Villain | 3 | 544 | 45.77 |