TY - JOUR

T1 - Node discovery in networks

AU - Konwar, Kishori M.

AU - Kowalski, Dariusz

AU - Shvartsman, Alexander A.

N1 - Funding Information:
This work is supported in part by the NSF Grants 9984778, 9988304, 0121277, 0311368. A preliminary version of this paper appeared as [K. Konwar, D. Kowalski, A. Shvartsman, Node discovery in networks, in: Proc. of the 9th International Conference on Principles of Distributed Systems, OPODIS 2005, in: LNCS, Springer, 2005, pp. 154–165].
Funding Information:
Alexander A. Shvartsman is a Professor of Computer Science and Engineering and the Director of the Voting Technology Research (VoTeR) Center at the University of Connecticut. He received his B.S. from Stevens Institute of Technology, M.S. from Cornell University, and Ph.D. from Brown University. Prior to embarking on an academic career he worked at AT&T Bell Labs and Digital Equipment Corp. His main research foci are in distributed computing and fault-tolerance. For the past 10 years his research has been funded by numerous grants, including the NSF Career Award. Shvartsman is an author of over 100 research papers and two books. He chaired and served on many committees of leading conferences in distributed computing.
Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.

PY - 2009/4

Y1 - 2009/4

N2 - 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 each vertex represents a participating node and each 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.

AB - 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 each vertex represents a participating node and each 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.

KW - Communication graphs

KW - Distributed algorithms

KW - Resource discovery

UR - http://www.scopus.com/inward/record.url?scp=61449180036&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=61449180036&partnerID=8YFLogxK

U2 - 10.1016/j.jpdc.2008.11.006

DO - 10.1016/j.jpdc.2008.11.006

M3 - Article

AN - SCOPUS:61449180036

VL - 69

SP - 337

EP - 348

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 4

ER -