On the Optimality of Shortest-path Routing in Information-Centric Networking

• Ryo, Nakamura

• Hiroyuki, Ohsaki

抄録

In recent years, Information-Centric Networking (ICN) that mainly focuses on contents that are transferred and received instead of on end hosts that transmit and receive contents has been under the spotlight. A straightforward approach for content routing in ICNs is to utilize a class of shortest-path routing mechanisms. In past research papers, several cache-aware routing mechanisms for ICNs to take advantage of content caches at intermediate routers have been proposed. In past studies, however, only link-level performance metrics (e.g., cache hit ratio and server load) of content routings have been investigated. Hence, it has been still unclear how the shortest-path routing is effective (or ineffective) in terms of application-level performance metrics. In this paper, we try to answer research questions regarding the optimality of the shortest-path routing. We compare the application-level performances with the shortest-path routing and with the optimal routing obtained by searching all detour paths existing in the vicinity of the shortest-path routing (optimal k-hop detour routing). Our findings include that the shortest-path routing is suitable when the network is balanced and cache sizes at routers are homogeneous, and that the optimal k-hop detour routing is suitable when variation in cache sizes is large.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.28(2020) (online)DOI　http://dx.doi.org/10.2197/ipsjjip.28.570------------------------------

In recent years, Information-Centric Networking (ICN) that mainly focuses on contents that are transferred and received instead of on end hosts that transmit and receive contents has been under the spotlight. A straightforward approach for content routing in ICNs is to utilize a class of shortest-path routing mechanisms. In past research papers, several cache-aware routing mechanisms for ICNs to take advantage of content caches at intermediate routers have been proposed. In past studies, however, only link-level performance metrics (e.g., cache hit ratio and server load) of content routings have been investigated. Hence, it has been still unclear how the shortest-path routing is effective (or ineffective) in terms of application-level performance metrics. In this paper, we try to answer research questions regarding the optimality of the shortest-path routing. We compare the application-level performances with the shortest-path routing and with the optimal routing obtained by searching all detour paths existing in the vicinity of the shortest-path routing (optimal k-hop detour routing). Our findings include that the shortest-path routing is suitable when the network is balanced and cache sizes at routers are homogeneous, and that the optimal k-hop detour routing is suitable when variation in cache sizes is large.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.28(2020) (online)DOI　http://dx.doi.org/10.2197/ipsjjip.28.570------------------------------

収録刊行物

• 情報処理学会論文誌

  情報処理学会論文誌 61 (9), 2020-09-15

キーワード

• [特集：“Applications and the Internet” in Conjunction with Main Topics of COMPSAC2019] ICN (Information-Centric Networking), shortest-path routing, optimal k-hop detour routing, content delivery delay, routing optimality

詳細情報

• CRID: 1050285700295884160
• NII論文ID: 170000183388
• NII書誌ID: AN00116647
• ISSN: 18827764
• Web Site: http://id.nii.ac.jp/1001/00206809/
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • CiNii Articles