This Article 
 Bibliographic References 
 Add to: 
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
January 1996 (vol. 7 no. 1)
pp. 69-89

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.

[1] D. Angluin, “Global and Local Properties in Networks of Processors,” Proc. 12th ACM Symp. Theory of Computing, pp. 82–93, 1980.
[2] D. Angluin and A. Gardiner,"Finite common covering of pairs of regular graphs," J. of Combinatorial Theory, Ser. B, vol. 30, pp. 184-187, 1981.
[3] H. Attiya and M. Snir,"Better computing on the anonymous ring," J. of Algorithms, vol.12, pp. 204-238, 1991.
[4] H. Attiya,M. Snir,, and M. Warmuth,“Computing on an anonymous ring,” J. ACM, vol. 35, no. 4, pp. 845-875, Oct. 1988.
[5] P.W. Beame and H.L. Bodlaender,"Distributed computing on transitive networks: The torus," Proc. Sixth Symp. Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 349, Springer-Verlag, Berlin, Germany, pp. 294-303, 1989.
[6] M. Blum and W. Sakoda,"On the capability of automata in 2 and 3 dimensional space," Proc. 18th IEEE Symp. Foundations of Computer Science,Providence, R.I., pp. 147-161, 1977.
[7] L. Borge,"Symmetry and genericity for CSP distributed systems," Tech. Report 85-32, Laboratory of Information Theory and Programming, University of Paris, Paris, 1985.
[8] L. Borge,"On the existence of symmetric algorithms to find leaders in network of communicating sequential processes," Tech. Report 86-18, Laboratory of Information Theory and Programming, University of Paris, Paris, 1986.
[9] E. Chang,"Echo algorithms: Depth parallel operations on general graphs," IEEE Trans. Software Engineering, vol. 8, no. 4, pp. 391-401, 1982.
[10] E. Chang and R. Roberts, “An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processes,” Comm. ACM, vol. 22, no. 5, pp. 281–283, May 1979.
[11] E.W. Dijkstra and C.S. Sholten,"Termination detection in diffusing computations," Information Processing Letters, vol. 11, no. 1, pp. 1-4, 1980.
[12] P. Duris and Z. Galil,"Two lower bounds in asynchronous distributed computation," J. of Computer and System Sciences, vol. 42, pp. 245-266, 1991.
[13] G.N. Frederickson and N. Lynch, “Electing a Leader in a Synchronized Ring,” J. ACM, vol. 34, no. 1, pp. 98–115, 1987.
[14] P. Hall,"On representatives of subsets," J. of London Mathematics Society, vol. 10, pp. 26-30, 1935.
[15] A.F. Harary,Graph Theory.Reading, Mass.: Addison-Wesley, 1969.
[16] C.A.R. Hoare,“Communicating sequential processes,” Comm. of the ACM, vol. 21, no. 8, pp. 666-677, Aug. 1978.
[17] R.E. Johnson and F.B. Schneider, “Symmetry and Similarity in Distributed Systems,” Proc. Fourth ACM Symp. Principles Distributed Computing, Minaki, Ont., Canada, pp. 13–22, 1985.
[18] A. Itah and M. Rodeh,"The lord of the ring, or probabilistic methods for breaking symmetry in distributed networks," Tech. Report RJ3110, IBM, Yorktown Heights, N.Y., 1981.
[19] E. Kranakis and D. Krizanc,"Computing Boolean functions on anonymous hypercube networks (extended abstract)," Tech. Report CS-R9040, Center for Mathematics and Computer Science, The Netherlands, 1990.
[20] E. Kranakis,D. Krizanc, and J. van den Berg,"Computing Boolean functions on anonymous networks," Proc. 17th Int'l Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 443, Springer-Verlag, Berlin, Germany, pp. 254-267, 1990.
[21] L. Lamport and N. Lynch, “Distributed Computing: Models and Methods,” Handbook of Theoretical Computer Science—Formal Models and Semantics, J. van Leeuwen, ed. Elsevier: MIT Press, vol. B, 1990.
[22] I. Lavallée and C. Lavault,"Spanning tree construction for nameless networks," Proc. Fourth Int'l Workshop on Distributed Algorithms, Lecture Notes in Computer Science, vol. 486, Springer-Verlag, Berlin, Germany, pp. 41-56, 1990.
[23] F.T. Leighton,"Finite common coverings of graphs," J. of Combinatorial Theory, Ser. B, vol. 33, pp. 231-238, 1982.
[24] Y. Matias and Y. Afek,"Simple and efficient election algorithms for anonymous networks," Proc. Third Int'l Workshop on Distributed Algorithms, Lecture Notes in Computer Science, vol. 392, Springer-Verlag, Berlin, Germany, pp. 183-194, 1989.
[25] S. Moran and M.K. Warmuth,"Gap theorems for distributed computation," SIAM J. on Computing, vol. 22, no. 2, pp. 379-394, 1993.
[26] J. Mylopolous,"On the relation of graph grammars and graph automata," Proc. 13th IEEE Symp. Switching and Automata Theory,College Park, Md., pp. 108-120, 1972.
[27] N. Norris,"Universal covers of edge-labeled digraphs: Isomorphism to depth n-1 implies isomorphism to all depths," Discrete Applied Math., To appear.
[28] J. Pachl,E. Korach, and D. Rotem,"Lower bounds for distributed maximum-finding algorithms," J. of ACM, vol. 31, no. 4, pp. 905-918, 1984.
[29] J. Petersen,"Die Theorie der regulären Graphs," Acta Mathematica, vol. 15, pp. 193-220, 1891.
[30] A. Rosenfeld,"Networks of automata: Some applications," IEEE Trans. on Systems, Man and Cybernetics, vol. 5, no. 3, pp. 380-383, 1975.
[31] P. Rosenstiehl,J.R. Fiksel, and A. Holliger,"Intelligent graphs," Graph Theory and Computing, R. Read, Ed. New York: Academic Press, pp. 219-265, 1982.
[32] H.S. Shank,"Graph property recognition machines," Mathematical Systems Theory, vol. 5, pp. 45-49, 1971.
[33] B. Schieber and M. Snir,“Calling names on nameless networks,” Proc. Eighth Ann. ACM Symp. Principles of Distributed Computing,Edmonton, pp. 319-328, Aug. 1989.
[34] A. Wu and A. Rosenfeld,"Cellular graph automata, I and II," Information and Control, vol. 42, pp. 305-353, 1979.
[35] M. Yamashita and T. Kameda,"Computing functions on an anonymous network," Mathematical Systems Theory, to appear.
[36] M. Yamashita and T. Kameda, “Computing on Anonymous Networks,” Proc. Seventh ACM Symp. Principles Distributed Computing, Toronto, pp. 117–131, 1988.
[37] M. Yamashita and T. Kameda, “Electing a Leader When Processor Identity Numbers Are Not Distinct,” Proc. Third Int'l Workshop Distributed Algorithms, Nice, France, pp. 303–314, 1989.

Index Terms:
Anonymous network, distributed computing, leader election, edge election, spanning tree construction, topology recognition, knowledge.
Masafumi Yamashita, Tsunehiko Kameda, "Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 69-89, Jan. 1996, doi:10.1109/71.481599
Usage of this product signifies your acceptance of the Terms of Use.