Information-centric networking (ICN) is a novel paradigm that aims at improving the performance of today's Internet by supporting caching and multicast content delivery on every network device. The main contribution of this paper is to propose a centralized strategy to stimulate third parties to jointly lease the unused bandwidth and storage available on wireless access points (APs) in an ICN. We formulate this problem as a combinatorial reverse auction run by a content provider (CP) willing to increase the number of users reached by its service. We show that the optimal allocation with partial coverage problem is NP-hard, provide greedy heuristics that guarantee the individual rationality and truthfulness properties, and compare their performance numerically. We evaluate the benefits of our proposed mechanisms in terms of the cost savings for the CP obtained by offloading its infrastructure through the caches and the reduced computational time to execute the allocation algorithms. We compare the results obtained in this centralized setting with those that can be observed when the mobile clients autonomously choose which AP they prefer to use, among those activated by the auction mechanism. We model this second scenario as a congestion game, showing that it exhibits the desired properties (i.e., existence and uniqueness of a Nash equilibrium) and by comparing its social welfare with the centralized case.
(2017). Bandwidth and Cache Leasing in Wireless Information-Centric Networks: A Game-Theoretic Study [journal article - articolo]. In IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY. Retrieved from http://hdl.handle.net/10446/106064
Bandwidth and Cache Leasing in Wireless Information-Centric Networks: A Game-Theoretic Study
MANGILI, MICHELE;MARTIGNON, Fabio;PARIS, STEFANO;
2017-01-01
Abstract
Information-centric networking (ICN) is a novel paradigm that aims at improving the performance of today's Internet by supporting caching and multicast content delivery on every network device. The main contribution of this paper is to propose a centralized strategy to stimulate third parties to jointly lease the unused bandwidth and storage available on wireless access points (APs) in an ICN. We formulate this problem as a combinatorial reverse auction run by a content provider (CP) willing to increase the number of users reached by its service. We show that the optimal allocation with partial coverage problem is NP-hard, provide greedy heuristics that guarantee the individual rationality and truthfulness properties, and compare their performance numerically. We evaluate the benefits of our proposed mechanisms in terms of the cost savings for the CP obtained by offloading its infrastructure through the caches and the reduced computational time to execute the allocation algorithms. We compare the results obtained in this centralized setting with those that can be observed when the mobile clients autonomously choose which AP they prefer to use, among those activated by the auction mechanism. We model this second scenario as a congestion game, showing that it exhibits the desired properties (i.e., existence and uniqueness of a Nash equilibrium) and by comparing its social welfare with the centralized case.File | Dimensione del file | Formato | |
---|---|---|---|
TVT_ICN_2016.pdf
accesso aperto
Descrizione: “© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.”
Versione:
postprint - versione referata/accettata senza referaggio
Licenza:
Licenza default Aisberg
Dimensione del file
980.27 kB
Formato
Adobe PDF
|
980.27 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo