
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Georgios Smaragdakis, Nikolaos Laoutaris, Pietro Michiardi, Azer Bestavros, John W. Byers, Mema Roussopoulos, "Distributed Network Formation for nWay Broadcast Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 10, pp. 14271441, October, 2010.  
BibTex  x  
@article{ 10.1109/TPDS.2010.23, author = {Georgios Smaragdakis and Nikolaos Laoutaris and Pietro Michiardi and Azer Bestavros and John W. Byers and Mema Roussopoulos}, title = {Distributed Network Formation for nWay Broadcast Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {21}, number = {10}, issn = {10459219}, year = {2010}, pages = {14271441}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.23}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Distributed Network Formation for nWay Broadcast Applications IS  10 SN  10459219 SP1427 EP1441 EPD  14271441 A1  Georgios Smaragdakis, A1  Nikolaos Laoutaris, A1  Pietro Michiardi, A1  Azer Bestavros, A1  John W. Byers, A1  Mema Roussopoulos, PY  2010 KW  Network formation KW  nway broadcast KW  swarming protocols KW  flow networks. VL  21 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] G. Smaragdakis, N. Laoutaris, P. Michiardi, A. Bestavros, J.W. Byers, and M. Roussopoulos, "Swarming on Optimized Graphs for nWay Broadcast," Proc. IEEE INFOCOM, 2008.
[2] B. Cohen, "Incentives Build Robustness in BitTorrent," Proc. First Workshop Economics of PeertoPeer 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. 185221, 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/EECS200928, 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 BitTorrentLike PeertoPeer 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 MultiMessage Gossip," J. Parallel and Distributed Computing, vol. 67, no. 12, pp. 12321239, 2007.
[12] R. Kumar and K.W. Ross, "Optimal PeerAssisted File Distribution: Single and MultiClass 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. 46404654, 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. UrvoyKeller, E.W. Biersack, P.A. Felber, A.A. Hamra, and L. GarcesErice, "Dissecting BitTorrent: Five Months in a Torrent's Lifetime," Proc. Passive and Active Measurements (PAM), 2004.
[16] A. Legout, G. UrvoyKeller, 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, "EdgeDisjoint Branchings," Proc. Ninth Courant Computer Science Symp. Combinatorial Algorithms, pp. 9196, 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 BitTorrentLike File Sharing Protocols," IEEE/ACM Trans. Networking, vol. 17, no. 2, pp. 365376, Apr. 2009.
[21] L. Guo, S. Chen, Z. Xiao, E. Tan, X. Ding, and X. Zhang, "Measurements, Analysis, and Modeling of BitTorrentLike 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: HighBandwidth Multicast in Cooperative Environments," Proc. ACM Symp. Operating Systems Principles (SOSP), 2003.
[24] D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, "Bullet: HighBandwidth 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, "EndtoEnd Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput," IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 537549, 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. 319349, 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 KMedian and Facility Location Problems," SIAM J. Computing, vol. 33, no. 3, pp. 544562, 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. 6164, 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. 216, Feb. 2004.
[33] R. Mahajan, N. Spring, D. Wetherall, and T. Anderson, "Inferring Link Weights Using EndtoEnd 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.