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 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). Content-Aware Planning Models for Information-Centric Networking . Retrieved from http://hdl.handle.net/10446/106072

Content-Aware Planning Models for Information-Centric Networking

Mangili, Michele;Martignon, Fabio;
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 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
Mangili, Michele; Martignon, Fabio; Capone, Antonio; Malucelli, Federico
File allegato/i alla scheda:
File Dimensione del file Formato  
Globecom2014.pdf

Solo gestori di archivio

Versione: postprint - versione referata/accettata senza referaggio
Licenza: Licenza default Aisberg
Dimensione del file 370.1 kB
Formato Adobe PDF
370.1 kB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

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