Cooperative data placement and replication in edge cache networks

Abstract

Cooperation among individual eaches has proven to be an effective strategy to improve the scalability and performance of edge cache networks delivering dynamic web content. To date, research in the area of cooperative edge caching has mainly focused on serving client requests and maintaining freshness of cached documents. However, designing mechanisms to effectively manage the available resources is an important challenge that can have significant impact on the performance of an edge cache network. In this paper we propose a novel data placement scheme, called the utility-based placement scheme, which is not only sensitive to the ongoing cooperation in the edge cache but also takes into account the various costs and benefits of storing a data-item at an individual edge cache. At the heart of proposed scheme is a utility function that quantities the usefulness of storing a data-item at a particular edge cache. Experiments show that the proposed scheme provides significant performance benefits. © 2006 IEEE.