Solving a freight transport problem using facility location techniques
Operations Research
A filtering algorithm for Web caches
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Hierarchical reliable multicast: performance analysis and placement of proxies
COMM '00 Proceedings of NGC 2000 on Networked group communication
IEEE/ACM Transactions on Networking (TON)
Model-Based Decision Support Methodology with Environmental Applications
Model-Based Decision Support Methodology with Environmental Applications
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
The measured access characteristics of world-wide-web client proxy caches
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
| Hi-index | 0.01 |
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 multicriteria 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.