loading...
Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks
Mesa, AZ April 16-April 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDSC.2001.91893721st IEEE International Conference on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Alain Cournier, Franck Petit, Vincent Villain, Ajoy K. Datta, "Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks," Distributed Computing Systems, International Conference on, pp. 0091, 21st IEEE International Conference on Distributed Computing Systems (ICDCS'01), 2001.
 
 
BibTex
x
 
@article{ 10.1109/ICDSC.2001.918937,
author = {Alain Cournier and Franck Petit and Vincent Villain and Ajoy K. Datta},
title = {Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks},
journal ={Distributed Computing Systems, International Conference on},
volume = {0},
year = {2001},
isbn = {0-7695-1077-9},
pages = {0091},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDSC.2001.918937},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Distributed Computing Systems, International Conference on
TI - Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks
SN - 0-7695-1077-9
SP
EP
A1 - Alain Cournier,
A1 - Franck Petit,
A1 - Vincent Villain,
A1 - Ajoy K. Datta,
PY - 2001
KW - Fault-tolerance
KW - propagation of information with feedback
KW - reset
KW - self-stabilization
KW - snapshot
KW - wave algorithms.
VL - 0
JA - Distributed Computing Systems, International Conference on
ER -
 
Alain Cournier, LaRIA, Universit? de Picardie Jules Verne
Franck Petit, LaRIA, Universit? de Picardie Jules Verne
Vincent Villain, LaRIA, Universit? de Picardie Jules Verne
Ajoy K. Datta, University of Nevada at Las Vegas
Abstract: We present a deterministic distributed Propagation of Information with Feedback (PIF) protocol in arbitrary rooted networks. The proposed algorithm does not use a pre-constructed spanning tree. The protocol is self-stabilizing, meaning that starting from an arbitrary state (in response to an arbitrary perturbation modifying the memory state), it is guaranteed to behave according to its specification. Every PIF wave initiated by the root inherently creates a tree in the graph. So, the tree is dynamically created according to the progress of the PIF wave. This allows our PIF algorithm to take advantage of the relative speed of different components of the network. The proposed algorithm can be easily used to implement any self-stabilizing system which requires a (self-stabilizing) wave protocol running on an arbitrary network.
Index Terms:
Fault-tolerance, propagation of information with feedback, reset, self-stabilization, snapshot, wave algorithms.
Citation:
Alain Cournier, Franck Petit, Vincent Villain, Ajoy K. Datta, "Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks," icdcs, pp.0091, 21st IEEE International Conference on Distributed Computing Systems (ICDCS'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.