nformation Centric Networking (ICN) is a novel paradigm that aims at improving the performance of today's Internet by providing universal caching and multicast content delivery. In this paper we propose a strategy to stimulate third parties to jointly lease the unused bandwidth and storage available on wireless access points in an ICN. We formulate this problem as a combinatorial reverse auction run by a content provider willing to increase the number of users reached by his service. We first show that the optimal allocation algorithm is NP-hard, we then provide greedy heuristics that guarantee the individual rationality and truthfulness properties and we compare their performance numerically. Finally, we evaluate the benefits of our proposed mechanisms in terms of the computational time necessary to execute the allocation algorithms, as well as the cost savings for the content provider obtained by offloading the backhaul connections using the distributed caches to directly serve users' requests. The novelty of our approach is to simultaneously take into account in the mechanism design the bandwidth as well as the storage available at the access network, and to study their mutual interaction.

Efficient Joint Bandwidth and Cache Leasing in Information Centric Networks

CAPONE, ANTONIO
2013-01-01

Abstract

nformation Centric Networking (ICN) is a novel paradigm that aims at improving the performance of today's Internet by providing universal caching and multicast content delivery. In this paper we propose a strategy to stimulate third parties to jointly lease the unused bandwidth and storage available on wireless access points in an ICN. We formulate this problem as a combinatorial reverse auction run by a content provider willing to increase the number of users reached by his service. We first show that the optimal allocation algorithm is NP-hard, we then provide greedy heuristics that guarantee the individual rationality and truthfulness properties and we compare their performance numerically. Finally, we evaluate the benefits of our proposed mechanisms in terms of the computational time necessary to execute the allocation algorithms, as well as the cost savings for the content provider obtained by offloading the backhaul connections using the distributed caches to directly serve users' requests. The novelty of our approach is to simultaneously take into account in the mechanism design the bandwidth as well as the storage available at the access network, and to study their mutual interaction.
2013
IEEE Globecom 2013
978-1-4799-1353-4
File in questo prodotto:
File Dimensione Formato  
1569741391.pdf

Accesso riservato

: Altro materiale allegato
Dimensione 268.18 kB
Formato Adobe PDF
268.18 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/739775
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact