Cooperative Cashing? An Economic Analysis of Document Duplication in Cooperative Web Caching

Abstract

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. KeywordsWeb caching, cooperative caching, duplication in caching, analytical modeling, incentive-centered design, game theory Disciplines Experimental Analysis of Behavior | Other EconomicsThis journal article is available at ScholarlyCommons: http://repository.upenn.edu/oid_papers/220Electronic copy available at: http://ssrn.com/abstract=926927 Cooperative Cashing?: An Economic Analysis of Document Duplication in Cooperative Web Caching AbstractCooperative 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 non-strategic settings. We have three primary findings. First, we find that the optimum level of duplication at a cache is non-decreasing in inter-cache 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 cha...

Electric Vehicle Virtual Power Plant Dilemma: Grid Balancing Versus Customer Mobility

“…But in addition, time is crucial for our mixed rental‐trading strategy, as the demand for vehicles differs over the day, for example during rush hours. Hosanagar and Tan (2012) also find that it is difficult to manage this shared cache centrally, because some users of the centrally managed cache system benefit more than others from the optimal policy. To address fairness considerations, we use auction markets to allocate the EVs to their four respective states according to the states valuations.…”

Intra-AS cooperative caching for content-centric networks

“…The accepted redundancy level reflects the trade-o↵ between the system goal of reducing cross-tra c by maximizing the diversity of cached items and the performance goal of minimizing the access latency. Acquiring the optimal degree of duplications itself is a challenging problem [8]. Moreover, previous studies on cooperative caching [4,7] reveal that this problem is tied with the network topology and needs to be handled jointly with request routing, rendering the proposed solutions often non-scalable.…”