Designing cost-effective content distribution networks

Computers and Operations Research

Volumn 34, Issue 8, 2007, Pages 2436-2449

  Bektas, Tolga ^a   Oguz, Osman ^a   Ouveysi, Iradj ^b  

^a BILKENT UNIVERSITY   (Turkey)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Benders' decomposition; Content distribution network; Exact solution; Integer programming

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEARIZATION; PROBLEM SOLVING; SERVERS; TRACKING (POSITION);

BENDERS' DECOMPOSITION; HEURISTIC ALGORITHMS; NONLINEAR INTEGER PROGRAMMING; PROXY SERVERS;

COMPUTER NETWORKS;

EID: 33846037778     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.09.013     Document Type: Article

References (47)

1. Saroiu S, Gummadi KP, Dunn RJ, Gribble SD, Levy HM. An analysis of Internet content delivery systems. In: Proceedings of 5th symposium on operating systems design and implementation (OSDI), Boston, MA; December 2002.
2. Verma D.C. Content distribution networks: an engineering approach. 1st ed. (2001), Wiley, New York
3. The economic impacts of unacceptable web-site download speeds. Technical Report, Zona Research, April 1999. Available at [accessed 24.06.2004].
4. The need for Speed II. Zona Market Bulletin, Zona Research, April 2001. Available at [accessed 24.06.2004].
5. Datta A., Dutta K., Thomas H., and VanderMeer D. World Wide Wait: a study of Internet scalability and cache-based approaches to alleviate it. Management Science 49 10 (2003) 1425-1444
6. Kangasharju J. Internet content distribution. PhD thesis, L'Universite de Nice -Sophia Antipolis; April 2002.
7. Datta A, Dutta K, Thomas H, VanderMeer D. World Wide Wait: a study of Internet scalability and cache-based approaches to alleviate it. Management science electronic companion pages. 2003 [available at ].
8. Akamai
9. Speedera
10. Digital Island
11. Mirror Image
12. Vakali A., and Pallis G. Content delivery networks: status and trends. IEEE Internet Computing 7 6 (2003) 68-74
13. Inktomi
14. Li B, Golin MJ, Italiano GF, Deng X, Sohraby K. On the optimal placement of web proxies in the Internet. In: Proceedings of IEEE INFOCOM'99, vol. 3, New York, March 1999. p. 1282-90.
15. Qiu L, Padmanabhan VN, Voelker GM. On the placement of web server replicas. In: Proceedings of IEEE INFOCOM'01, vol. 3, AK, USA: Anchorage; April 2001. p. 1587-96.
16. Woeginger G.J. Monge strikes again: optimal placement of web proxies in the internet. Operations Research Letters 27 3 (2000) 93-96
17. Cidon I., Kutten S., and Soffer R. Optimal allocation of electronic content. Computer Networks 40 2 (2002) 205-218
18. Kangasharju J., Roberts J., and Ross K.W. Object replication strategies in content distribution networks. Computer Communications 25 4 (2002) 376-383
19. Yang M., and Fei Z. A model for replica placement in content distribution networks for multimedia applications. In: Proceedings of IEEE international conference on communications (ICC'03) vol. 1 (2003) 557-561
20. Fisher M.L., and Hochbaum D.S. Database location in computer networks. Journal of the Association for Computing Machinery 27 4 (1980) 718-735
21. Pirkul H. An integer programming model for the allocation of databases in a distributed computer system. European Journal of Operational Research 26 (1986) 401-411
22. Gavish G. Optimization models for configuring distributed computer systems. IEEE Transactions on Computers C-36 7 (1987) 773-793
23. Gavish B., and Suh M.W. Configuration of fully replicated distributed database system over wide area networks. Annals of Operations Research 36 (1992) 167-192
24. Chari K. Resource allocation and capacity assignment in distributed systems. Computers and Operations Research 23 11 (1996) 1025-1041
25. Hakimi S.L., and Schmeichel E.F. Locating replicas of a database on a network. Networks 30 1 (1997) 31-36
26. Ryoo J., and Panwar S.S. File distribution in networks with multimedia storage servers. Networks 38 3 (2001) 140-149
27. Xu J., Li B., and Lee D.L. Placement problems for transparent data replication proxy services. IEEE Journal on Selected Areas in Communications 20 7 (2002) 1383-1398
28. Xuanping Z., Weidong W., Xiaopeng T., and Yonghu Z. Data replication at web proxies in content distribution network. Lecture notes in computer science vol. 2642 (2003), Springer, Berlin 560-569
29. Laoutaris N., Zissimopoulos V., and Stavrakakis I. Joint object placement and node dimensioning for Internet content distribution. Information Processing Letters 89 6 (2004) 273-279
30. Laoutaris N., Zissimopoulos V., and Stavrakakis I. On the optimization of storage capacity allocation for content distribution. Computer Networks 47 3 (2005) 409-428
31. Nguyen T, Chou CT, Boustead P. Resource optimization for content distribution networks in shared infrastructure environment, In: Proceedings of the Australian telecommunications networks applications conference (ATNAC 2003), 2003. Available at .
32. Almeida J.M., Eager D.L., Vernon M.K., and Wright S.J. Minimizing delivery cost in scalable streaming content distribution systems. IEEE Transactions on Multimedia 6 2 (2004) 356-365
33. Backx P., Lambrecht T., Dhoedt B., DeTurck F., and Demeester P. Optimizing content distribution through adaptive distributed caching. Computer Communications 28 6 (2005) 640-653
34. Kangasharju J., Ross K.W., and Roberts J. Performance evaluation of redirection schemes in content distribution networks. Computer Communications 24 2 (2001) 207-214
35. Venkataramani A., Yalagandula P., Kokku R., Sharif S., and Dahlin M. The potential costs and benefits of long-term prefetching for content distribution. Computer Communications 25 4 (2002) 367-375
36. Krishnan P., Raz D., and Shavitt Y. The cache location problem. IEEE/ACM Transactions on Networking 8 5 (2000) 568-582
37. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman and Company, San Franciso, CA
38. Cornuejols G., Nemhauser G.L., and Wolsey L.A. The uncapacitated facility location problem. In: Mirchandani P.B., and Francis R.L. (Eds). Discrete location theory (1990), Wiley, New York 119-171 [chapter 3]
39. Gao L.-L., and Robinson Jr. E.P. A dual-based optimization procedure for the two-echelon uncapacitated facility location problem. Naval Research Logistics 39 (1992) 191-212
40. Klincewicz J.G., and Luss H. A dual-based algorithm for multiproduct uncapacitated facility location. Transportation Science 21 (1987) 198-206
41. Padberg M. The Boolean quadric polytope: some characteristics, facets, and relatives. Mathematical Programming 45 1 (1989) 139-172
42. Plastria F. Formulating logical implications in combinatorial optimisation. European Journal of Operational Research 140 2 (2002) 338-353
43. Breslau L, Cao P, Fan L, Phillips G, Shenker S. Web caching and Zipf-like distributions: evidence and implications. In: Proceedings of IEEE INFOCOM'99, vol. 1, New York; March 1999. p. 126-34.
44. Adams W.P., and Sherali H.D. A tight linearization and an algorithm for zero-one quadratic programming problems. Management Science 32 10 (1986) 1274-1290
45. Benders J.F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4 (1962) 238-252
46. Wolsey L.A. Integer programming (1998), Wiley, New York
47. McDaniel D., and Devine M. A modified Benders' partitioning algorithm for mixed integer programming. Management Science 24 3 (1977) 312-319