Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/ICDSC.2001.918937 | ICDCS |
Keywords | Field | DocType |
self-stabilizing pif algorithm,arbitrary rooted network,arbitrary state,pif algorithm,pif wave,arbitrary rooted networks,wave protocol,arbitrary network,memory state,proposed algorithm,self-stabilizing system,arbitrary perturbation,spanning tree,broadcasting,feedback,fault detection,distributed computing,tree graphs,tree,fault tolerant,fault tolerance,algorithm design and analysis,computer science,distributed algorithms,intelligent networks,protocols | Broadcasting,Tree (graph theory),Algorithm design,Computer science,Fault detection and isolation,Algorithm,Distributed algorithm,Fault tolerance,Spanning tree,Intelligent Network,Distributed computing | Conference |
ISSN | Citations | PageRank |
1063-6927 | 15 | 0.84 |
References | Authors | |
16 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alain Cournier | 1 | 281 | 22.07 |
| Ajoy K. Datta | 2 | 369 | 35.83 |
| Franck Petit | 3 | 736 | 60.02 |
| Vincent Villain | 4 | 544 | 45.77 |