메뉴 건너뛰기




Volumn 24, Issue 4, 2016, Pages 2114-2127

Optimal Content Placement for a Large-Scale VoD System

Author keywords

Content placement; integer programming; video on demand

Indexed keywords

BANDWIDTH; FREQUENCY ESTIMATION; IPTV; LINEAR PROGRAMMING; VIDEO ON DEMAND;

EID: 84945402149     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2015.2461599     Document Type: Article
Times cited : (63)

References (26)
  • 1
    • 84983666810 scopus 로고    scopus 로고
    • Amazon Prime vs. Netflix-Difference and comparison, " [Online] Available
    • "Amazon Prime vs. Netflix-Difference and comparison, " [Online]. Available: http://www. diffen. com/difference/Amazon-Prime-Instant-Video-vs-Netflix
  • 4
    • 84875551391 scopus 로고    scopus 로고
    • Content placement via the exponential potential function method
    • Integer Programming and Combinatorial Optimization, M. Goemans and J. Correa, Eds. Berlin, Germany: Springer
    • D. Applegate, A. Archer, V. Gopalakrishnan, S. Lee, K. Ramakrishnan, "Content placement via the exponential potential function method, " in Integer Programming and Combinatorial Optimization, M. Goemans and J. Correa, Eds. Berlin, Germany: Springer, 2013, vol. 7801, Lecture Notes in Computer Science, pp. 49-61.
    • (2013) Lecture Notes in Computer Science , vol.7801 , pp. 49-61
    • Applegate, D.1    Archer, A.2    Gopalakrishnan, V.3    Lee, S.4    Ramakrishnan, K.5
  • 7
    • 55249124781 scopus 로고    scopus 로고
    • Approximation algorithms for data placement problems
    • I. D. Baev, R. Rajaraman, C. Swamy, "Approximation algorithms for data placement problems, " SIAM J. Comput., vol. 38, no. 4, pp. 1411-1429, 2008.
    • (2008) SIAM J. Comput. , vol.38 , Issue.4 , pp. 1411-1429
    • Baev, I.D.1    Rajaraman, R.2    Swamy, C.3
  • 8
    • 11344279204 scopus 로고    scopus 로고
    • Known content network (CN) request-routing mechanisms
    • Jul.
    • A. Barbir et al., "Known content network (CN) request-routing mechanisms, " RFC 3568, Jul. 2003.
    • (2003) RFC , vol.3568
    • Barbir, A.1
  • 9
    • 77953315902 scopus 로고    scopus 로고
    • Distributed caching algorithms for content distribution networks
    • S. Borst, V. Gupta, A. Walid, "Distributed caching algorithms for content distribution networks, " in Proc. IEEE INFOCOM, 2010, pp. 1-9.
    • (2010) Proc IEEE INFOCOM , pp. 1-9
    • Borst, S.1    Gupta, V.2    Walid, A.3
  • 10
    • 42149149254 scopus 로고    scopus 로고
    • I tube, you tube, everybody tubes: Analyzing the world's largest user generated content video system
    • M. Cha, H. Kwak, P. Rodriguez, Y.-Y. Ahn, S. Moon, "I tube, you tube, everybody tubes: Analyzing the world's largest user generated content video system, " in Proc. ACM IMC, 2007, pp. 1-14.
    • (2007) Proc. ACM IMC , pp. 1-14
    • Cha, M.1    Kwak, H.2    Rodriguez, P.3    Ahn, Y.-Y.4    Moon, S.5
  • 11
    • 24344486815 scopus 로고    scopus 로고
    • Improved combinatorial algorithms for facility location problems
    • M. Charikar and S. Guha, "Improved combinatorial algorithms for facility location problems, " SIAMJ. Comput., vol. 34, no. 4, pp. 803-824, 2005.
    • (2005) SIAMJ. Comput. , vol.34 , Issue.4 , pp. 803-824
    • Charikar, M.1    Guha, S.2
  • 12
    • 0020141865 scopus 로고
    • Comparative models of the file assignment problem
    • L. W. Dowdy and D. V. Foster, "Comparative models of the file assignment problem, " Comput. Surv., vol. 14, no. 2, pp. 287-313, 1982.
    • (1982) Comput. Surv. , vol.14 , Issue.2 , pp. 287-313
    • Dowdy, L.W.1    Foster, D.V.2
  • 13
    • 0034206002 scopus 로고    scopus 로고
    • Summary cache: A scalable wide-area web cache sharing protocol
    • Jun.
    • L. Fan, P. Cao, J. Almeida, A. Z. Broder, "Summary cache: A scalable wide-area web cache sharing protocol, " IEEE/ACM Trans. Netw., vol. 8, no. 3, pp. 281-293, Jun. 2000.
    • (2000) IEEE/ACM Trans. Netw. , vol.8 , Issue.3 , pp. 281-293
    • Fan, L.1    Cao, P.2    Almeida, J.3    Broder, A.Z.4
  • 14
    • 42549097902 scopus 로고    scopus 로고
    • Faster and simpler algorithms for multicommodity flow and other fractional packing problems
    • N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems, " SIAM J. Comput., vol. 37, no. 2, pp. 630-652, 2007.
    • (2007) SIAM J. Comput. , vol.37 , Issue.2 , pp. 630-652
    • Garg, N.1    Könemann, J.2
  • 15
    • 36349022690 scopus 로고    scopus 로고
    • Does internet media traffic really follow Zipf-like distribution?
    • New York, NY, USA
    • L. Guo, E. Tan, S. Chen, Z. Xiao, X. Zhang, "Does internet media traffic really follow Zipf-like distribution?, " in Proc. ACM SIGMETRICS, New York, NY, USA, 2007, pp. 359-360.
    • (2007) Proc. ACM SIGMETRICS , pp. 359-360
    • Guo, L.1    Tan, E.2    Chen, S.3    Xiao, Z.4    Zhang, X.5
  • 16
    • 36949017938 scopus 로고    scopus 로고
    • Can internet video-on-demand be profitable?
    • C. Huang, J. Li, K. W. Ross, "Can internet video-on-demand be profitable?, " in Proc. ACM SIGCOMM, 2007, pp. 133-144.
    • (2007) Proc. ACM SIGCOMM , pp. 133-144
    • Huang, C.1    Li, J.2    Ross, K.W.3
  • 17
    • 65449121157 scopus 로고    scopus 로고
    • Factorization meets the neighborhood: A multifaceted collaborative filtering model
    • Y. Koren, "Factorization meets the neighborhood: A multifaceted collaborative filtering model, " in Proc. ACM SIGKDD, 2008, pp. 426-434.
    • (2008) Proc. ACM SIGKDD , pp. 426-434
    • Koren, Y.1
  • 18
    • 0035693331 scopus 로고    scopus 로고
    • LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies
    • Dec.
    • D. Lee et al., "LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies, " IEEE Trans. Comput., vol. 50, no. 12, pp. 1352-1361, Dec. 2001.
    • (2001) IEEE Trans. Comput. , vol.50 , Issue.12 , pp. 1352-1361
    • Lee, D.1
  • 22
    • 56349086025 scopus 로고    scopus 로고
    • Equipment allocation in video-on-demand network deployments
    • Oct.
    • F. Thouin and M. Coates, "Equipment allocation in video-on-demand network deployments, " Trans. Multimedia Comput. Commun. Appl., vol. 5, no. 1, pp. 5:1-5:22, Oct. 2008.
    • (2008) Trans. Multimedia Comput. Commun. Appl. , vol.5 , Issue.1 , pp. 51-522
    • Thouin, F.1    Coates, M.2
  • 25
    • 65349141487 scopus 로고    scopus 로고
    • Network bandwidth requirements for scalable on-demand streaming
    • Aug.
    • Y. Zhao, D. L. Eager, M. K. Vernon, "Network bandwidth requirements for scalable on-demand streaming, " IEEE/ACM Trans. Netw., vol. 15, no. 4, pp. 878-891, Aug. 2007.
    • (2007) IEEE/ACM Trans. Netw. , vol.15 , Issue.4 , pp. 878-891
    • Zhao, Y.1    Eager, D.L.2    Vernon, M.K.3
  • 26
    • 84948458543 scopus 로고    scopus 로고
    • Optimal video replication and placement on a cluster of video-on-demand servers
    • X. Zhou and C.-Z. Xu, "Optimal video replication and placement on a cluster of video-on-demand servers, " in Proc. IEEE ICPP, 2002, pp. 547-555.
    • (2002) Proc IEEE ICPP , pp. 547-555
    • Zhou, X.1    Xu, C.-Z.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.