The join problem in dynamic network algorithms

Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman

Research output: Contribution to conferencePaper

Abstract

Distributed algorithms in dynamic networks often employ communication patterns whose purpose is to disseminate information among the participants. Gossiping is one form of such communication pattern. In dynamic settings the set of participants can change substantially as new participants join, and as failures and voluntary departures remove those who have joined previously. A natural question for such settings is: how soon can newly joined nodes discover each other by means of gossiping? This paper abstracts and studies the Join Problem for dynamic systems that use all-to-all gossip. The problem is studied in terms of join-connectivity graphs where vertices represent the participants and where each edge represents one participant's knowledge about another. Ideally, such a graph has diameter one, i.e., all participants know each other. The diameter can grow as new participants join, and as failures remove edges from the graph. Gossip helps participants discover one another, decreasing the diameter. The results describe the lower and upper bounds on the number of communication rounds such that the participants who have previously joined discover one another, under a variety of assumptions about the joining and failures. For example, in the case when new participants join at multiple participants and participants may crash, the number of rounds cannot be bounded. In the more benign cases when the failures can be controlled or when new participants join at only one participant, the bound on rounds is shown to be logarithmic in the diameter of the initial configuration.

Original languageEnglish (US)
Pages315-324
Number of pages10
StatePublished - Oct 1 2004
Event2004 International Conference on Dependable Systems and Networks - Florence, Italy
Duration: Jun 28 2004Jul 1 2004

Conference

Conference2004 International Conference on Dependable Systems and Networks
CountryItaly
CityFlorence
Period6/28/047/1/04

Fingerprint

Communication
Parallel algorithms
Joining
Dynamical systems

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Konwar, K. M., Kowalski, D. R., & Shvartsman, A. A. (2004). The join problem in dynamic network algorithms. 315-324. Paper presented at 2004 International Conference on Dependable Systems and Networks, Florence, Italy.

The join problem in dynamic network algorithms. / Konwar, Kishori M.; Kowalski, Dariusz R.; Shvartsman, Alexander A.

2004. 315-324 Paper presented at 2004 International Conference on Dependable Systems and Networks, Florence, Italy.

Research output: Contribution to conferencePaper

Konwar, KM, Kowalski, DR & Shvartsman, AA 2004, 'The join problem in dynamic network algorithms', Paper presented at 2004 International Conference on Dependable Systems and Networks, Florence, Italy, 6/28/04 - 7/1/04 pp. 315-324.
Konwar KM, Kowalski DR, Shvartsman AA. The join problem in dynamic network algorithms. 2004. Paper presented at 2004 International Conference on Dependable Systems and Networks, Florence, Italy.
Konwar, Kishori M. ; Kowalski, Dariusz R. ; Shvartsman, Alexander A. / The join problem in dynamic network algorithms. Paper presented at 2004 International Conference on Dependable Systems and Networks, Florence, Italy.10 p.
@conference{a8467f3eebff48f48b5e9fc7dca05d6c,
title = "The join problem in dynamic network algorithms",
abstract = "Distributed algorithms in dynamic networks often employ communication patterns whose purpose is to disseminate information among the participants. Gossiping is one form of such communication pattern. In dynamic settings the set of participants can change substantially as new participants join, and as failures and voluntary departures remove those who have joined previously. A natural question for such settings is: how soon can newly joined nodes discover each other by means of gossiping? This paper abstracts and studies the Join Problem for dynamic systems that use all-to-all gossip. The problem is studied in terms of join-connectivity graphs where vertices represent the participants and where each edge represents one participant's knowledge about another. Ideally, such a graph has diameter one, i.e., all participants know each other. The diameter can grow as new participants join, and as failures remove edges from the graph. Gossip helps participants discover one another, decreasing the diameter. The results describe the lower and upper bounds on the number of communication rounds such that the participants who have previously joined discover one another, under a variety of assumptions about the joining and failures. For example, in the case when new participants join at multiple participants and participants may crash, the number of rounds cannot be bounded. In the more benign cases when the failures can be controlled or when new participants join at only one participant, the bound on rounds is shown to be logarithmic in the diameter of the initial configuration.",
author = "Konwar, {Kishori M.} and Kowalski, {Dariusz R.} and Shvartsman, {Alexander A.}",
year = "2004",
month = "10",
day = "1",
language = "English (US)",
pages = "315--324",
note = "2004 International Conference on Dependable Systems and Networks ; Conference date: 28-06-2004 Through 01-07-2004",

}

TY - CONF

T1 - The join problem in dynamic network algorithms

AU - Konwar, Kishori M.

AU - Kowalski, Dariusz R.

AU - Shvartsman, Alexander A.

PY - 2004/10/1

Y1 - 2004/10/1

N2 - Distributed algorithms in dynamic networks often employ communication patterns whose purpose is to disseminate information among the participants. Gossiping is one form of such communication pattern. In dynamic settings the set of participants can change substantially as new participants join, and as failures and voluntary departures remove those who have joined previously. A natural question for such settings is: how soon can newly joined nodes discover each other by means of gossiping? This paper abstracts and studies the Join Problem for dynamic systems that use all-to-all gossip. The problem is studied in terms of join-connectivity graphs where vertices represent the participants and where each edge represents one participant's knowledge about another. Ideally, such a graph has diameter one, i.e., all participants know each other. The diameter can grow as new participants join, and as failures remove edges from the graph. Gossip helps participants discover one another, decreasing the diameter. The results describe the lower and upper bounds on the number of communication rounds such that the participants who have previously joined discover one another, under a variety of assumptions about the joining and failures. For example, in the case when new participants join at multiple participants and participants may crash, the number of rounds cannot be bounded. In the more benign cases when the failures can be controlled or when new participants join at only one participant, the bound on rounds is shown to be logarithmic in the diameter of the initial configuration.

AB - Distributed algorithms in dynamic networks often employ communication patterns whose purpose is to disseminate information among the participants. Gossiping is one form of such communication pattern. In dynamic settings the set of participants can change substantially as new participants join, and as failures and voluntary departures remove those who have joined previously. A natural question for such settings is: how soon can newly joined nodes discover each other by means of gossiping? This paper abstracts and studies the Join Problem for dynamic systems that use all-to-all gossip. The problem is studied in terms of join-connectivity graphs where vertices represent the participants and where each edge represents one participant's knowledge about another. Ideally, such a graph has diameter one, i.e., all participants know each other. The diameter can grow as new participants join, and as failures remove edges from the graph. Gossip helps participants discover one another, decreasing the diameter. The results describe the lower and upper bounds on the number of communication rounds such that the participants who have previously joined discover one another, under a variety of assumptions about the joining and failures. For example, in the case when new participants join at multiple participants and participants may crash, the number of rounds cannot be bounded. In the more benign cases when the failures can be controlled or when new participants join at only one participant, the bound on rounds is shown to be logarithmic in the diameter of the initial configuration.

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

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

M3 - Paper

AN - SCOPUS:4544236083

SP - 315

EP - 324

ER -