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
이전 연구에서 Lampson et al. 접두사(BSP)에 대해 이진 검색을 수행하는 IP 조회 알고리즘을 제안했습니다. 이 알고리즘은 최악의 경우 메모리 요구 사항이 제한되어 있기 때문에 IPv6의 경우에도 매력적입니다. 빨리 감기를 수행하려면 삽입 속도를 줄여야 할 수도 있습니다. 이것이 정당화될 수 있지만 BSP의 라우팅 테이블 재구성은 빈번한 경로 업데이트를 처리하기에는 너무 시간이 많이 걸립니다. 본 연구에서는 초당 4,000회 이상의 경로 업데이트를 수행할 수 있는 빠른 전달 테이블 구성 알고리즘을 제안합니다. 게다가 빠른 패킷 전달 요구를 충족할 만큼 간단합니다. 향상된 다방향 검색 트리를 사용하여 트리의 깊이를 더욱 줄이고 포인터 저장 공간을 제거했습니다. 이렇게 하면 전달 테이블 크기가 줄어들고 조회 시간이 단축됩니다.
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.
부
Pi-Chung WANG, Chia-Tai CHAN, Yaw-Chung CHEN, "A Fast Table Update Scheme for High-Performance IP Forwarding" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 1, pp. 318-324, January 2002, doi: .
Abstract: In the previous work, Lampson et al. proposed an IP lookup algorithm which performs binary search on prefixes (BSP). The algorithm is attractive, even for IPv6, because of its bounded worst-case memory requirement. To achieve fast forwarding, it may need to slow down the insertion speed. Although this can be justified, the routing-table reconstruction in BSP is too time-consuming to handle the frequent route updates. In this work, we propose a fast forwarding-table construction algorithm which can accomplish more than 4,000 route updates per second. Moreover, it is simple enough to fulfill the need of fast packet forwarding. With the enhanced multiway search tree, we further reduced the depth of the tree and eliminated the pointer storage; this reduces the forwarding table size and shortens the lookup time.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_1_318/_p
부
@ARTICLE{e85-b_1_318,
author={Pi-Chung WANG, Chia-Tai CHAN, Yaw-Chung CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={A Fast Table Update Scheme for High-Performance IP Forwarding},
year={2002},
volume={E85-B},
number={1},
pages={318-324},
abstract={In the previous work, Lampson et al. proposed an IP lookup algorithm which performs binary search on prefixes (BSP). The algorithm is attractive, even for IPv6, because of its bounded worst-case memory requirement. To achieve fast forwarding, it may need to slow down the insertion speed. Although this can be justified, the routing-table reconstruction in BSP is too time-consuming to handle the frequent route updates. In this work, we propose a fast forwarding-table construction algorithm which can accomplish more than 4,000 route updates per second. Moreover, it is simple enough to fulfill the need of fast packet forwarding. With the enhanced multiway search tree, we further reduced the depth of the tree and eliminated the pointer storage; this reduces the forwarding table size and shortens the lookup time.},
keywords={},
doi={},
ISSN={},
month={January},}
부
TY - JOUR
TI - A Fast Table Update Scheme for High-Performance IP Forwarding
T2 - IEICE TRANSACTIONS on Communications
SP - 318
EP - 324
AU - Pi-Chung WANG
AU - Chia-Tai CHAN
AU - Yaw-Chung CHEN
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2002
AB - In the previous work, Lampson et al. proposed an IP lookup algorithm which performs binary search on prefixes (BSP). The algorithm is attractive, even for IPv6, because of its bounded worst-case memory requirement. To achieve fast forwarding, it may need to slow down the insertion speed. Although this can be justified, the routing-table reconstruction in BSP is too time-consuming to handle the frequent route updates. In this work, we propose a fast forwarding-table construction algorithm which can accomplish more than 4,000 route updates per second. Moreover, it is simple enough to fulfill the need of fast packet forwarding. With the enhanced multiway search tree, we further reduced the depth of the tree and eliminated the pointer storage; this reduces the forwarding table size and shortens the lookup time.
ER -