Randomized decentralized broadcasting algorithms

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1073-1081

  Massoulie, Laurent ^a   Twigg, Andy ^a   Gkantsidist, Christos ^b   Rodriguez, Pablo ^c  

^a Thomson Research   (France)

^b MICROSOFT RESEARCH   (United Kingdom)

^c TELEFONICA RESEARCH   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GRAPHIC METHODS; PACKET NETWORKS; PROBLEM SOLVING; THEOREM PROVING; USER INTERFACES;

RANDOMIZED DECENTRALIZED BROADCASTING ALGORITHMS; SKIPPED PACKETS;

BROADCASTING;

EID: 34548309476     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.129     Document Type: Conference Paper

References (15)

1. J.Edmonds, "Edge-disjoint branchings," in Combinatorial Algorithms, R. Rustin, Ed., pp. 21-31. Algorithmics Press, 1972.
2. Laszlo Lovasz, "On two minimax theorems in graph," Journal of Combinatorial Thoery, vol. 21, pp. 96-103, 1976.
3. Po Tong and E.L. Lawler, "A faster algorithm for finding edge-disjoint branchings," Information Processing Letters, vol. 17, pp. 73-76, 1983.
4. H.N. Gabow, "A matroid approach to finding edge connectivity and packing arborescences," Journal of Computer and System Sciences, vol. 50, no. 2, pp. 259-273, 1995.
5. Harold Gabow and K.S. Manu, "Packing algorithms for arborescences (and spanning trees) in capacitated graphs," Mathematical Programming, vol. 82, pp. 83-109, 1998.
6. X. Zhang, J. Liu, B. Li, and T.-S. P. Yum, "CoolStreaming/DONet: A data-driven overlay network for peer-to-peer live media streaming," in IEEE Infocom. 2005, IEEE Press.
7. "Pplive," http://www.pplive.com/.
8. "Splitstream: High-bandwidth content distribution," http : //research.microsoft.com/~antr/SplitStream/default.htm, Aug 2003.
9. H.Q. Ye, J.H. Ou, and X.M. Yuan, "Stability of data networks: Stationary and bursty models," Operations Research, vol. 53, no. 1, pp. 107-125, 2005.
10. J.G. Dai, "On positive harris recurrence of multiclass queueing networks: a unified approach via fluid limit models," Ann. of Applied Probability, vol. 5, pp. 49-77, 1995.
11. L. Massoulie, A. Twigg, C. Gkantsidis, and P. Rodriguez, "Provably optimal decentralized broadcast algorithms," Tech. Rep. MSR-TR-2006-105, Microsoft Research, Jul 2006.
12. P. Robert, Stochastic Networks and Queues, Springer, 2003.
13. Zongpeng Li, Baochun Li, Dan Jiang, and Lap Chi Lau, "On achieving optimal throughput with network coding," in Proc. Infocom, 2005.
14. Paul Tseng and Dimitri P. Bertsekas, "A epsilon-relaxation method for generalized separable convex cost network flow problems," in Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization, London, UK, 1996, pp. 85-93, Springer-Verlag.
15. Ashwin Bharambe, Cormac Herley, and Venkata Padmanabhan, "Analyzing and improving bittorrent performance," Tech. Rep. MSR-TR-2005-03, Microsoft Research, feb 2005.