Lowest-cost network node identification for data caching for information centric networks

Zhengqi Jiang, Di Wu, Roberto Rojas-Cessa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We present the lowest-path cost to destination scheme for identification of the most suitable node for data caching. The scheme identifies the network node that yields the lowest-cost path for delivering data to demanding users. This scheme is applied to information centric networks (ICN) that consider two different data consumption modes: frequently and sporadically. We consider the use of Software-Defined Networking (SDN) to realize the distribution of data on identified network nodes and enable routing towards ICN caching nodes. We apply two different methods to evaluate the path costs: Dijkstra algorithm and Integer Linear Programming (ILP). Our results show that both adopted schemes provide similar results, converging into the identification of the same ICN caching nodes. We provide example of different scenarios and resulting costs. We also apply the proposed scheme to identify a stand-by node in case the most economical nodes fails, using the proposed scheme. We show that there is a trade-off between the extent of demand and the location of routers in the network.

Original languageEnglish (US)
Title of host publication37th IEEE Sarnoff Symposium, Sarnoff 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages193-198
Number of pages6
ISBN (Electronic)9781509015405
DOIs
StatePublished - Feb 7 2017
Event37th IEEE Sarnoff Symposium, Sarnoff 2016 - Newark, United States
Duration: Sep 19 2016Sep 21 2016

Publication series

Name37th IEEE Sarnoff Symposium, Sarnoff 2016

Other

Other37th IEEE Sarnoff Symposium, Sarnoff 2016
CountryUnited States
CityNewark
Period9/19/169/21/16

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture

Keywords

  • Cached data
  • Data replication
  • Information centric networks
  • Integer linear programming
  • Lowest-cost path
  • Shortest-path routing

Fingerprint Dive into the research topics of 'Lowest-cost network node identification for data caching for information centric networks'. Together they form a unique fingerprint.

Cite this