Complexity Results for the Design Problem of Content Distribution Networks
暂无分享,去创建一个
[1] Iradj Ouveysi,et al. Designing cost-effective content distribution networks , 2007, Comput. Oper. Res..
[2] Anurag Agarwal,et al. Designing content distribution networks for optimal cost and performance , 2012, Inf. Technol. Manag..
[3] K. Walkowiak,et al. An exact algorithm for design of content delivery networks in MPLS environment , 2004 .
[4] Kurt Mehlhorn,et al. Faster algorithms for the shortest path problem , 1990, JACM.
[5] Minlan Yu,et al. Tradeoffs in CDN designs for throughput oriented traffic , 2012, CoNEXT '12.
[6] Suk-Hun Yoon,et al. Minimizing the Total Stretch in Flow Shop Scheduling , 2014 .
[7] Yuval Shavitt,et al. Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[8] Arun Venkataramani,et al. Bandwidth constrained placement in a WAN , 2001, PODC '01.
[9] Joonkyum Lee,et al. Assortment Optimization under Consumer Choice Behavior in Online Retailing , 2014 .
[10] Nikolaos Laoutaris,et al. Joint object placement and node dimensioning for Internet content distribution , 2004, Inf. Process. Lett..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Jianliang Xu,et al. Placement problems for transparent data replication proxy services , 2002, IEEE J. Sel. Areas Commun..
[13] Jussi Kangasharju,et al. Object replication strategies in content distribution networks , 2002, Comput. Commun..
[14] Chun Tung Chou,et al. Provisioning content distribution networks over shared infrastructure , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..