This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06)
Snap-Stabilizing PIF and Useless Computations
Minneapolis, Minnesota
July 12-July 15
ISBN: 0-7695-2612-8
Alain Cournier, Universite de Picardie Jules Verne, France
Stephane Devismes, Universite de Picardie Jules Verne, France
Vincent Villain, Universite de Picardie Jules Verne, France
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 time unit. Here, we propose the first snap-stabilizing propagation of information with feedback for arbitrary networks working with an unfair daemon. An interesting aspect of our solution is that, starting from any configuration, the number of reception (resp. acknowledgement) of corrupted messages (i.e., messages not initiated by the root) by a processor is bounded.
Citation:
Alain Cournier, Stephane Devismes, Vincent Villain, "Snap-Stabilizing PIF and Useless Computations," icpads, vol. 1, pp.39-48, 12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.