Optimal content placement for a large-scale VoD system

Proceedings of the 6th International Conference on Emerging Networking Experiments and Technologies, Co-NEXT'10

Volumn , Issue , 2010, Pages

  Applegate, David ^a   Archer, Aaron ^a   Gopalakrishnan, Vijay ^a   Lee, Seungjoon ^a   Ramakrishnan, K K ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE REPLACEMENT POLICY; DECOMPOSITION TECHNIQUE; DISK SPACE; IPTV SERVICES; LAGRANGIAN RELAXATION; LINK BANDWIDTH; LP RELAXATION; MIXED-INTEGER PROGRAMS; NEAR-OPTIMAL SOLUTIONS; NETWORK BANDWIDTH; OPERATIONAL SYSTEMS; OPTIMAL CONTENT; ORDERS OF MAGNITUDE; PLACEMENT STRATEGY; PRACTICAL ISSUES; STANDARD SOFTWARE;

BANDWIDTH; DISKS (STRUCTURAL COMPONENTS); FREQUENCY ESTIMATION; IPTV; OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 79951635390     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1921168.1921174     Document Type: Conference Paper

References (20)

1. H. A. Alzoubi, S. Lee, M. Rabinovich, O. Spatscheck, and J. V. der Merwe. Anycast CDNs revisited. In Proceeding of WWW, 2008.
2. S. Asur and B. A. Huberman. Predicting the future with social media. arXiv:1003.5699v1 [cs.CY], 2010.
3. I. D. Baev, R. Rajaraman, and C. Swamy. Approximation algorithms for data placement problems. SIAM J. Computing, 38(4):1411-1429, 2008.
4. A. Barbir, B. Cain, F. Douglis, M. Green, M. Hofmann, R. Nair, D. Potter, and O. Spatscheck. Known Content Network (CN) Request-Routing Mechanisms. RFC 3568, July 2003.
5. D. Bienstock. Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. Kluwer, 2002.
6. S. Borst, V. Gupta, and A. Walid. Distributed caching algorithms for content distribution networks. In Proceeding of IEEE Infocom, 2010.
7. J. Byrka and K. Aardal. An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM Journal on Computing, 39(6):2212-2231, 2010.
8. M. Cha, H. Kwak, P. Rodriguez, Y.-Y. Ahn, and S. Moon. I Tube, You Tube, Everybody Tubes: Analyzing the World's Largest User Generated Content Video System. In Proceedings of ACM IMC, 2007.
9. L. W. Dowdy and D. V. Foster. Comparative models of the file assignment problem. ACM Comput. Surv., 14(2):287-313, 1982.
10. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans. Netw., 8(3):281-293, 2000.
11. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput., 37(2):630-652, 2007. (Pubitemid 351584860)
12. L. Guo, E. Tan, S. Chen, Z. Xiao, and X. Zhang. Does internet media traffic really follow zipf-like distribution? In Proceedings of ACM SIGMETRICS, New York, NY, USA, 2007.
13. C. Huang, J. Li, and K. W. Ross. Can internet video-on-demand be profitable? In Proceedings of ACM Sigcomm, 2007.
14. Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In Proceeding of ACM SIGKDD, 2008.
15. D. Lee, J. Choi, J. H. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. Comput., 50(12):1352-1361, 2001.
16. L. Qiu, V. N. Padmanabhan, and G. M. Voelker. On the placement of web server replicas. In Proceeding of IEEE Infocom, 2001.
17. N. Spring, R. Mahajan, and D. Wetherall. Measuring isp topologies with rocketfuel. In Proceedings of ACM SIGCOMM, 2002.
18. V. Valancius, N. Laoutaris, L. Massoulié, C. Diot, and P. Rodriguez. Greening the internet with nano data centers. In Proceedings of ACM CoNEXT, 2009.
19. Y. Zhao, D. L. Eager, and M. K. Vernon. Network bandwidth requirements for scalable on-demand streaming. IEEE/ACM Trans. Netw., 15(4):878-891, 2007.
20. X. Zhou and C.-Z. Xu. Optimal video replication and placement on a cluster of video-on-demand servers. In Proc. IEEE ICPP, 2002.