IEICE TRANSACTIONS on Communications
Open Access
Efficient Lookup Scheme for Non-aggregatable Name Prefixes and Its Evaluation
-
Full Text Views
33
- Cite this
- Free PDF (1.3MB)
Summary :
Content-Centric Networking (CCN) employs a hierarchical but location independent content naming scheme. While such a location independent naming brings various benefits including efficient content delivery, mobility, and multihoming, location independent name prefixes are hard to aggregate. This poses a serious scaling issue on the efficiency of looking up content names in a huge Forwarding Information Base (FIB) by longest prefix matching, which requires seeking the longest matching prefix through all candidate prefix lengths. We propose a new scheme for efficiently looking up non-aggregatable name prefixes in a large FIB. The proposed scheme is based on the observation that the bottleneck of FIB lookup is the random accesses to the high-latency off-chip DRAM for prefix seeking and this can be reduced by exploiting the information on the longest matching prefix length in the previous hop. Our evaluation results show that the proposed scheme significantly improves FIB lookup latency with a reasonable traffic parameters observed in today's Internet.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E96-B No.12 pp.2953-2963
- Publication Date
- 2013/12/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E96.B.2953
- Type of Manuscript
- Special Section PAPER (Special Section on Network and System Technologies for Sustainable Society)
- Category
Authors
Masaki FUKUSHIMA
KDDI R&D Laboratories, Inc.
Atsushi TAGAMI
KDDI R&D Laboratories, Inc.
Toru HASEGAWA
Osaka University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Masaki FUKUSHIMA, Atsushi TAGAMI, Toru HASEGAWA, "Efficient Lookup Scheme for Non-aggregatable Name Prefixes and Its Evaluation" in IEICE TRANSACTIONS on Communications,
vol. E96-B, no. 12, pp. 2953-2963, December 2013, doi: 10.1587/transcom.E96.B.2953.
Abstract: Content-Centric Networking (CCN) employs a hierarchical but location independent content naming scheme. While such a location independent naming brings various benefits including efficient content delivery, mobility, and multihoming, location independent name prefixes are hard to aggregate. This poses a serious scaling issue on the efficiency of looking up content names in a huge Forwarding Information Base (FIB) by longest prefix matching, which requires seeking the longest matching prefix through all candidate prefix lengths. We propose a new scheme for efficiently looking up non-aggregatable name prefixes in a large FIB. The proposed scheme is based on the observation that the bottleneck of FIB lookup is the random accesses to the high-latency off-chip DRAM for prefix seeking and this can be reduced by exploiting the information on the longest matching prefix length in the previous hop. Our evaluation results show that the proposed scheme significantly improves FIB lookup latency with a reasonable traffic parameters observed in today's Internet.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.2953/_p
Copy
@ARTICLE{e96-b_12_2953,
author={Masaki FUKUSHIMA, Atsushi TAGAMI, Toru HASEGAWA, },
journal={IEICE TRANSACTIONS on Communications},
title={Efficient Lookup Scheme for Non-aggregatable Name Prefixes and Its Evaluation},
year={2013},
volume={E96-B},
number={12},
pages={2953-2963},
abstract={Content-Centric Networking (CCN) employs a hierarchical but location independent content naming scheme. While such a location independent naming brings various benefits including efficient content delivery, mobility, and multihoming, location independent name prefixes are hard to aggregate. This poses a serious scaling issue on the efficiency of looking up content names in a huge Forwarding Information Base (FIB) by longest prefix matching, which requires seeking the longest matching prefix through all candidate prefix lengths. We propose a new scheme for efficiently looking up non-aggregatable name prefixes in a large FIB. The proposed scheme is based on the observation that the bottleneck of FIB lookup is the random accesses to the high-latency off-chip DRAM for prefix seeking and this can be reduced by exploiting the information on the longest matching prefix length in the previous hop. Our evaluation results show that the proposed scheme significantly improves FIB lookup latency with a reasonable traffic parameters observed in today's Internet.},
keywords={},
doi={10.1587/transcom.E96.B.2953},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Efficient Lookup Scheme for Non-aggregatable Name Prefixes and Its Evaluation
T2 - IEICE TRANSACTIONS on Communications
SP - 2953
EP - 2963
AU - Masaki FUKUSHIMA
AU - Atsushi TAGAMI
AU - Toru HASEGAWA
PY - 2013
DO - 10.1587/transcom.E96.B.2953
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2013
AB - Content-Centric Networking (CCN) employs a hierarchical but location independent content naming scheme. While such a location independent naming brings various benefits including efficient content delivery, mobility, and multihoming, location independent name prefixes are hard to aggregate. This poses a serious scaling issue on the efficiency of looking up content names in a huge Forwarding Information Base (FIB) by longest prefix matching, which requires seeking the longest matching prefix through all candidate prefix lengths. We propose a new scheme for efficiently looking up non-aggregatable name prefixes in a large FIB. The proposed scheme is based on the observation that the bottleneck of FIB lookup is the random accesses to the high-latency off-chip DRAM for prefix seeking and this can be reduced by exploiting the information on the longest matching prefix length in the previous hop. Our evaluation results show that the proposed scheme significantly improves FIB lookup latency with a reasonable traffic parameters observed in today's Internet.
ER -
English
