T-Man: Gossip-based fast overlay topology construction

M. Jelasity, Alberto Montresor, Ozalp Babaoglu

Research output: Contribution to journalArticle

144 Citations (Scopus)

Abstract

Large-scale overlay networks have become crucial ingredients of fully-decentralized applications and peer-to-peer systems. Depending on the task at hand, overlay networks are organized into different topologies, such as rings, trees, semantic and geographic proximity networks. We argue that the central role overlay networks play in decentralized application development requires a more systematic study and effort towards understanding the possibilities and limits of overlay network construction in its generality. Our contribution in this paper is a gossip protocol called T-Man that can build a wide range of overlay networks from scratch, relying only on minimal assumptions. The protocol is fast, robust, and very simple. It is also highly configurable as the desired topology itself is a parameter in the form of a ranking method that orders nodes according to preference for a base node to select them as neighbors. The paper presents extensive empirical analysis of the protocol along with theoretical analysis of certain aspects of its behavior. We also describe a practical application of T-Man for building Chord distributed hash table overlays efficiently from scratch.

Original languageEnglish
Pages (from-to)2321-2339
Number of pages19
JournalComputer Networks
Volume53
Issue number13
DOIs
Publication statusPublished - Aug 28 2009

Fingerprint

Overlay networks
Topology
Network protocols
Semantics

Keywords

  • Bootstrapping
  • Gossip-based protocols
  • Overlay networks
  • Self-organizing middleware

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

T-Man : Gossip-based fast overlay topology construction. / Jelasity, M.; Montresor, Alberto; Babaoglu, Ozalp.

In: Computer Networks, Vol. 53, No. 13, 28.08.2009, p. 2321-2339.

Research output: Contribution to journalArticle

Jelasity, M. ; Montresor, Alberto ; Babaoglu, Ozalp. / T-Man : Gossip-based fast overlay topology construction. In: Computer Networks. 2009 ; Vol. 53, No. 13. pp. 2321-2339.
@article{c14f053816c64e9b80320839939786b8,
title = "T-Man: Gossip-based fast overlay topology construction",
abstract = "Large-scale overlay networks have become crucial ingredients of fully-decentralized applications and peer-to-peer systems. Depending on the task at hand, overlay networks are organized into different topologies, such as rings, trees, semantic and geographic proximity networks. We argue that the central role overlay networks play in decentralized application development requires a more systematic study and effort towards understanding the possibilities and limits of overlay network construction in its generality. Our contribution in this paper is a gossip protocol called T-Man that can build a wide range of overlay networks from scratch, relying only on minimal assumptions. The protocol is fast, robust, and very simple. It is also highly configurable as the desired topology itself is a parameter in the form of a ranking method that orders nodes according to preference for a base node to select them as neighbors. The paper presents extensive empirical analysis of the protocol along with theoretical analysis of certain aspects of its behavior. We also describe a practical application of T-Man for building Chord distributed hash table overlays efficiently from scratch.",
keywords = "Bootstrapping, Gossip-based protocols, Overlay networks, Self-organizing middleware",
author = "M. Jelasity and Alberto Montresor and Ozalp Babaoglu",
year = "2009",
month = "8",
day = "28",
doi = "10.1016/j.comnet.2009.03.013",
language = "English",
volume = "53",
pages = "2321--2339",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "13",

}

TY - JOUR

T1 - T-Man

T2 - Gossip-based fast overlay topology construction

AU - Jelasity, M.

AU - Montresor, Alberto

AU - Babaoglu, Ozalp

PY - 2009/8/28

Y1 - 2009/8/28

N2 - Large-scale overlay networks have become crucial ingredients of fully-decentralized applications and peer-to-peer systems. Depending on the task at hand, overlay networks are organized into different topologies, such as rings, trees, semantic and geographic proximity networks. We argue that the central role overlay networks play in decentralized application development requires a more systematic study and effort towards understanding the possibilities and limits of overlay network construction in its generality. Our contribution in this paper is a gossip protocol called T-Man that can build a wide range of overlay networks from scratch, relying only on minimal assumptions. The protocol is fast, robust, and very simple. It is also highly configurable as the desired topology itself is a parameter in the form of a ranking method that orders nodes according to preference for a base node to select them as neighbors. The paper presents extensive empirical analysis of the protocol along with theoretical analysis of certain aspects of its behavior. We also describe a practical application of T-Man for building Chord distributed hash table overlays efficiently from scratch.

AB - Large-scale overlay networks have become crucial ingredients of fully-decentralized applications and peer-to-peer systems. Depending on the task at hand, overlay networks are organized into different topologies, such as rings, trees, semantic and geographic proximity networks. We argue that the central role overlay networks play in decentralized application development requires a more systematic study and effort towards understanding the possibilities and limits of overlay network construction in its generality. Our contribution in this paper is a gossip protocol called T-Man that can build a wide range of overlay networks from scratch, relying only on minimal assumptions. The protocol is fast, robust, and very simple. It is also highly configurable as the desired topology itself is a parameter in the form of a ranking method that orders nodes according to preference for a base node to select them as neighbors. The paper presents extensive empirical analysis of the protocol along with theoretical analysis of certain aspects of its behavior. We also describe a practical application of T-Man for building Chord distributed hash table overlays efficiently from scratch.

KW - Bootstrapping

KW - Gossip-based protocols

KW - Overlay networks

KW - Self-organizing middleware

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

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

U2 - 10.1016/j.comnet.2009.03.013

DO - 10.1016/j.comnet.2009.03.013

M3 - Article

AN - SCOPUS:67650520327

VL - 53

SP - 2321

EP - 2339

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 13

ER -