Research Article
Cooperative Data Placement and Replication in Edge Cache Networks
@INPROCEEDINGS{10.1109/COLCOM.2006.361850, author={Lakshmish Ramaswamy and Arun lyengar and Jianxia Chen}, title={Cooperative Data Placement and Replication in Edge Cache Networks}, proceedings={2nd International ICST Conference on Collaborative Computing: Networking, Applications and Worksharing}, publisher={IEEE}, proceedings_a={COLLABORATECOM}, year={2007}, month={5}, keywords={Collaboration Computer networks Computer science Content management Cooperative caching Document handling Resource management Scalability Web pages Web sites}, doi={10.1109/COLCOM.2006.361850} }- Lakshmish Ramaswamy
Arun lyengar
Jianxia Chen
Year: 2007
Cooperative Data Placement and Replication in Edge Cache Networks
COLLABORATECOM
IEEE
DOI: 10.1109/COLCOM.2006.361850
Abstract
Cooperation among individual caches 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 quantifies the usefulness of storing a data-item at a particular edge cache. Experiments show that the proposed scheme provides significant performance benefits.