Allocating objects in a network of caches: centralized and decentralized analyses

Management Science

Volumn 55, Issue 1, 2009, Pages 132-147

  Tawarmalani, Mohit ^a   Kannan, Karthik ^a   De, Prabuddha ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Collaborative cache management; Game theory; Mathematical programming; Peer to peer network; Resource sharing

Indexed keywords

AUCTION MECHANISMS; CACHE NETWORKS; COLLABORATIVE CACHE MANAGEMENT; COOPERATIVE CACHE; COST STRUCTURE; EFFICIENT IMPLEMENTATION; FINITE NUMBER; MANAGEMENT POLICY; OBJECT ALLOCATION; PEER-TO-PEER NETWORK; RESOURCE SHARING; SERVICE REQUESTS; SIMPLE ALGORITHM; SOCIAL WELFARE; STRATEGY SPACE; TRANSPORTATION PROBLEM;

DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL PROGRAMMING;

GAME THEORY;

EID: 67650047869     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1080.0923     Document Type: Article

References (27)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows. Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ.
2. Bertsekas, D. P., D. A. Castanon. 1989. The auction algorithm for the transportation problem. Ann. Oper. Res. 20 67-96.
3. Cao, C., S. Irani. 1997. Cost-aware WWW proxy caching algorithms. Proc. 1997 Usenix Sympos. Internet Tech. Systems, Monterey, CA, 193-206.
4. Chun, B.-G., K. Chaudhuri, H. Wee, M. Barreno, C. H. Papadimitriou, J. Kubiatowicz. 2004. Selfish caching in distributed systems: A game-theoretic analysis. Proc. 23rd Annual ACM Sympos. Principles of Distributed Comput., St. John's, Newfoundland, Canada, 21-30.
5. Dantzig, G. B. 1963. Linear Programming and Extensions. Princeton University Press, Princeton, NJ.
6. Datta, A., K. Dutta, H. Thomas, D. VanderMeer. 2003. World wide wait: A study of Internet scalability and cache-based approaches to alleviate it. Management Sci. 49 (10) 1425-1444.
7. Day R. 2004. Expressing preferebces with price-vector agents in combinatorial auctions. Unpublished doctoral dissertation, University of Maryland, College Park.
8. Demange, G., D. Gale, M. Sotormayor. 1986. Multi-item auctions. J. Political Econom. 94 863-872.
9. Dilley J., B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, B. Weihl. 2002. Globally distributed content delivery. IEEE Internet Comput. 6 50-58.
10. Fudenberg, D., J. Tirole. 1991. Game Theory. MIT Press, Boston.
11. Geng, X., R. Gopal, R. Ramesh, A. Whinston. 2003. Trading capacities: Capacity provision networks. IT Professional 5 30-36.
12. Glover, F., E. Woolsey 1974. Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res. 22 (1) 180-182.
13. Hosanagar, K., Y. Tan. 2004. Optimal duplication in cooperative Web caching. Proc. 14th Annual Workshop on Inform. Tech. Systems, Washington, D. C., 92-97.
14. Hosanagar, K., R. Krishnan, J. Chuang, V. Choudhary 2005. Pricing and resource allocation in caching networks with multiple levels of quality of service. Management Sci. 51 (12) 1844-1859.
15. ILOG. 2007. CPLEX 11.0 User's Manual. ILOG Inc., Mountain View, CA.
16. Kelso, A. S., V. P. Crawford. 1982. Job matching, coalition formation and gross substitutes. Econometrica 50 1483-1504.
17. McLennan, A., R. Tourky 2008. Simple complexity from imitation games. Games Econom. Behav. Forthcoming.
18. Milgrom, P. 2000. Putting auction theory to work: The simultaneous ascending auction. J. Political Econom. 108 246-272.
19. Mookerjee, V. S., Y. Tan. 2002. Analysis of a least recently used cache management policy for Web browsers. Oper. Res. 50 (2) 345-357.
20. Podlipnig, S., L. Böszörmenyi. 2003. Survey of Web cache replacement strategies. ACM Comput. Surveys 35 374-398.
21. Ramaswamy L., L. Liu. 2004. An expiration age-based document placement scheme for cooperative Web caching. IEEE Trans. Knowledge Data Engrg. 16 585-600.
22. Tawarmalani, M., N. V. Sahinidis. 2002. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands.
23. Topkis, D. M. 1998. Supermodularity and Complementarity. Princeton University Press, Princeton, NJ.
24. Valloppillil, V., K. W Ross. 1998. Cache array routing Protocol v 1.0 Internet draft. http://www.globcom.net/ietf/draft/draftvinod-carp-v1-03.html.
25. Wang, J. 1999. A survey of Web caching schemes for the Internet. ACM Comput. Comm. Rev. 29 36-46.
26. Wessels, D., K. Claffy 1998. ICP and squid Web cache. IEEE J. Selected Areas Comm. 16 345-357.
27. Young, N. 1994. The k server dual and loose competitiveness for paging. Algorithmica 11 525-41.