A self-stabilizing enumeration algorithm |
| |
| Authors: | Emmanuel Godard |
| |
| Affiliation: | LaBRI U.M.R. 5800, Université Bordeaux I, 351 Cours de la Libération, 33405 Talence Cedex, France |
| |
| Abstract: | This paper describes a self-stabilizing version of an algorithm presented by A. Mazurkiewicz [Inform. Process. Lett. 61 (1997) 233-239] for enumerating nodes by local rules on an anonymous network. The result improves the reliability aspects of the original algorithm and underlines the importance of a non-ambiguous topology for a network. |
| |
| Keywords: | Distributed computing Self-stabilizing systems Local computations Anonymous networks |
| 本文献已被 ScienceDirect 等数据库收录！ |
