Une CNS pour l'acheminement de messages instantanément stabilisant

Abstract : A snap-stabilizing algorithm ensures that it always behaves according to its specifications whenever it starts from an arbitrary configuration. In this paper, we interest in the message forwarding problem in a message-switched network. We must manage network ressources in order to deliver messages to any processor of the network. In this goal, we need information given by a routing algorithm. But, due to the context of stabilization, this information can be initially corrupted. It is why the existence of snap-stabilizing algorithms for this task (proved in [CDV09]) implies that we can ask the system to begin forwarding messages even if routing tables are initially corrupted. In this paper, we generalize the previous result given a necessary and sufficient condition to solve the forwarding problem in a snap-stabilizing way.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/inria-00383116
Contributor : Swan Dubois <>
Submitted on : Tuesday, May 12, 2009 - 10:14:32 AM
Last modification on : Thursday, March 21, 2019 - 2:29:47 PM
Long-term archiving on : Thursday, June 10, 2010 - 11:02:39 PM

Files

Algotel09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00383116, version 1
  • ARXIV : 0905.1786

Citation

Alain Cournier, Swan Dubois, Vincent Villain. Une CNS pour l'acheminement de messages instantanément stabilisant. 11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2009), Jun 2009, Carry-Le-Rouet, France. ⟨inria-00383116⟩

Share

Metrics

Record views

259

Files downloads

449