How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Snap-stabilizing linear message forwarding
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Stabilizing data-link over non-FIFO channels with optimal fault-resilience
Information Processing Letters
Snap-Stabilizing message forwarding algorithm on tree topologies
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 0.00 |
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol to solve the message forwarding problem in a message-switched network. In this problem, we must manage resources of the system to deliver messages to any processor of the network. In this purpose, we use informations given by a routing algorithm. By the context of stabilization (in particular, the system starts in any configuration), these informations can be corrupted. So, the existence of a snap-stabilizing protocol for the message forwarding problem implies that we can ask the system to begin forwarding messages even if routing informations are initially corrupted.