Issue No. 01 - January (1996 vol. 7)

ISSN: 1045-9219

pp: 69-89

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.481599

ABSTRACT

<p><b>Abstract</b>—In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the edge election problem, (c) the spanning tree construction problem, and (d) the topology recognition problem. On a given network, the above problems may or may not be solvable, depending on the amount of information about the attributes of the network made available to the processors. Some possibilities are: (1) no network attribute information at all is available, (2) an upper bound on the number of processors in the network is available, (3) the exact number of processors in the network is available, and (4) the topology of the network is available. In terms of a new graph property called "symmetricity," in each of the four cases (1)-(4) above, we characterize the class of networks on which each of the four problems (a)-(d) is solvable. We then relate the symmetricity of a network to its 1- and 2-factors.</p>

INDEX TERMS

Anonymous network, distributed computing, leader election, edge election, spanning tree construction, topology recognition, knowledge.

CITATION

T. Kameda and M. Yamashita, "Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases," in

*IEEE Transactions on Parallel & Distributed Systems*, vol. 7, no. , pp. 69-89, 1996.

doi:10.1109/71.481599

CITATIONS