Exact algorithms for the joint object placement and request routing problem in content distribution networks

This paper describes two exact algorithms for the joint problem of object placement and request routing in a content distribution network (CDN). A CDN is a technology used to efficiently distribute electronic content throughout an existing Internet Protocol network. The problem consists of replicating content on the proxy servers and routing the requests for the content to a suitable proxy server in a CDN such that the total cost of distribution is minimized. An upper bound on end-to-end object transfer time is also taken into account. The problem is formulated as a nonlinear integer programming formulation which is linearized in three different ways. Two algorithms, one based on Benders decomposition and the other based on Lagrangean relaxation and decomposition, are described for the solution of the problem. Computational experiments are conducted by comparing the proposed linearizations and the two algorithms on randomly generated Internet topologies.

[1]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

[2]  Paul Wentges,et al.  Accelerating Benders' decomposition for the capacitated facility location problem , 1996, Math. Methods Oper. Res..

[3]  Shay Kutten,et al.  Optimal allocation of electronic content , 2002, Comput. Networks.

[4]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[5]  M. D. Devine,et al.  A Modified Benders' Partitioning Algorithm for Mixed Integer Programming , 1977 .

[6]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[7]  Iradj Ouveysi,et al.  Designing cost-effective content distribution networks , 2007, Comput. Oper. Res..

[8]  Gerhard J. Woeginger,et al.  Monge strikes again: optimal placement of web proxies in the internet , 2000, Oper. Res. Lett..

[9]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[10]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[11]  Bezalel Gavish,et al.  Optimization Models for Configuring Distributed Computer Systems , 1987, IEEE Transactions on Computers.

[12]  Arun Venkataramani,et al.  The potential costs and benefits of long-term prefetching for content distribution , 2002, Comput. Commun..

[13]  Frank Plastria,et al.  Formulating logical implications in combinatorial optimisation , 2002, Eur. J. Oper. Res..

[14]  Shivendra S. Panwar,et al.  File distribution in networks with multimedia storage servers , 2001, Networks.

[15]  Chun Tung Chou,et al.  Provisioning overlay distribution networks , 2005, Comput. Networks.

[16]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  Tarek F. Abdelzaher,et al.  Bounded-latency content distribution feasibility and evaluation , 2005, IEEE Transactions on Computers.

[18]  S. Louis Hakimi,et al.  Locating replicas of a database on a network , 1997 .

[19]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[20]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[21]  Jussi Kangasharju,et al.  Performance evaluation of redirection schemes in content distribution networks , 2001, Comput. Commun..

[22]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[23]  Zongming Fei,et al.  A model for replica placement in content distribution networks for multimedia applications , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[24]  Chin-Chen Chang,et al.  Signature schemes based on two hard problems simultaneously , 2003, 17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003..

[25]  Philip S. Yu,et al.  Replication Algorithms in a Remote Caching Architecture , 1993, IEEE Trans. Parallel Distributed Syst..

[26]  Pavlin Radoslavov,et al.  Topology-informed Internet replica placement , 2002, Comput. Commun..

[27]  Bezalel Gavish,et al.  Configuration of fully replicated distributed database system over wide area networks , 1992, Ann. Oper. Res..

[28]  George Pallis,et al.  Content Delivery Networks: Status and Trends , 2003, IEEE Internet Comput..

[29]  Jianliang Xu,et al.  QoS-aware replica placement for content distribution , 2005, IEEE Transactions on Parallel and Distributed Systems.

[30]  Anindya Datta,et al.  World Wide Wait: A Study of Internet Scalability and Cache-Based Approaches to Alleviate It , 2003, Manag. Sci..

[31]  Stephen J. Wright,et al.  Minimizing delivery cost in scalable streaming content distribution systems , 2004, IEEE Transactions on Multimedia.

[32]  Hasan Pirkul,et al.  An integer programming model for the allocation of databases in a distributed computer system , 1986 .

[33]  Weidong Wang,et al.  Data Replication at Web Proxies in Content Distribution Network , 2003, APWeb.

[34]  Leandros Tassiulas,et al.  Market-Based Resource Allocation for Content Delivery in the Internet , 2003, IEEE Trans. Computers.

[35]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[36]  F. Glover.  IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

[37]  Kirk L. Johnson,et al.  The measured performance of content distribution networks , 2001, Comput. Commun..

[38]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[39]  Nikolaos Laoutaris,et al.  Responsible Editor: J. Misic , 2004 .

[40]  Krishna P. Gummadi,et al.  An analysis of Internet content delivery systems , 2002, OPSR.

[41]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[42]  Nikolaos Laoutaris,et al.  Joint object placement and node dimensioning for Internet content distribution , 2004, Inf. Process. Lett..

[43]  Kaushal Chari,et al.  Resource allocation and capacity assignment in distributed systems , 1996, Comput. Oper. Res..

[44]  Andreas Drexl,et al.  Facility location models for distribution system design , 2005, Eur. J. Oper. Res..

[45]  Jianliang Xu,et al.  Placement problems for transparent data replication proxy services , 2002, IEEE J. Sel. Areas Commun..

[46]  Manfred W. Padberg,et al.  The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[47]  Alysson M. Costa.  A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..

[48]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[49]  Rajmohan Rajaraman,et al.  Placement Algorithms for Hierarchical Cooperative Caching , 2001, J. Algorithms.

[50]  Jean-François Cordeau,et al.  Simultaneous Assignment of Locomotives and Cars to Passenger Trains , 1998, Oper. Res..

[51]  Filip De Turck,et al.  Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm , 2022 .