Performance Analysis of Content-Centric Networking on an Arbitrary Network Topology

Ryo NAKAMURA; Hiroyuki OHSAKI

doi:10.1587/transcom.2017ITP0004

Performance Analysis of Content-Centric Networking on an Arbitrary Network Topology

Ryo NAKAMURA, Hiroyuki OHSAKI

Full Text Views

0

Share
Cite this

Summary :

In this paper, we use the MCA (Multi-Cache Approximation) algorithm to numerically determine cache hit probability in a multi-cache network. We then analytically obtain performance metrics for Content-Centric networking (CCN). Our analytical model contains multiple routers, multiple repositories (e.g., storage servers), and multiple entities (e.g., clients). We obtain three performance metrics: content delivery delay (i.e., the average time required for an entity to retrieve a content through a neighboring router), throughput (i.e., number of contents delivered from an entity per unit of time), and availability (i.e., probability that an entity can successfully retrieve a content from a network). Through several numerical examples, we investigate how network topology affects the performance of CCN. A notable finding is that content caching becomes more beneficial in terms of content delivery time and availability (resp., throughput) as distance between the entity and the requesting repository narrows (resp., widens).

Publication: IEICE TRANSACTIONS on Communications Vol.E101-B No.1 pp.24-34

Publication Date: 2018/01/01

Publicized: 2017/07/05

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2017ITP0004

Type of Manuscript: Special Section PAPER (Special Section on Internet Technologies to Accelerate Smart Society)

Category

Authors

Ryo NAKAMURA
Kwansei Gakuin University
Hiroyuki OHSAKI
Kwansei Gakuin University

Keyword

CCN (Content-Centric Networking), performance analysis, content delivery time, throughput, availability

Cite this

Copy

Ryo NAKAMURA, Hiroyuki OHSAKI, "Performance Analysis of Content-Centric Networking on an Arbitrary Network Topology" in IEICE TRANSACTIONS on Communications, vol. E101-B, no. 1, pp. 24-34, January 2018, doi: 10.1587/transcom.2017ITP0004.
Abstract: In this paper, we use the MCA (Multi-Cache Approximation) algorithm to numerically determine cache hit probability in a multi-cache network. We then analytically obtain performance metrics for Content-Centric networking (CCN). Our analytical model contains multiple routers, multiple repositories (e.g., storage servers), and multiple entities (e.g., clients). We obtain three performance metrics: content delivery delay (i.e., the average time required for an entity to retrieve a content through a neighboring router), throughput (i.e., number of contents delivered from an entity per unit of time), and availability (i.e., probability that an entity can successfully retrieve a content from a network). Through several numerical examples, we investigate how network topology affects the performance of CCN. A notable finding is that content caching becomes more beneficial in terms of content delivery time and availability (resp., throughput) as distance between the entity and the requesting repository narrows (resp., widens).
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.2017ITP0004/_p

Copy

@ARTICLE{e101-b_1_24,
author={Ryo NAKAMURA, Hiroyuki OHSAKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance Analysis of Content-Centric Networking on an Arbitrary Network Topology},
year={2018},
volume={E101-B},
number={1},
pages={24-34},
abstract={In this paper, we use the MCA (Multi-Cache Approximation) algorithm to numerically determine cache hit probability in a multi-cache network. We then analytically obtain performance metrics for Content-Centric networking (CCN). Our analytical model contains multiple routers, multiple repositories (e.g., storage servers), and multiple entities (e.g., clients). We obtain three performance metrics: content delivery delay (i.e., the average time required for an entity to retrieve a content through a neighboring router), throughput (i.e., number of contents delivered from an entity per unit of time), and availability (i.e., probability that an entity can successfully retrieve a content from a network). Through several numerical examples, we investigate how network topology affects the performance of CCN. A notable finding is that content caching becomes more beneficial in terms of content delivery time and availability (resp., throughput) as distance between the entity and the requesting repository narrows (resp., widens).},
keywords={},
doi={10.1587/transcom.2017ITP0004},
ISSN={1745-1345},
month={January},}

Copy

TY - JOUR
TI - Performance Analysis of Content-Centric Networking on an Arbitrary Network Topology
T2 - IEICE TRANSACTIONS on Communications
SP - 24
EP - 34
AU - Ryo NAKAMURA
AU - Hiroyuki OHSAKI
PY - 2018
DO - 10.1587/transcom.2017ITP0004
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E101-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2018
AB - In this paper, we use the MCA (Multi-Cache Approximation) algorithm to numerically determine cache hit probability in a multi-cache network. We then analytically obtain performance metrics for Content-Centric networking (CCN). Our analytical model contains multiple routers, multiple repositories (e.g., storage servers), and multiple entities (e.g., clients). We obtain three performance metrics: content delivery delay (i.e., the average time required for an entity to retrieve a content through a neighboring router), throughput (i.e., number of contents delivered from an entity per unit of time), and availability (i.e., probability that an entity can successfully retrieve a content from a network). Through several numerical examples, we investigate how network topology affects the performance of CCN. A notable finding is that content caching becomes more beneficial in terms of content delivery time and availability (resp., throughput) as distance between the entity and the requesting repository narrows (resp., widens).
ER -