Optimal content placement for peer-to-peer video-on-demand systems

IEEE/ACM Transactions on Networking

Volumn 21, Issue 2, 2013, Pages 566-579

  Tan, Bo ^a,b   Massoulié, Laurent ^c  

^a United States of America   (United States)

^b New Jersey Research Center of QUALCOMM Inc   (United States)

^c Technicolor Paris Research Lab   (France)

Author keywords

cache management; content distribution networks; content placement; loss networks; optimization; peer to peer (P2P) computing; streaming media; video on demand (VoD)

Indexed keywords

CACHE MANAGEMENT; CONTENT DISTRIBUTION NETWORKS; CONTENT PLACEMENT; LOSS NETWORKS; PEER-TO-PEER COMPUTING; STREAMING MEDIA; VIDEO-ON-DEMAND (VOD);

DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; OPTIMIZATION;

PEER TO PEER NETWORKS;

EID: 84876292188     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2012.2208199     Document Type: Article

References (19)

1. J. M. Almeida, D. L. Eager, M. K. Vernon, and S. J. Wright, "Minimizing delivery cost in scalable streaming content distribution systems," IEEE Trans. Multimedia, vol. 6, no. 2, pp. 356-365, Apr. 2004.
2. B. Bollobás, Modern Graph Theory. New York: Springer, 1998.
3. Y. Boufkhad, F. Mathieu, F. de Montgolfier, D. Perino, and L. Viennot, "Achievable catalog size in peer-to-peervideo-on-demand systems," in Proc.7thIPTPS,2008,pp 4-4.
4. L. Breslau, P. Cao, L. Fan, G. Philips, and S. Shenker, "Web caching and Zipf-like distributions: Evidence and implications," inProc IEEE INFOCOM, Mar. 1999, vol. 1, pp. 126-134.
5. M. Draiefand L. Massoulie, "Epidemics and rumours in complex net- works," in The London Mathematical Society Lecture Note Series. Cambridge, U.K.: Cambridge Univ. Press, 2010.
6. J. Kangasharju, K. W. Ross, and D. A. Turner, "Optimizing file avail- abilityinpeer-to-peercontentdistribution,"inProc.IEEE INFOCOM, 2007, pp. 1973-1981.
7. F. Kelly, "Loss networks," Ann. Appl. Probab., vol. 1, no. 3, pp. 319-378, 1991.
8. A. Klenke and L. Mattner, "Stochastic ordering ofclassical discrete distributions, "Adv. Appl. Probab., vol. 42, no. 2, pp. 392-410, 2010.
9. N. Laoutaris V. Zissimopoulos, and I. Stavrakakis, "Onthe optimiza- tion ofstorage capacity allocation for content distribution," Comput. Netw., vol. 47, pp. 409-428, 2003.
10. M. Mitzenmacher and E. Upfal, Probability and Computing: Random- izedAlgorithmsandProbabilisticAnalysis. Cambridge,U.K.: Cambridge Univ. Press, 2005.
11. K. Suh, C. Diot, J. Kurose, L. Massoulie, C. Neumann, D. Towsley, and M. Varvello, "Push-to-peervideo-on-demand system: Design and eval- uation," IEEEJ. Sel. Areas Commun., vol. 25, no. 9, pp. 1706-1716, Dec. 2007.
12. B. Tan and L. Massoulie, "Optimal content placement for peer-to-peer video-on-demand systems," inProc IEEEINFOCOM, Apr. 2011, pp. 694-702.
13. B. Tan and L. Massoulie, "Optimal content placement for peer-to-peer video-on-demand systems," 2011 [Online]. Available: http://arxiv.org/ abs/1004.4709
14. S. Tewari and L. Kleinrock, "On fairness, optimal download perfor- mance and proportional replication in peer-to-peer networks," inIFIP LectureNotes Comput. Sci. (LNCS), 2011, vol. 3462, pp. 709-717.
15. S. Tewari and L. Kleinrock, "Proportional replication in peer-to-peer networks," inProc. IEEEINFOCOM, 2006, pp. 1-12.
16. D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge, U.K.: Cambridge Univ. Press, 2005.
17. V. Valancius, N. Laoutaris, L. Massoulie, C. Diot, and P. Rodriguez, "Greening the internet with nano data centers," in Proc. 5th CoNEXT, 2009, pp. 37-48.
18. J. Wu and B. Li, "Keep cache replacement simple in peer-assisted VoD systems," inProc IEEEINFOCOMMini-Conf., 2009, pp. 2591-2595.
19. X. Zhou and C.-Z. Xu, "Efficient algorithms ofvideo replication and placement on a cluster of streaming servers," J. Netw. Comput. Appl., vol.30,no.2,pp.515-540,Apr.2007.