论文信息 - Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size

Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size

We propose two adaptations of the probabilistic Itai-Rodeh algorithm for computing the size of an anonymous asynchronous ring. This Monte Carlo algorithm (inevitably) allows for wrong outcomes. Our adaptations reduce the chance that this happens. Furthermore, we propose a new algorithm that has a better message complexity.

Wan Fokkink | Guus Samsom

[1] Ernest J. H. Chang,et al. An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.

[2] Ieee Standards Board. IEEE Standard for a High Performance Serial Bus-Amendment 1 , 2000 .

[3] Sebastiano Vigna,et al. An Effective Characterization of Computability in Anonymous Networks , 2001, DISC.

[4] Gerard Tel,et al. Introduction to Distributed Algorithms: Contents , 2000 .

[5] Wan Fokkink,et al. Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM , 2006, J. Univers. Comput. Sci..

[6] Wan Fokkink,et al. Distributed Algorithms: An Intuitive Approach , 2013 .

[7] Wan Fokkink,et al. Leader Election in Anonymous Rings: Franklin Goes Probabilistic , 2008, IFIP TCS.

[8] W. Randolph Franklin. On an improved algorithm for decentralized extrema finding in circular configurations of processors , 1982, CACM.

[9] Alon Itai,et al. Symmetry breaking in distributed networks , 1990, Inf. Comput..

[10] Ana Sokolova,et al. Information Hiding in Probabilistic Concurrent Systems , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

[11] Wan Fokkink,et al. Simplifying Itai-Rodeh Leader Election for Anonymous Rings , 2005, Electron. Notes Theor. Comput. Sci..

[12] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.