A Fast IP Address Lookup Algorithm Based on Search Space Reduction
Summary :
This letter proposes a fast IP address lookup algorithm based on search space reduction. Prefixes are classified into three types according to the nesting relationship and a large forwarding table is partitioned into multiple small trees. As a result, the search space is reduced. The results of analyses and experiments show that the proposed method offers higher lookup and updating speeds along with reduced memory requirements.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.4 pp.1009-1012
- Publication Date
- 2010/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.1009
- Type of Manuscript
- LETTER
- Category
- Switching for Communications
Authors
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
Hyuntae PARK, Hyunjin KIM, Hong-Sik KIM, Sungho KANG, "A Fast IP Address Lookup Algorithm Based on Search Space Reduction" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 4, pp. 1009-1012, April 2010, doi: 10.1587/transcom.E93.B.1009.
Abstract: This letter proposes a fast IP address lookup algorithm based on search space reduction. Prefixes are classified into three types according to the nesting relationship and a large forwarding table is partitioned into multiple small trees. As a result, the search space is reduced. The results of analyses and experiments show that the proposed method offers higher lookup and updating speeds along with reduced memory requirements.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1009/_p
Copy
@ARTICLE{e93-b_4_1009,
author={Hyuntae PARK, Hyunjin KIM, Hong-Sik KIM, Sungho KANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Fast IP Address Lookup Algorithm Based on Search Space Reduction},
year={2010},
volume={E93-B},
number={4},
pages={1009-1012},
abstract={This letter proposes a fast IP address lookup algorithm based on search space reduction. Prefixes are classified into three types according to the nesting relationship and a large forwarding table is partitioned into multiple small trees. As a result, the search space is reduced. The results of analyses and experiments show that the proposed method offers higher lookup and updating speeds along with reduced memory requirements.},
keywords={},
doi={10.1587/transcom.E93.B.1009},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - A Fast IP Address Lookup Algorithm Based on Search Space Reduction
T2 - IEICE TRANSACTIONS on Communications
SP - 1009
EP - 1012
AU - Hyuntae PARK
AU - Hyunjin KIM
AU - Hong-Sik KIM
AU - Sungho KANG
PY - 2010
DO - 10.1587/transcom.E93.B.1009
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2010
AB - This letter proposes a fast IP address lookup algorithm based on search space reduction. Prefixes are classified into three types according to the nesting relationship and a large forwarding table is partitioned into multiple small trees. As a result, the search space is reduced. The results of analyses and experiments show that the proposed method offers higher lookup and updating speeds along with reduced memory requirements.
ER -
English
