Information-Centric Networking (ICN) has recently gained momentum as a promising paradigm for the next- generation Internet architecture. The first prototypes for ICN- capable routers have already been developed, and network operators will soon have the opportunity to experience the advantages introduced by this technology. However, to migrate the devices to this novel architecture, non-negligible investments should be made. Therefore, it is of utter importance to provide clear quantitative insights of the expected economic benefits that operators will experience by switching to the ICN paradigm. For these reasons, in this paper we tackle the content-aware network-planning problem, and we formulate a novel optimization model to study the migration to an ICN, in a budget-constrained scenario. Our formulation takes into accurate account 1) traffic routing and 2) content caching. We further complement our contribution by designing a Randomized Rounding heuristic that scales up to realistic topologies composed of hundreds of nodes.

Content-Aware Planning Models for Information-Centric Networking

MANGILI, MICHELE;CAPONE, ANTONIO;MALUCELLI, FEDERICO
2014-01-01

Abstract

Information-Centric Networking (ICN) has recently gained momentum as a promising paradigm for the next- generation Internet architecture. The first prototypes for ICN- capable routers have already been developed, and network operators will soon have the opportunity to experience the advantages introduced by this technology. However, to migrate the devices to this novel architecture, non-negligible investments should be made. Therefore, it is of utter importance to provide clear quantitative insights of the expected economic benefits that operators will experience by switching to the ICN paradigm. For these reasons, in this paper we tackle the content-aware network-planning problem, and we formulate a novel optimization model to study the migration to an ICN, in a budget-constrained scenario. Our formulation takes into accurate account 1) traffic routing and 2) content caching. We further complement our contribution by designing a Randomized Rounding heuristic that scales up to realistic topologies composed of hundreds of nodes.
2014
IEEE Globecom 2014
978-1-4799-3511-6
File in questo prodotto:
File Dimensione Formato  
Globecom14.pdf

Accesso riservato

: Pre-Print (o Pre-Refereeing)
Dimensione 370.1 kB
Formato Adobe PDF
370.1 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/881577
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 2
social impact