Title
Snap-stabilizing PIF and useless computations
Abstract
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.
Year
DOI
Venue
2006
10.1109/ICPADS.2006.100
Parallel and Distributed Systems, 2006. ICPADS 2006. 12th International Conference
Keywords
Field
DocType
feedback,protocols,self-adjusting systems,stability,arbitrary networks,self-stabilizing protocol,snap-stabilizing PIF,snap-stabilizing information propagation,snap-stabilizing protocol,useless computations
Computer science,Real-time computing,Acknowledgement,Unit of time,Daemon,Bounded function,Distributed computing,Computation
Conference
Volume
ISSN
ISBN
1
1521-9097
0-7695-2612-8
Citations 
PageRank 
References 
13
0.63
14
Authors
3
Name
Order
Citations
PageRank
Alain Cournier128122.07
Stéphane Devismes219225.74
Vincent Villain354445.77