タイトル | Local Tree Hunting Scheme to Find the Closest Content in In-Network Cache |
参考URL | http://www.nict.go.jp/publication/shuppan/kihou-journal/journal-vol62no2.html |
著者(日) | 清水, 洋; 地引, 昌弘 |
著者(英) | Shimizu, Hiroshi; Jibiki, Masahiro |
著者所属(日) | 情報通信研究機構(NICT); 情報通信研究機構(NICT) |
著者所属(英) | National Institute of Information and Communications Technology (NICT); National Institute of Information and Communications Technology (NICT) |
発行日 | 2016-02 |
発行機関など | National Institute of Information and Communications Technology (NICT) 情報通信研究機構(NICT) |
刊行物名 | Journal of the National Institute of Information and Communications Technology |
巻 | 62 |
号 | 2 |
開始ページ | 139 |
終了ページ | 146 |
刊行年月日 | 2016-02 |
言語 | eng |
抄録 | CCN/ICN with in-network cache capability has been expected as Future Internet. This paper proposes a novel content discovery scheme called Local Tree Hunting for cached contents. It provides almost the same hunting performance as the entire hunting although the hunting area is localized into a tree whose root is the node with caching history. As an option, when caching the state is notified to neighbor nodes to make a short-cut of request forwarding. The effectiveness of the proposed scheme is verified with computer simulation with a Zipf’s law content popularity distribution and the Least Recently Used eviction model. |
内容記述 | Physical characteristics: Original contains color illustrations 形態: カラー図版あり 注記: 情報通信研究機構研究報告61(2)の英訳 |
資料種別 | Technical Report |
NASA分類 | Communications and Radar |
ISSN | 1349-3205 |
NCID | AA12009289 |
SHI-NO | AA1640039017 |
URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/573149 |