Node discovery in networks

Kishori M. Konwar, Dariusz Kowalski, Alex A. Shvartsman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationPrinciples of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers
Pages206-220
Number of pages15
DOIs
StatePublished - Dec 1 2006
Externally publishedYes
Event9th International Conference on Principles of Distributed Systems, OPODIS 2005 - Pisa, Italy
Duration: Dec 12 2005Dec 14 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3974 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Principles of Distributed Systems, OPODIS 2005
CountryItaly
CityPisa
Period12/12/0512/14/05

Keywords

  • Distributed algorithms
  • Resource discovery

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Node discovery in networks'. Together they form a unique fingerprint.

  • Cite this

    Konwar, K. M., Kowalski, D., & Shvartsman, A. A. (2006). Node discovery in networks. In Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers (pp. 206-220). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3974 LNCS). https://doi.org/10.1007/11795490_17