Cache management with extended interest for information-centric networking

Kazuya Sato, Takashi Kamimoto, Ryoki Shinohara, Hiroshi Shigeno

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

Abstract

In Information-centric Networking (ICN)' users can obtain contents from caches in ICN routers. However' how to use caches efficiently is one of challenges. One existing scheme to obtain caches uses a caching algorithm reducing cache overlaps among routers' and users can obtain caches by re- ferring to records that routers have about caches. However' this scheme has two problems. First' routers which forward Interests towards a cache are limited. Second' this scheme depends on information from an ISP on forwarding Inter- ests. In this paper' we propose Cache-aware routing scheme Referring Distance for contents managed by extended Inter- est for ICN (CaRD)' which enables all routers to obtain the closest content without information from an ISP. In CaRD' routers record hop counts to a server and a cache as passing information of contents. Routers compare these hop counts' and then send request packets towards the closest contents. Moreover' caches move by request packets' so a hop count to a cache of record needs updating. For that' CaRD extends request packets. We add two new fields to request pack- ets and change their operation. To confirm effectiveness of CaRD' we implement CaRD on a simulator' ndnSIM' and evaluate cache hit ratio' traffic and download time.

Original languageEnglish
Title of host publicationAdjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016
PublisherAssociation for Computing Machinery
Pages245-250
Number of pages6
Volume28-November-2016
ISBN (Electronic)9781450347594
DOIs
Publication statusPublished - 2016 Nov 28
Event13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016 - Hiroshima, Japan
Duration: 2016 Nov 282016 Dec 1

Other

Other13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016
CountryJapan
CityHiroshima
Period16/11/2816/12/1

Fingerprint

Routers
Servers
Simulators

Keywords

  • Breadcrumbs
  • Cache
  • ICN
  • NDN
  • Routing

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Sato, K., Kamimoto, T., Shinohara, R., & Shigeno, H. (2016). Cache management with extended interest for information-centric networking. In Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016 (Vol. 28-November-2016, pp. 245-250). Association for Computing Machinery. https://doi.org/10.1145/3004010.3004038

Cache management with extended interest for information-centric networking. / Sato, Kazuya; Kamimoto, Takashi; Shinohara, Ryoki; Shigeno, Hiroshi.

Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016. Vol. 28-November-2016 Association for Computing Machinery, 2016. p. 245-250.

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

Sato, K, Kamimoto, T, Shinohara, R & Shigeno, H 2016, Cache management with extended interest for information-centric networking. in Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016. vol. 28-November-2016, Association for Computing Machinery, pp. 245-250, 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016, Hiroshima, Japan, 16/11/28. https://doi.org/10.1145/3004010.3004038
Sato K, Kamimoto T, Shinohara R, Shigeno H. Cache management with extended interest for information-centric networking. In Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016. Vol. 28-November-2016. Association for Computing Machinery. 2016. p. 245-250 https://doi.org/10.1145/3004010.3004038
Sato, Kazuya ; Kamimoto, Takashi ; Shinohara, Ryoki ; Shigeno, Hiroshi. / Cache management with extended interest for information-centric networking. Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016. Vol. 28-November-2016 Association for Computing Machinery, 2016. pp. 245-250
@inproceedings{f5d7272f8e6e4f9bb6d893696d660a28,
title = "Cache management with extended interest for information-centric networking",
abstract = "In Information-centric Networking (ICN)' users can obtain contents from caches in ICN routers. However' how to use caches efficiently is one of challenges. One existing scheme to obtain caches uses a caching algorithm reducing cache overlaps among routers' and users can obtain caches by re- ferring to records that routers have about caches. However' this scheme has two problems. First' routers which forward Interests towards a cache are limited. Second' this scheme depends on information from an ISP on forwarding Inter- ests. In this paper' we propose Cache-aware routing scheme Referring Distance for contents managed by extended Inter- est for ICN (CaRD)' which enables all routers to obtain the closest content without information from an ISP. In CaRD' routers record hop counts to a server and a cache as passing information of contents. Routers compare these hop counts' and then send request packets towards the closest contents. Moreover' caches move by request packets' so a hop count to a cache of record needs updating. For that' CaRD extends request packets. We add two new fields to request pack- ets and change their operation. To confirm effectiveness of CaRD' we implement CaRD on a simulator' ndnSIM' and evaluate cache hit ratio' traffic and download time.",
keywords = "Breadcrumbs, Cache, ICN, NDN, Routing",
author = "Kazuya Sato and Takashi Kamimoto and Ryoki Shinohara and Hiroshi Shigeno",
year = "2016",
month = "11",
day = "28",
doi = "10.1145/3004010.3004038",
language = "English",
volume = "28-November-2016",
pages = "245--250",
booktitle = "Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Cache management with extended interest for information-centric networking

AU - Sato, Kazuya

AU - Kamimoto, Takashi

AU - Shinohara, Ryoki

AU - Shigeno, Hiroshi

PY - 2016/11/28

Y1 - 2016/11/28

N2 - In Information-centric Networking (ICN)' users can obtain contents from caches in ICN routers. However' how to use caches efficiently is one of challenges. One existing scheme to obtain caches uses a caching algorithm reducing cache overlaps among routers' and users can obtain caches by re- ferring to records that routers have about caches. However' this scheme has two problems. First' routers which forward Interests towards a cache are limited. Second' this scheme depends on information from an ISP on forwarding Inter- ests. In this paper' we propose Cache-aware routing scheme Referring Distance for contents managed by extended Inter- est for ICN (CaRD)' which enables all routers to obtain the closest content without information from an ISP. In CaRD' routers record hop counts to a server and a cache as passing information of contents. Routers compare these hop counts' and then send request packets towards the closest contents. Moreover' caches move by request packets' so a hop count to a cache of record needs updating. For that' CaRD extends request packets. We add two new fields to request pack- ets and change their operation. To confirm effectiveness of CaRD' we implement CaRD on a simulator' ndnSIM' and evaluate cache hit ratio' traffic and download time.

AB - In Information-centric Networking (ICN)' users can obtain contents from caches in ICN routers. However' how to use caches efficiently is one of challenges. One existing scheme to obtain caches uses a caching algorithm reducing cache overlaps among routers' and users can obtain caches by re- ferring to records that routers have about caches. However' this scheme has two problems. First' routers which forward Interests towards a cache are limited. Second' this scheme depends on information from an ISP on forwarding Inter- ests. In this paper' we propose Cache-aware routing scheme Referring Distance for contents managed by extended Inter- est for ICN (CaRD)' which enables all routers to obtain the closest content without information from an ISP. In CaRD' routers record hop counts to a server and a cache as passing information of contents. Routers compare these hop counts' and then send request packets towards the closest contents. Moreover' caches move by request packets' so a hop count to a cache of record needs updating. For that' CaRD extends request packets. We add two new fields to request pack- ets and change their operation. To confirm effectiveness of CaRD' we implement CaRD on a simulator' ndnSIM' and evaluate cache hit ratio' traffic and download time.

KW - Breadcrumbs

KW - Cache

KW - ICN

KW - NDN

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=85008147387&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85008147387&partnerID=8YFLogxK

U2 - 10.1145/3004010.3004038

DO - 10.1145/3004010.3004038

M3 - Conference contribution

AN - SCOPUS:85008147387

VL - 28-November-2016

SP - 245

EP - 250

BT - Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016

PB - Association for Computing Machinery

ER -