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

Tyson, Gareth and Kaune, Sebastian and Miles, Simon and El-khatib, Yehia and Mauthe, Andreas and Taweel, Adel (2012) A trace-driven analysis of caching in content-centric networks. In: Computer Communications and Networks (ICCCN), 2012 21st International Conference on. IEEE, DEU, pp. 1-7. ISBN 9781467315432

[thumbnail of ccn-caching]
PDF (ccn-caching)
ccn_caching.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (182kB)


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.

Item Type:
Contribution in Book/Report/Proceedings
Additional Information:
©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.
ID Code:
Deposited By:
Deposited On:
18 Feb 2013 09:17
Last Modified:
18 Oct 2023 00:13