Abstract
The correctness of most distributed algorithms depends on the existence of a unique name for each computer in the network. Several authors have investigated the consequences of the absence of such names on the sort of computations that can be performed on a network. It has been shown that it is not always possible to perform even relatively simple distributed computations such as determining the network topology or electing a leader if the number of nodes in the network is not known.
We make an additional assumption: that the number of nodes in the network is known to each node. We demonstrate distributed decision procedures to determine whether it is possible to compute network topology or carry out elections. The decision procedures can be modified into algorithms to determine topology and elect unique leaders in those topologies where it is possible to do so.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.Local and Global Properties in Networks of Processors. Proceedings of the 12th. Annual ACM Symposium on the Theory of Computing, (April 1980), pp 82–93.
Attiya, C., Snir, M., and Warmouth, M.Computing on an Anonymous Ring. Proceedings of the 4rth Annual ACM Symposium on Principles of Distributed Computing, (August 1985), pp 196–203.
Chang, E. and Roberts, R.An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processors. Comm. ACM 22 5, (May 1979), pp. 281–283.
Garcia-Molina, H.Elections in a Distributed Computing System. IEEE Transactions on Computers, C-31 1, (January 1982), pp 48–59.
Hirschberg, D.S., and Sinclair, J.B.Decentralized Extrema-Finding in Circular Configurations of Processors. Comm. ACM 23 11, (Nov. 1980), pp. 627–628.
Itai, A., and Rodeh, M.Symmetry Breaking in Distributive Networks. Proceeding of the 22nd Symposium on the Foundations of Computer Science, IEEE, (October 1981), pp 150–158.
Kohavi., Z. Switching and Finite Automata Theory. McGraw-Hill, 1970
Lelann, G.Distributed Systems — Towards a Formal Approach. Information Processing vol. 77, Elsevier Science, New York, pp. 155–160.
Peterson, G.L.An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. ACM Transactions On Programming Languages and Systems, 4 4, (Oct. 1982), pp. 758–762.
Pachl, J., Korach, E., and Rotem, D.Lower Bounds For Distributed Election Algorithms in Circular Configurations of Processors. Research Report CS-81-33, Department of Computer Science, University of Waterloo, (Nov. 1981).
Rogers, H.The Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhaskar, S., Buckley, G.N. (1987). Computations in undistinguished networks. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_47
Download citation
DOI: https://doi.org/10.1007/3-540-18625-5_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18625-0
Online ISBN: 978-3-540-48033-4
eBook Packages: Springer Book Archive