Internet Cache Location and Design of Content Delivery Networks
The paper studies the problem of where to locate caches in a network of a general topology with many servers. The problem is formulated using mixed integer programming (MILP). The goal is to develop new models for cache location that overcome the limitations of the basic model. A secondary goal is to evaluate the practical complexity of using MILP for cache location and to improve existing heuristics using the new model formulations.
The basic CLP model is studied as a multi-criteria problem to address the possibility that some servers or clients may be discriminated. The basic model is modified to allow searching for efficient solutions according to user preferences, for example for fair solutions. Using multi-criteria methods, the CLP can be extended to determine the optimal number of caches or to minimize average delay and bandwidth consumption. The paper studies modifications of the CLP that account for the effect of client assignment and cache size on cache hit rate.
Medium-sized topologies of the order of 100 nodes can be solved optimally using modern MILP solvers. The model modifications can be used to improve heuristics for larger networks.
KeywordsAverage Delay Cache Size Order Weight Average Bandwidth Consumption Cache Location
Unable to display preview. Download preview PDF.
- 1.M. S. Daskin. Network and Discrete Location. John Wiley, 1995.Google Scholar
- 2.J. Jannotti et. al. Overcast: Reliable multicasting with an overlay network. Proceedings OSDI’01, 2000.Google Scholar
- 3.Kimberly Claffy et al. Visualizing internet topology at a macroscopic scale. World Wide Web page, http://www.caida.org/analysis/topology/as_core_network, CAIDA, 2002.
- 4.J. Klincewicz. Solving a freight transport problem using facility location techniques. Operations Research, January-February 1990.Google Scholar
- 5.G. Voelker L. Qiu, V. Padmanabhan. On the placement of web server replicas. Proceedings of IEEE Infocom, 2001.Google Scholar
- 6.A. Markopoulou. Hierarchical reliable mutlicast: performance analysis and placement of proxies. Proceedings of NGC 2000, 2000.Google Scholar
- 7.A. P. Wierzbicki, M. Makowski, J. Wessels, editor. Model-Based Decision Support Methodology with Environmental Applications. Kluwer Academic Publishers, 2000.Google Scholar
- 8.B. Duska, D. Marwood, M. Feeley. Measured access characteristics of worl-wide-web client proxy caches. Proceedings of the USENIX Symposium on Internet Technologies and Systems, 1997.Google Scholar
- 9.E. Zegura, K. Calvert, S. Bhattacharjee. How to model an internetwork. In Proc. IEEE Infocom, pages 40–52, 1996.Google Scholar
- 10.Michal Kurcewicz, Adam Wierzbicki, Wojtek Sylwestrzak. Filtering algorithms for proxy caches. Computer Networks and ISDN Systems, 1998.Google Scholar
- 11.W. Ogryczak, M. Zawadzki. Conditional center: A parametric solution concept for location problems. Technical report, Institute of Control and Computation Engineering, Warsaw University of Technology, 2000.Google Scholar
- 12.W. Ogryczak, T. Sliwinski. On solving linear programs with the ordered weighted averaging objective. Technical report, Institute of Control and Computation Engineering, Warsaw University of Technology, 2001.Google Scholar
- 13.W. Ogryczak. On the lexicographic minimax approach to location problems. European Journal of Operational Research, 1996.Google Scholar
- 14.W. Ogryczak. Inequality measures and equitable approaches to location problems. European Journal of Operational Research, 1999.Google Scholar
- 15.Y. Shavitt P. Krishnan. D. Raz. The cache location problem. IEEE/ACM Transactions on Networking, October 2000.Google Scholar
- 16.D. Estrin P. Radoslavov, R. Govindan. Topology-informed internet replica placement. Proc. of the. Sixth International Workshop on Web Caching and Content Distribution, 2000.Google Scholar