Peer-to-peer streaming capacity

IEEE Transactions on Information Theory

Volumn 57, Issue 8, 2011, Pages 5072-5087

  Sengupta, Sudipta ^a   Liu, Shao ^a,b   Chen, Minghua ^c   Chiang, Mung ^d   Li, Jin ^a   Chou, Philip A ^a  

^a MICROSOFT RESEARCH   (United States)

^b GOOGLE INC   (United States)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^d Princeton University   (United States)

Author keywords

Internet content distribution; linear program; multicast tree; network degree bound; peer to peer network; primal dual; streaming capacity

Indexed keywords

INTERNET CONTENT; LINEAR PROGRAMS; MULTICAST TREE; NETWORK DEGREE BOUND; PEER TO PEER; PRIMAL-DUAL;

APPROXIMATION ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; INTERNET; MULTICASTING; OPTIMIZATION; PLANT EXTRACTS; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS; TOPOLOGY; TREES (MATHEMATICS);

PEER TO PEER NETWORKS;

EID: 79961000603     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2145630     Document Type: Review

References (15)

1. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization. New York: Athena Scientific, 1997.
2. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed steiner tree problems," in Proc. 9th Annu. ACM-SIAM SODA, 1998.
3. Y. J. Chu and T. H. Liu, "On the shortest arborescence of a directed graph," Science Sinica, pp. 1396-1400, 1965.
4. Y. Cui, B. Li, and K. Nahrstedt, "On achieving optimized capacity utilization in application overlay networks with multiple competing sessions," in ACM Symp. Parallelism in Algorithms and Architectures (SPAA), Jun. 2004.
5. U. Feige, "A threshold of ln n for approximating set cover," in Proc. 28th ACM STOC, 1996.
6. N. Garg and J. Konemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in Proc. IEEE Symp. Foundations of Computer Science, 1998.
7. N. Garg, G. Konjevod, and R. Ravi, "A polylogarithmic approximation algorithm for the group steiner tree problem," in Proc. ACMSymp. Discrete Algorithms (SODA)'98, 1998.
8. C. Huang, J. Li, and K. W. Ross, "Can internet video-on-demand be profitable?," in Proc. ACM SIGCOMM, Kyoto, Japan, Aug. 2007.
9. R. Kumar, Y. Liu, and K. Ross, "Stochastic fluid theory for p2p streaming systems," in Proc. IEEE Infocom 2007, Apr. 2007.
10. L. C. Lau, S. Naor,M. Salavatipour, and M. Singh, "Survivable network design with degree or order constraints," in Proc. 39th ACM STOC, 2007.
11. J. Li, P. A. Chou, and C. Zhang, "Mutualcast: An efficient mechanism for one-to-many content distribution," in Proc. ACM SIGCOMM ASIA Workshop, Apr. 2005.
12. S. Liu, M. Chen, S. Sengupta, M. Chiang, J. Li, and P. A. Chou, "P2p streaming capacity under node degree bound," in Proc. Int. Conf. Distributed Computing Systems (ICDCS) 2010, Jun. 2010.
13. S. Liu, M. Chiang, S. Sengupta, J. Li, and P. A. Chou, "Performance bounds for large-scale heterogeneous p2p streaming system," in Proc. Allerton Conf. 2008, Sept. 2008.
14. S. Liu, R. Zhang-Shen, W. Jiang, J. Rexford, and M. Chiang, "Performance bounds for peer-assisted live streaming," in Proc. ACM SIGMETRICS 2008, Jun. 2008.
15. T. Nguyen, K. Kolazhi, R. Kamath, S. Cheung, and D. Tran, "Efficient multimedia distribution in source constraint networks," IEEE Trans. Multimedia, vol. 10, no. 3, pp. 523-537, Apr. 2008. (Pubitemid 351459514)