The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dalam makalah ini, kami menumpukan pada ICN berskala besar (Information-Centric Networking) dan mendedahkan sifat penskalaan ICN. Disebabkan caching kandungan dalam rangkaian, ICN ialah sejenis rangkaian cache dan dijangka menjadi seni bina yang menjanjikan untuk menggantikan Internet masa hadapan. Untuk merealisasikan ICN berskala global (cth, berskala Internet), adalah penting untuk memahami sifat asas rangkaian cache berskala besar tersebut. Walau bagaimanapun, sifat penskalaan ICN belum difahami dengan baik kerana kekurangan asas teori dan metodologi analisis. Untuk menjawab soalan penyelidikan mengenai sifat penskalaan ICN, kami memperoleh kebarangkalian hit cache pada setiap penghala, purata kelewatan penghantaran kandungan setiap entiti dan purata kelewatan penghantaran kandungan semua entiti melebihi pokok pengedaran kandungan terdiri daripada satu repositori (iaitu, pembekal kandungan), berbilang penghala dan berbilang entiti (iaitu, pengguna kandungan). Melalui beberapa contoh berangka, kami menyiasat kesan topologi dan saiz pepohon pengedaran kandungan dan saiz cache pada penghala pada purata kelewatan penghantaran kandungan semua entiti. Penemuan kami termasuk bahawa purata kelewatan penghantaran kandungan ICN menumpu kepada nilai tetap jika saiz cache penghala tidak kecil, yang membayangkan kebolehskalaan tinggi ICN, dan walaupun saiz rangkaian akan berkembang selama-lamanya, purata kelewatan penghantaran kandungan adalah dibatasi atas oleh nilai tetap jika penghala dalam rangkaian disediakan dengan jumlah cache kandungan yang saksama.
Ryo NAKAMURA
Kwansei Gakuin University
Hiroyuki OHSAKI
Kwansei Gakuin University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Ryo NAKAMURA, Hiroyuki OHSAKI, "On Scaling Property of Information-Centric Networking" in IEICE TRANSACTIONS on Communications,
vol. E102-B, no. 9, pp. 1804-1812, September 2019, doi: 10.1587/transcom.2018EIP0005.
Abstract: In this paper, we focus on a large-scale ICN (Information-Centric Networking), and reveal the scaling property of ICN. Because of in-network content caching, ICN is a sort of cache networks and expected to be a promising architecture for replacing future Internet. To realize a global-scale (e.g., Internet-scale) ICN, it is crucial to understand the fundamental properties of such large-scale cache networks. However, the scaling property of ICN has not been well understood due to the lack of theoretical foundations and analysis methodologies. For answering research questions regarding the scaling property of ICN, we derive the cache hit probability at each router, the average content delivery delay of each entity, and the average content delivery delay of all entities over a content distribution tree comprised of a single repository (i.e., content provider), multiple routers, and multiple entities (i.e., content consumers). Through several numerical examples, we investigate the effect of the topology and the size of the content distribution tree and the cache size at routers on the average content delivery delay of all entities. Our findings include that the average content delivery delay of ICNs converges to a constant value if the cache size of routers are not small, which implies high scalability of ICNs, and that even when the network size would grow indefinitely, the average content delivery delay is upper-bounded by a constant value if routers in the network are provided with a fair amount of content caches.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EIP0005/_p
Salinan
@ARTICLE{e102-b_9_1804,
author={Ryo NAKAMURA, Hiroyuki OHSAKI, },
journal={IEICE TRANSACTIONS on Communications},
title={On Scaling Property of Information-Centric Networking},
year={2019},
volume={E102-B},
number={9},
pages={1804-1812},
abstract={In this paper, we focus on a large-scale ICN (Information-Centric Networking), and reveal the scaling property of ICN. Because of in-network content caching, ICN is a sort of cache networks and expected to be a promising architecture for replacing future Internet. To realize a global-scale (e.g., Internet-scale) ICN, it is crucial to understand the fundamental properties of such large-scale cache networks. However, the scaling property of ICN has not been well understood due to the lack of theoretical foundations and analysis methodologies. For answering research questions regarding the scaling property of ICN, we derive the cache hit probability at each router, the average content delivery delay of each entity, and the average content delivery delay of all entities over a content distribution tree comprised of a single repository (i.e., content provider), multiple routers, and multiple entities (i.e., content consumers). Through several numerical examples, we investigate the effect of the topology and the size of the content distribution tree and the cache size at routers on the average content delivery delay of all entities. Our findings include that the average content delivery delay of ICNs converges to a constant value if the cache size of routers are not small, which implies high scalability of ICNs, and that even when the network size would grow indefinitely, the average content delivery delay is upper-bounded by a constant value if routers in the network are provided with a fair amount of content caches.},
keywords={},
doi={10.1587/transcom.2018EIP0005},
ISSN={1745-1345},
month={September},}
Salinan
TY - JOUR
TI - On Scaling Property of Information-Centric Networking
T2 - IEICE TRANSACTIONS on Communications
SP - 1804
EP - 1812
AU - Ryo NAKAMURA
AU - Hiroyuki OHSAKI
PY - 2019
DO - 10.1587/transcom.2018EIP0005
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2019
AB - In this paper, we focus on a large-scale ICN (Information-Centric Networking), and reveal the scaling property of ICN. Because of in-network content caching, ICN is a sort of cache networks and expected to be a promising architecture for replacing future Internet. To realize a global-scale (e.g., Internet-scale) ICN, it is crucial to understand the fundamental properties of such large-scale cache networks. However, the scaling property of ICN has not been well understood due to the lack of theoretical foundations and analysis methodologies. For answering research questions regarding the scaling property of ICN, we derive the cache hit probability at each router, the average content delivery delay of each entity, and the average content delivery delay of all entities over a content distribution tree comprised of a single repository (i.e., content provider), multiple routers, and multiple entities (i.e., content consumers). Through several numerical examples, we investigate the effect of the topology and the size of the content distribution tree and the cache size at routers on the average content delivery delay of all entities. Our findings include that the average content delivery delay of ICNs converges to a constant value if the cache size of routers are not small, which implies high scalability of ICNs, and that even when the network size would grow indefinitely, the average content delivery delay is upper-bounded by a constant value if routers in the network are provided with a fair amount of content caches.
ER -