Computing on anonymous networks: Part I - Characterizing the solvable cases

Masafumi Yamashita, Tsunehiko Kameda

Research output: Contribution to journalArticle

200 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)69-89
Number of pages21
JournalIEEE Transactions on Parallel and Distributed Systems
Volume7
Issue number1
DOIs
Publication statusPublished - Dec 1 1996

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Computing on anonymous networks: Part I - Characterizing the solvable cases'. Together they form a unique fingerprint.

  • Cite this