Swarming on Optimized Graphs for n-Way Broadcast

12 years 2 hour ago
Swarming on Optimized Graphs for n-Way Broadcast
—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 an almost random overlay topology. n-way broadcast applications on the other hand, owing to their inherent n-squared nature, 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 (local) approaches. We present the Max-Min and MaxSum peer-selection policies used by individual nodes to select thei...
Georgios Smaragdakis, Azer Bestavros, Nikolaos Lao
Added 31 May 2010
Updated 31 May 2010
Type Conference
Year 2008
Authors Georgios Smaragdakis, Azer Bestavros, Nikolaos Laoutaris, John W. Byers, Pietro Michiardi, Mema Roussopoulos
Comments (0)