- UID
- 404390
- 在线时间
- 小时
- 注册时间
- 2008-12-14
- 最后登录
- 1970-1-1
- 主题
- 帖子
- 性别
- 保密
|
看到一篇奇文,贴出来分享。
INFORMATION SYSTEMS RESEARCH,   ublished online in Articles in Advance, April 8, 2011 DOI: 10.1287/isre.1110.0347
Cooperative Cashing? An Economic Analysis of Document Duplication in Cooperative Web Caching Kartik Hosanagar, Yong Tan
Operations and Information Management, The Wharton School of the University of Pennsylvania, Philadelphia, Pennsylvania 19103 Foster School of Business, University of Washington, Seattle, Washington 98195 kartikh@wharton.upenn.edu ytan@uw.edu
Cooperative caching is a popular mechanism to allow an array of distributed caches to cooperate and serve each others' Web requests. Controlling duplication of documents across cooperating caches is a challenging problem faced by cache managers. In this paper, we study the economics of document duplication in strategic and nonstrategic settings. We have three primary findings. First, we find that the optimum level of duplication at a cache is nondecreasing in intercache latency, cache size, and extent of request locality. Second, in situations in which cache peering spans organizations, we find that the interaction between caches is a game of strategic substitutes wherein a cache employs lesser resources towards eliminating duplicate documents when the other caches employs more resources towards eliminating duplicate documents at that cache. Thus, a significant challenge will be to simultaneously induce multiple caches to contribute more resources towards reducing duplicate documents in the system. Finally, centralized decision making, which as expected provides improvements in average latency over a decentralized setup, can entail highly asymmetric duplication levels at the caches. This in turn can benefit one set of users at the expense of the other, and thus will be challenging to implement.
Key Words: Web caching; cooperative caching; duplication in caching; analytical modeling; incentive-centered design; game theory History: This paper was received on April 10, 2008. |
|