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
Neste artigo, nos concentramos em uma ICN (Rede Centrada em Informação) de grande escala e revelamos a propriedade de escala da ICN. Por causa do cache de conteúdo na rede, o ICN é uma espécie de rede de cache e espera-se que seja uma arquitetura promissora para substituir a Internet futura. Para realizar uma ICN em escala global (por exemplo, na escala da Internet), é crucial compreender as propriedades fundamentais dessas redes de cache em grande escala. No entanto, a propriedade de escala do ICN não tem sido bem compreendida devido à falta de fundamentos teóricos e metodologias de análise. Para responder a questões de pesquisa relacionadas à propriedade de escala do ICN, derivamos a probabilidade de acerto do cache em cada roteador, o atraso médio na entrega de conteúdo de cada entidade e o atraso médio na entrega de conteúdo de todas as entidades ao longo de cada roteador. uma árvore de distribuição de conteúdo composto por um único repositório (ou seja, provedor de conteúdo), vários roteadores e múltiplas entidades (ou seja, consumidores de conteúdo). Através de vários exemplos numéricos, investigamos o efeito da topologia e do tamanho da árvore de distribuição de conteúdo e do tamanho do cache nos roteadores no atraso médio de entrega de conteúdo de todas as entidades. Nossas descobertas incluem que o atraso médio na entrega de conteúdo dos ICNs converge para um valor constante se o tamanho do cache dos roteadores não for pequeno, o que implica alta escalabilidade dos ICNs, e que mesmo quando o tamanho da rede cresceria indefinidamente, o atraso médio na entrega de conteúdo é limitado superiormente por um valor constante se os roteadores da rede receberem uma quantidade razoável de caches de conteúdo.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -