Potential based routing for ICN

  • Authors:
  • Suyong Eum;Kiyohide Nakauchi;Takeshi Usui;Masayuki Murata;Nozomu Nishinaga

  • Affiliations:
  • National Institute of Information and Communications Technology, Nukui-Kitamachi, Koganei, Tokyo, Japan;National Institute of Information and Communications Technology, Nukui-Kitamachi, Koganei, Tokyo, Japan;National Institute of Information and Communications Technology, Nukui-Kitamachi, Koganei, Tokyo, Japan;Osaka University, Yamadaoka, Suita, Osaka, Japan;National Institute of Information and Communications Technology, Nukui-Kitamachi, Koganei, Tokyo, Japan

  • Venue:
  • AINTEC '11 Proceedings of the 7th Asian Internet Engineering Conference
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we address two of the problems, namely routing and content caching. For the routing problem, we introduce the Potential Based Routing (PBR) which provides not only availability but also diversity and adaptability. In addition, we examine three caching policies to select a possible candidate for ICN. The integrated system of both PBR and a content caching policy is called the Cache Aware Target idenTiŒcation (CATT). We present some simulation results to evaluate its performance.