Title :
Scalability in adaptive multi-metric overlays
Author :
A. Rodriguez;D. Kostic;A. Vahdat
Author_Institution :
Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
fDate :
6/26/1905 12:00:00 AM
Abstract :
Increasing application requirements have placed heavy emphasis on building overlay networks to efficiently deliver data to multiple receivers. A key performance challenge is simultaneously achieving adaptivity to changing network conditions and scalability to large numbers of users. In addition, most current algorithms focus on a single performance metric, such as delay or bandwidth, particular to individual application requirements. We introduce a two-fold approach for creating robust, high-performance overlays called adaptive multimetric overlays (AMMO). First, AMMO uses an adaptive, highly-parallel, and metric-independent protocol, TreeMaint, to build and maintain overlay trees. Second, AMMO provides a mechanism for comparing overlay edges along specified application performance goals to guide TreeMaint transformations. We have used AMMO to implement and evaluate a single-metric (bandwidth-optimized) tree similar to Overcast and a two-metric (delay-constrained, cost-optimized) overlay.
Keywords :
"Scalability","Peer to peer computing","Probes","Delay","Bandwidth","Protocols","Computer science","Measurement","Data engineering","Drives"
Conference_Titel :
Distributed Computing Systems, 2004. Proceedings. 24th International Conference on
Print_ISBN :
0-7695-2086-3
DOI :
10.1109/ICDCS.2004.1281574