Home > Research > Publications & Outputs > A trace-driven analysis of caching in content-c...

Electronic data

  • ccn-caching

    Rights statement: ©2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 179 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

A trace-driven analysis of caching in content-centric networks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Close
Publication date07/2012
Host publicationComputer Communications and Networks (ICCCN), 2012 21st International Conference on
PublisherIEEE
Pages1-7
Number of pages7
ISBN (print)9781467315432
<mark>Original language</mark>English
Event21st International Conference on Computer Communication Networks (ICCCN) - Munich, Germany
Duration: 30/07/20122/08/2012

Conference

Conference21st International Conference on Computer Communication Networks (ICCCN)
Country/TerritoryGermany
CityMunich
Period30/07/122/08/12

Conference

Conference21st International Conference on Computer Communication Networks (ICCCN)
Country/TerritoryGermany
CityMunich
Period30/07/122/08/12

Abstract

A content-centric network is one which supports host-to-content routing, rather than the host-to-host routing of the existing Internet. This paper investigates the potential of caching data at the router-level in content-centric networks. To achieve this, two measurement sets are combined to gain an understanding of the potential caching benefits of deploying content-centric protocols over the current Internet topology. The first set of measurements is a study of the BitTorrent network, which provides detailed traces of content request patterns. This is then combined with CAIDA’s ITDK Internet traces to replay the content requests over a real-world topology. Using this data, simulations are performed to measure how effective content-centric networking would have been if it were available to these consumers/providers. We find that larger cache sizes (10,000 packets) can create significant reductions in packet path lengths. On average, 2.02 hops are saved through caching (a 20% reduction), whilst also allowing 11% of data requests to be maintained within the requester’s AS. Importantly, we also show that these benefits extend significantly beyond that of edge caching by allowing transit ASes to also reduce traffic.

Bibliographic note

©2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.