DMCA
T-Man: Fast Gossip-based Constructions of Large-Scale Overlay Topologies (2004)
| Citations: | 18 - 0 self |
BibTeX
@TECHREPORT{Jelasity04t-man:fast,
author = {Mark Jelasity and Ozalp Babaoglu},
title = {T-Man: Fast Gossip-based Constructions of Large-Scale Overlay Topologies},
institution = {},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Topology, as defined by the "who knows whom" relation, has many applications that are of crucial importance in distributed systems. For example, characteristics of the communication topology play a key role in determining the performance of many functions including search, routing, monitoring, control and information dissemination. Other essential properties of functions such as scalability and robustness to failures are also heavily dependant on the communication topology. The "who knows whom" relation can also be used to define solutions for problems such as sorting a set of numbers, clustering nodes based on similarity or pairing search requests with the locations of the information. In large-scale, dynamic, fully distributed systems constructing and maintaining a topology is a highly non-trivial problem. In this paper we identify topology management as an abstract service, independent of application or function, and propose a gossipbased scheme called T-MAN for the construction of a large class of different topologies. The topology is defined by a ranking function which can be based on any appropriate property of components, including geographical location, semantic proximity, bandwidth, or simply on an abstract, pre-defined topology over an ID space like a ring or a torus. In the present work, we examine three specific topologies: ring, torus and binary tree. We give theoretical arguments and experimental results to demonstrate that the proposed protocol is lightweight and fast in that it converges quickly, approximately in logarithmic time, and that this speed is largely independent of the actual topology being constructed. We also demonstrate how to apply T-MAN for sorting a set of numbers. Finally, we address some practical issues and propose techniques to impro...
Keyphrases
large-scale overlay topology gossip-based construction communication topology pre-defined topology key role different topology essential property geographical location distributed system id space binary tree non-trivial problem practical issue many function information dissemination appropriate property search request abstract service experimental result topology management actual topology gossipbased scheme many application crucial importance ranking function semantic proximity large class present work specific topology theoretical argument logarithmic time
