A minimum cost cache management framework for information-centric networks with network coding

In recent years, the increasing demand for media-rich content has driven many efforts to redesign the Internet architecture. As one of the main candidates, information-centric network(ICN) has attracted significant attention, where in-network cache is a key component in different ICN architectures....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer networks (Amsterdam, Netherlands : 1999) Jg. 110; S. 1 - 17
Hauptverfasser: Wang, Jin, Ren, Jing, Lu, Kejie, Wang, Jianping, Liu, Shucheng, Westphal, Cedric
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 09.12.2016
Elsevier Sequoia S.A
Schlagworte:
ISSN:1389-1286, 1872-7069
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In recent years, the increasing demand for media-rich content has driven many efforts to redesign the Internet architecture. As one of the main candidates, information-centric network(ICN) has attracted significant attention, where in-network cache is a key component in different ICN architectures. In this paper, we propose a novel framework for optimal cache management in ICNs that jointly considers caching strategy and content routing. Specifically, our framework is based on software-defined networking (SDN) where a controller is responsible for determining the optimal caching strategy and content routing via linear network coding (LNC). For the proposed cache management framework, we first formulate an optimization problem to minimize the network bandwidth cost and cache cost by jointly considering caching strategy and content routing with LNC. We then develop an efficient network coding based cache management (NCCM) algorithm to obtain a near-optimal caching and routing solution for ICNs. We further derive the upper and lower bounds of the problem and conduct extensive experiments to compare the performance of the NCCM algorithm with these bounds. Simulation results validate the effectiveness of the NCCM algorithm and the framework.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2016.08.004