The Community for Technology Leaders
RSS Icon
Issue No.10 - October (2010 vol.21)
pp: 1427-1441
Georgios Smaragdakis , Deutsche Telekom Laboratories/Technical University of Berlin, Berlin
Nikolaos Laoutaris , Telefonica Research, Barcelona
Pietro Michiardi , Institut EURECOM, Sophia-Antipolis
Azer Bestavros , Boston University, Boston
John W. Byers , Boston University, Boston
Mema Roussopoulos , Univesity of Athens, Athens
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.
Network formation, n-way broadcast, swarming protocols, flow networks.
Georgios Smaragdakis, Nikolaos Laoutaris, Pietro Michiardi, Azer Bestavros, John W. Byers, Mema Roussopoulos, "Distributed Network Formation for n-Way Broadcast Applications", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 10, pp. 1427-1441, October 2010, doi:10.1109/TPDS.2010.23
[1] G. Smaragdakis, N. Laoutaris, P. Michiardi, A. Bestavros, J.W. Byers, and M. Roussopoulos, "Swarming on Optimized Graphs for n-Way Broadcast," Proc. IEEE INFOCOM, 2008.
[2] B. Cohen, "Incentives Build Robustness in BitTorrent," Proc. First Workshop Economics of Peer-to-Peer Systems, 2003.
[3] X. Li, F. Bian, M. Crovella, C. Diot, R. Govindan, and G. Iannaccone, "Detection and Identification of Network Anomalies," Proc. ACM Internet Measurement Conf. (IMC), 2006.
[4] P.A. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems," ACM Computing Surveys, vol. 13, no. 2, pp. 185-221, 1981.
[5] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H. Katz, A. Konwinski, G. Lee, D.A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, "Above the Clouds: A Berkeley View of Cloud Computing," Technical Report UCB/EECS-2009-28, EECS Dept., Univ. of California, Berkeley, Feb. 2009.
[6] A. Legout, N. Liogkas, E. Kohler, and L. Zhang, "Clustering and Sharing Incentives in BitTorrent Systems," Proc. ACM SIGMETRICS, 2007.
[7] A. Fabrikant, A. Luthra, E. Maneva, C.H. Papadimitriou, and S. Shenker, "On a Network Creation Game," Proc. ACM Symp. Principles of Distributed Computing (PODC), 2003.
[8] N. Laoutaris, G. Smaragdakis, A. Bestavros, and J. Byers, "Implications of Selfish Neighbor Selection in Overlay Networks," Proc. IEEE INFOCOM, 2007.
[9] D. Qiu and R. Srikant, "Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks," Proc. ACM SIGCOMM, 2004.
[10] L. Massoulie and M. Vojnovic, "Coupon Replication Systems," Proc. ACM SIGMETRICS, 2005.
[11] Y. Fernandess and D. Malkhi, "On Collaborative Content Distribution Using Multi-Message Gossip," J. Parallel and Distributed Computing, vol. 67, no. 12, pp. 1232-1239, 2007.
[12] R. Kumar and K.W. Ross, "Optimal Peer-Assisted File Distribution: Single and Multi-Class Problems," Proc. IEEE Workshop Hot Topics in Web Systems and Technologies (HOTWEB), 2006.
[13] S. Sanghavi, B. Hajek, and L. Massoulie, "Gossiping with Multiple Messages," IEEE Trans. Information Theory, vol. 53, no. 12, pp. 4640-4654, Dec. 2007.
[14] A.R. Bharambe, C. Herley, and V.N. Padmanabhan, "Analyzing and Improving a BitTorrent Networks Performance Mechanisms," Proc. IEEE INFOCOM, 2006.
[15] M. Izal, G. Urvoy-Keller, E.W. Biersack, P.A. Felber, A.A. Hamra, and L. Garces-Erice, "Dissecting BitTorrent: Five Months in a Torrent's Lifetime," Proc. Passive and Active Measurements (PAM), 2004.
[16] A. Legout, G. Urvoy-Keller, and P. Michiardi, "Rarest First and Choke Algorithms Are Enough," Proc. ACM Internet Measurement Conf. (IMC), 2006.
[17] L. Massoulie, A. Twigg, C. Gkantsidis, and P. Rodriguez, "Randomized Decentralized Broadcasting Algorithms," Proc. IEEE INFOCOM, 2007.
[18] J. Edmonds, "Edge-Disjoint Branchings," Proc. Ninth Courant Computer Science Symp. Combinatorial Algorithms, pp. 91-96, 1972.
[19] C. Gkantsidis and P. Rodriguez, "Network Coding for Large Scale Content Distribution," Proc. IEEE INFOCOM, 2005.
[20] B. Fan, J.C.S. Lui, and D.-M. Chiu, "The Design Trade Offs of BitTorrent-Like File Sharing Protocols," IEEE/ACM Trans. Networking, vol. 17, no. 2, pp. 365-376, Apr. 2009.
[21] L. Guo, S. Chen, Z. Xiao, E. Tan, X. Ding, and X. Zhang, "Measurements, Analysis, and Modeling of BitTorrent-Like Systems," Proc. ACM Internet Measurement Conf. (IMC), 2005.
[22] Y. Tian, D. Wu, and K.-W. Ng, "Analyzing Multiple File Downloading in BitTorrent," Proc. Int'l Conf. Parallel Processing (ICPP), 2006.
[23] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-Bandwidth Multicast in Cooperative Environments," Proc. ACM Symp. Operating Systems Principles (SOSP), 2003.
[24] D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, "Bullet: High-Bandwidth Data Dissemination Using an Overlay Mesh," Proc. ACM Symp. Operating Systems Principles (SOSP), 2003.
[25] H. Zhang, G. Neglia, D. Towsley, and G.L. Presti, "On Unstructured File Sharing Networks," Proc. IEEE INFOCOM, 2007.
[26] M. Jain and C. Dovrolis, "End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput," IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 537-549, Aug. 2003.
[27] S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319-349, 1988.
[28] V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, and L. Cottrell, "PathChirp: Efficient Available Bandwidth Estimation for Network Paths," Proc. Passive and Active Measurements (PAM), 2003.
[29] V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, "Local Search Heuristics for K-Median and Facility Location Problems," SIAM J. Computing, vol. 33, no. 3, pp. 544-562, 2004.
[30] R.H. Bisseling, Parallel Scientific Computation: A Structured Approach Using BSP and MPI. Oxford Univ. Press, 2004.
[31] N. Feamster, L. Gao, and J. Rexford, "How to Lease the Internet in Your Spare Time," SIGCOMM Computer Comm. Rev., vol. 37, no. 1, pp. 61-64, 2007.
[32] N. Spring, R. Mahajan, D. Wetherall, and T. Anderson, "Measuring ISP Topologies with Rocketfuel," IEEE/ACM Trans. Networking, vol. 12, no. 1, pp. 2-16, Feb. 2004.
[33] R. Mahajan, N. Spring, D. Wetherall, and T. Anderson, "Inferring Link Weights Using End-to-End Measurements," Proc. Second ACM SIGCOMM Workshop Internet Measurement (IMW), 2002.
[34] A. Singh, M. Castro, P. Druschel, and A. Rowstron, "Defending against Eclipse Attacks on Overlay Networks," Proc. ACM SIGOPS European Workshop, 2004.
13 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool