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
Dalam kerja sebelumnya, Lampson et al. mencadangkan algoritma carian IP yang melakukan carian binari pada awalan (BSP). Algoritma ini menarik, walaupun untuk IPv6, kerana keperluan memori terburuk yang terhad. Untuk mencapai pemajuan pantas, ia mungkin perlu memperlahankan kelajuan pemasukan. Walaupun ini boleh dibenarkan, pembinaan semula jadual laluan di BSP terlalu memakan masa untuk mengendalikan kemas kini laluan yang kerap. Dalam kerja ini, kami mencadangkan algoritma pembinaan jadual pemajuan pantas yang boleh mencapai lebih daripada 4,000 kemas kini laluan sesaat. Selain itu, ia cukup mudah untuk memenuhi keperluan penghantaran paket yang pantas. Dengan pepohon carian berbilang hala yang dipertingkatkan, kami mengurangkan lagi kedalaman pokok itu dan menghapuskan storan penunjuk; ini mengurangkan saiz jadual pemajuan dan memendekkan masa carian.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -