The Community for Technology Leaders
Green Image
Issue No. 10 - October (2010 vol. 21)
ISSN: 1045-9219
pp: 1427-1441
John W. Byers , Boston University, Boston
Mema Roussopoulos , Univesity of Athens, Athens
Azer Bestavros , Boston University, Boston
Georgios Smaragdakis , Deutsche Telekom Laboratories/Technical University of Berlin, Berlin
Pietro Michiardi , Institut EURECOM, Sophia-Antipolis
Nikolaos Laoutaris , Telefonica Research, Barcelona
ABSTRACT
In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective data files. BitTorrent-like swarming protocols are ideal choices for handling such massive data volume transfers. The original BitTorrent targets one-to-many broadcasts of a single file to a very large number of receivers, and thus, by necessity, employs a suboptimized overlay topology. n-way broadcast applications, on the other hand, owing to their inherent complexity, are realizable only in small to medium scale networks. In this paper, we show that we can leverage this scale constraint to construct optimized overlay topologies that take into consideration the end-to-end characteristics of the network and as a consequence deliver far superior performance compared to random and myopic (greedy) approaches. We present the Max-Min and Max-Sum peer-selection policies used by individual nodes to select their neighbors. The first one strives to maximize the available bandwidth to the slowest destination, while the second maximizes the aggregate output rate. We design a swarming protocol suitable for n-way broadcast and operate it on top of overlay graphs formed by nodes that employ Max-Min or Max-Sum policies. Using measurements from a PlanetLab prototype implementation and trace-driven simulations, we demonstrate that the performance of swarming protocols on top of our constructed topologies is far superior to the performance of random and myopic overlays.
INDEX TERMS
Network formation, n-way broadcast, swarming protocols, flow networks.
CITATION
John W. Byers, Mema Roussopoulos, Azer Bestavros, Georgios Smaragdakis, Pietro Michiardi, Nikolaos Laoutaris, "Distributed Network Formation for n-Way Broadcast Applications", IEEE Transactions on Parallel & Distributed Systems, vol. 21, no. , pp. 1427-1441, October 2010, doi:10.1109/TPDS.2010.23
99 ms
(Ver 3.1 (10032016))