Abstract
This paper abstracts the problem of network nodes discovering one another in a network of unknown size using all-to-all gossip. The problem is studied in terms of evolving directed graphs where vertices represent the participating nodes and an edge represents one node’s knowledge about another. Ideally, such a graph has diameter one, i.e., each node knows all others. Nodes share their knowledge by sending gossip messages. Gossip among the nodes allows them to discover one another, decreasing the diameter of the graph. Here this problem is considered in several synchronous settings under different assumptions about the ability of the participating nodes to communicate. Specifically, the following aspects of communication are considered: (1) the ability of the nodes to multicast gossip messages, and (2) the size of the messages. The results describe the lower and upper bounds on the number of synchronous rounds required for the participants to discover each other. A particular question of interest is if the network size is unknown, how does a node know that it has discovered all other nodes? Given a weakly-connected graph describing the initial knowledge of the nodes, every node in our algorithm can stop the discovery process knowing that there are no unknown nodes—this is done without any prior knowledge of the total number of nodes participating in the computation.
This work is supported in part by the NSF Grants 9984778, 9988304, 0121277, 0311368.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Demers, A., et al.: Epidemic Algorithms for Replicated Database Maintenance. In: Proc. of the Sixth Symposium on Principles of Distributed Computing (PODC 1987), pp. 1–12 (1987)
Georgiou, Ch., Kowalski, D., Shvartsman, A.: Robust distributed cooperation using inexpensive gossip. In: Proc. of 17th International Symposium on Distributed Computing, pp. 224–238 (2003)
Harchol-Balter, M., Leighton, F.T., Lewin, D.: Resource Discovery in Distributed Networks. In: Proc. of 18th Symposium on Principles of Distributed Computing, pp. 229–237 (1999)
Hedetniemi, S.M., Hedetniemi, T., Liestman, A.L.: A Survey of Gossiping and Broadcasting in Communication Networks. Networks 18, 319–349 (1988)
Konwar, K.M., Kowalski, D.R., Shvartsman, A.A.: The Join Problem in Dynamic Network Algorithms. In: Proc. of the International Conference on Dependable Systems and Networks, pp. 315–324 (2004)
Kowalski, D., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. In: Proc. 43rd Ann. IEEE Symp. on Foundations of Computer Science, pp. 63–72 (2002)
Kutten, S., Peleg, D., Vishkin, U.: Deterministic resource discovery in distributed networks. In: Thirteenth ACM Symposium on Parallel Algorithms and Architectures, pp. 77–83 (2001)
Liestman, A.L., Richards, D.S.: Perpetual Gossiping. Parallel Processing Letters 3, 347–355 (1993)
Pelc, A.: Fault-tolerant Broadcasting and Gossiping in Communication Networks. Networks 28, 143–156 (1996)
Konwar, K.M., Kowalski, D., Shvartsman, A.A.: Node Discovery in Networks, Technical Report (2005), http://www.cse.uconn.edu/~kishori/TR-KKS.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Konwar, K.M., Kowalski, D., Shvartsman, A.A. (2006). Node Discovery in Networks. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds) Principles of Distributed Systems. OPODIS 2005. Lecture Notes in Computer Science, vol 3974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795490_17
Download citation
DOI: https://doi.org/10.1007/11795490_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36321-7
Online ISBN: 978-3-540-36322-4
eBook Packages: Computer ScienceComputer Science (R0)