Cooperation policies for efficient in-network caching

Liang Wang, Suzan Bayhan, Jussi Kangasharju

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Abstract

    Caching is a key component of information-centric networking, but most of the work in the area focuses on simple en-route caching with limited cooperation between the caches. In this paper we model cache cooperation under a game theoretical framework and show how cache cooperation policy can allow the system to converge to a Pareto optimal configuration. Our work shows how cooperation impacts network caching performance and how it takes advantage of the structural properties of the underlying network.

    Original languageEnglish
    Title of host publicationProceedings of the SIGCOMM 2013 and Best Papers of the Co-Located Workshops
    Pages533-534
    Number of pages2
    Volume43
    Edition4
    DOIs
    Publication statusPublished - 2013
    MoE publication typeA4 Article in a conference publication
    EventAnnual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication - Hong Kong, China
    Duration: 12 Aug 201316 Aug 2013

    Conference

    ConferenceAnnual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication
    Abbreviated titleACM SIGCOMM
    CountryChina
    CityHong Kong
    Period12/08/201316/08/2013

    Keywords

    • cooperative caching
    • game theory
    • in-network caching

    Fingerprint Dive into the research topics of 'Cooperation policies for efficient in-network caching'. Together they form a unique fingerprint.

    Cite this