Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses

References

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