Name
Abstract | ||
|---|---|---|
We present a distributed census algorithm for unidirectional rings subject to transient faults. This algorithm is written using the efficient cut-through routing scheme, where the messages must be forwarded to a neighbor before they are completely received. The distributed census problem can be informally described as follows: The nodes cooperate to reach a global configuration where every node can determine, within finite time, which nodes are and which nodes are not present in the network. The fault-tolerance is achieved using Dijkstra's paradigm of self-stabilization. A self-stabilizing algorithm, regardless of the initial system configuration, converges in finite time to a set of \textit{legitimate} configurations. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/SLFSTB.1999.777489 | WSS |
Keywords | DocType | ISBN |
cut-through constraint,self-stabilizing census,distributed algorithms,stability,message passing,bandwidth,fault tolerance,routing,self stabilization,computer science,fddi,fault tolerant,propagation delay | Conference | 0-7695-0228-8 |
Citations | PageRank | References |
6 | 0.48 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joffroy Beauquier | 1 | 448 | 53.52 |
| Ajoy Kumar Datta | 2 | 317 | 40.76 |
| Sébastien Tixeuil | 3 | 978 | 93.01 |