Computing on anonymous networks with sense of direction

Theoretical Computer Science

Volumn 301, Issue 1-3, 2003, Pages 355-379

  Flocchini, Paola ^a   Roncato, Alessandro ^b   Santoro, Nicola ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b Fac di Sci Matemat Fisische Nat   (Italy)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; HIERARCHICAL SYSTEMS; THEOREM PROVING; TOPOLOGY;

ANONYMOUS NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0038709715     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00592-3     Document Type: Article

References (33)

1. D. Angluin, Local and global properties in networks of processors, in: Proc. 12th ACM Symp. on Theory of Computing, 1980, pp. 82-93.
2. Attiya H., Snir M., Warmuth M.K. Computing on an anonymous ring. J. ACM. 35(4):1988;845-875.
3. P.W. Beame, H.L. Bodlaender, Distributed computing on transitive networks: the torus, in: Proc. Sixth Symp. on Theoretical Aspects of Computer Science, 1989, pp. 294-303.
4. P. Boldi, B. Codenotti, P. Gemmell, S. Shammah, J. Simon, S. Vigna, Symmetry breaking in anonymous networks: characterizations, in: Proc. Fourth Israeli Symp. on Theory of Computing and Systems, Jerusalem, 1996, pp. 16-26.
5. P. Boldi, S. Vigna, Computing vector functions on anonymous networks, in: Proc. Fourth Internat. Coll. on Structural Information and Communication Complexity, Ascona, 1997, pp. 201-214.
6. Boldi P., Vigna S. On the complexity of deciding sense of direction. SIAM J. Comput. 29(3):2000;779-789.
7. P. Ferragina, A. Monti, A. Roncato, Trade-off between computational power and common knowledge in anonymous rings, in: Proc. First Internat. Coll. on Structural Information and Communication Complexity Ottawa, 1994, pp. 35-48.
8. Fisher J., Lynch N.A. Merritt, Easy impossibility proofs for distributed consensus. Distributed Comput. 1(1):1986;26-39.
9. Flocchini P., Mans B. Optimal election in labeled hypercubes. J. Parallel Distributed Comput. 33(1):1996;76-83.
10. Flocchini P., Mans B., Santoro N. On the impact of sense of direction on message complexity. Inform. Process. Lett. 63(1):1997;23-31.
11. Flocchini P., Mans B., Santoro N. Sense of direction. definition, properties and classes Networks. 32(3):1998;165-180.
12. Flocchini P., Roncato A., Santoro N. Symmetries and sense of direction in labeled graphs. Discrete Appl. Math. 87:1998;99-115.
13. P. Flocchini, A. Roncato, N. Santoro, Backward consistency and sense of direction in advanced distributed systems, in: Proc. 18th ACM Symp. on Principles of Distributed Computing, Atlanta, 1999, pp. 189-198.
14. Flocchini P., Santoro N. Topological constraints for sense of direction. Internat. J. Found. Comput. Sci. 9(2):1998;179-198.
15. Kalamboukis T.Z., Mantzaris S.L. Towards optimal distributed election on chordal rings. Inform. Process. Lett. 38:1991;265-270.
16. Kranakis E., Krizanc D. Labeled versus unlabeled distributed Cayley networks. Discrete Appl. Math. 63(3):1995;223-236.
17. Kranakis E., Krizanc D. Distributed computing on anonymous hypercubes. J. Algorithms. 23:1997;32-50.
18. Kranakis E., Krizanc D., van den Berg J. Computing boolean functions on anonymous networks. Inform. Comput. 114(2):1994;214-236.
19. M.C. Loui, T.A. Matsushita, D.B. West, Election in complete networks with a sense of direction, Inform. Process. Lett. 22 (1986) 185-187; see also Inform. Process. Lett. 28 (1988) 327.
20. M.C. Loui, T.A. Matsushita, D.B. West, Election in complete networks with a sense of direction, Inform. Process. Lett. 22 (1986) 185-187; see also Inform. Process. Lett. 28 (1988) 327.
21. B. Mans, N. Santoro, On the impact of sense of direction in arbitrary networks, in: Proc. 14th Internat. Conf. on Distributed Computing Systems, Poznan, 1994, pp. 258-265.
22. T. Masuzawa, N. Nishikawa, K. Hagihara, N. Tokura, Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction, in: Proc. Third Internat. Workshop on Distributed Algorithms, Lecture Notes in Computer Science, vol. 392, Springer, Berlin, 1989, pp. 171-182.
23. Monti A., Roncato A. A gap theorem for anonymous torus. Inform. Process. Lett. 57:1996;279-285.
24. Moran S., Warmuth M.K. Gap theorems for distributed computation. SIAM J. Comput. 22(2):1993;379-394.
25. N. Norris, Computing functions on partially wireless networks, in: Proc. Second Internat. Coll. on Structural Information and Communication Complexity, Olympia, 1995, pp. 53-64.
26. Norris N. Universal covers of graphs. isomorphism to depth n-1 implies isomorphism to all depths Discrete Appl. Math. 56:1995;61-74.
27. A. Roncato, Gap theorems for anonymous rings, in: Proc. Second Internat. Coll. on Structural Information and Communication Complexity, Olympia, 1995, pp. 65-76.
28. N. Santoro, J. Urrutia, S. Zaks, Sense of direction and communication complexity in distributed networks, in: Proc. First Internat. Workshop on Distributed Algorithms, Carleton University Press, Ottawa, 1985, pp. 123-132.
29. Singh G. Efficient leader election using sense of direction. Distributed Comput. 10:1997;159-165.
30. I. Suzuki, M. Yamashita, Distributed anonymous mobile robots, in: Proc. Third Internat. Coll. on Structural Information and Communication Complexity, Siena, 1996, pp. 313-330.
31. G. Tel, Sense of direction in processor networks, in: Proc. Conf. on Theory and Practice of Informatics, Lecture Notes in Computer Science, vol. 1012, Springer, Berlin, 1995, pp. 50-82.
32. M. Yamashita, T. Kameda, Computing on anonymous networks, in: Proc. Seventh ACM Symp. on Principles of Distributed Computing, 1988, pp. 117-130.
33. Yamashita M., Kameda T. Computing on anonymous networks. Part I: characterizing the solvable cases. IEEE Trans. Parallel Distributed Comput. 7(1):1996;69-89.