The auction algorithm for the transportation problem
Annals of Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
Globally Distributed Content Delivery
IEEE Internet Computing
Convexification and Global Optimization in Continuous And
Convexification and Global Optimization in Continuous And
Analysis of a Least Recently Used Cache Management Policy for Web Browsers
Operations Research
Trading Caches: Capacity Provision Networks
IT Professional
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
An Expiration Age-Based Document Placement Scheme for Cooperative Web Caching
IEEE Transactions on Knowledge and Data Engineering
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
IEEE Journal on Selected Areas in Communications
Storage optimization for a peer-to-peer video-on-demand network
MMSys '10 Proceedings of the first annual ACM SIGMM conference on Multimedia systems
Scholastic streaming: rethinking mobile video-on-demand in a campus environment
Proceedings of the 3rd workshop on Mobile video delivery
Design science and the accumulation of knowledge in the information systems discipline
ACM Transactions on Management Information Systems (TMIS)
Cooperative Cashing? An Economic Analysis of Document Duplication in Cooperative Web Caching
Information Systems Research
| Hi-index | 0.01 |
We analyze the allocation of objects in a network of caches that collaborate to service requests from customers. A thorough analysis of this problem in centralized and decentralized setups, both of which occur in practice, is essential for understanding the benefits of collaboration. A key insight offered by this paper is that an efficient implementation of cooperative cache management is possible because, in the centralized scenario, the object allocation resulting in the best social welfare can be found easily as a solution to a transportation problem. For the decentralized scenario involving selfish caches, it is shown that pure equilibria exist and that the cache network always reaches a pure equilibrium in a finite number of steps, starting from any point in the strategy space. An auction mechanism is developed to derive prices that motivate the caches to hold objects in a manner such that the optimal social welfare is attained. In the special case of symmetric caches, simple algorithms are devised to find the optimal social welfare allocation, the best pure equilibrium, and the prices for sharing objects. The results obtained in this paper should be valuable in developing and evaluating cache-management policies. Resource-sharing problems with a similar cost structure exist in a variety of other domains, and the insights gained here are expected to extend to those scenarios as well.