Less pain, most of the gain: incrementally deployable ICN

  • Authors:

  • Seyed Kaveh Fayazbakhsh;Yin Lin;Amin Tootoonchian;Ali Ghodsi;Teemu Koponen;Bruce Maggs;K.C. Ng;Vyas Sekar;Scott Shenker

  • Affiliations:

  • Stony Brook University, Stony Brook, USA;Duke University, Durham, USA;University of Toronto, Toronto, Canada;UC Berkeley, Berkeley, USA;VMware, San Francisco, USA;Duke University, Durham, USA;Akamai, Cambridge, USA;Stony Brook University, Stony Brook, USA;UC Berkeley, Berkeley, USA

  • Venue:
  • Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Information-Centric Networking (ICN) has seen a significant resurgence in recent years. ICN promises benefits to users and service providers along several dimensions (e.g., performance, security, and mobility). These benefits, however, come at a non-trivial cost as many ICN proposals envision adding significant complexity to the network by having routers serve as content caches and support nearest-replica routing. This paper is driven by the simple question of whether this additional complexity is justified and if we can achieve these benefits in an incrementally deployable fashion. To this end, we use trace-driven simulations to analyze the quantitative benefits attributed to ICN (e.g., lower latency and congestion). Somewhat surprisingly, we find that pervasive caching and nearest-replica routing are not fundamentally necessary---most of the performance benefits can be achieved with simpler caching architectures. We also discuss how the qualitative benefits of ICN (e.g., security, mobility) can be achieved without any changes to the network. Building on these insights, we present a proof-of-concept design of an incrementally deployable ICN architecture.