Hash-routing schemes for information centric networking

  • Authors:
  • Lorenzo Saino;Ioannis Psaras;George Pavlou

  • Affiliations:
  • University College London, London, United Kingdom;University College London, London, United Kingdom;University College London, London, United Kingdom

  • Venue:
  • Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hash-routing has been proposed in the past as a mapping mechanism between object requests and cache clusters within enterprise networks. In this paper, we revisit hash-routing techniques and apply them to Information-Centric Networking (ICN) environments, where network routers have cache space readily available. In particular, we investigate whether hash-routing is a viable and efficient caching approach when applied outside enterprise networks, but within the boundaries of a domain. We design five different hash-routing schemes which efficiently exploit in-network caches without requiring network routers to maintain per-content state information. We evaluate the proposed hash-routing schemes using extensive simulations over real Internet domain topologies and compare them against various on-path caching mechanisms. We show that such schemes can increase cache hits by up to 31% in comparison to on-path caching, with minimal impact on the traffic dynamics of intra-domain links.