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 ini, kami mencadangkan satu skema pemadatan jadual penghalaan untuk enjin pemajuan IP berdasarkan ingatan boleh alamat kandungan ternary (TCAM). Skim kami menukar jadual penghalaan asal kepada bentuk dengan hanya awalan bercapah. Lompatan seterusnya yang paling lazim bagi jadual penghalaan kemudiannya dikira dan awalan laluan yang sepadan dengan lompatan seterusnya digantikan dengan satu entri TCAM. Dalam kombinasi dengan algoritma pengecilan logik Espresso-II, skema yang dicadangkan mengurangkan keperluan storan TCAM sebanyak lebih daripada 75% berbanding dengan jadual penghalaan asal. Kami juga membentangkan pendekatan yang berkesan untuk menyokong kemas kini tambahan.
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, Yi-Ting FANG, Tzung-Chian HUANG, "Routing Table Compaction for TCAM-Based IP Address Lookup" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 5, pp. 1272-1275, May 2010, doi: 10.1587/transcom.E93.B.1272.
Abstract: In this work, we propose a scheme of routing table compaction for IP forwarding engines based on ternary content addressable memory (TCAM). Our scheme transforms the original routing table into a form with only disjoint prefixes. The most prevalent next hop of the routing table is then calculated and the route prefixes corresponding to the next hop are replaced by one TCAM entry. In combination with Espresso-II logic minimization algorithm, the proposed scheme reduces the TCAM storage requirements by more than 75% compared to the original routing tables. We also present an effective approach to support incremental updates.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1272/_p
Salinan
@ARTICLE{e93-b_5_1272,
author={Pi-Chung WANG, Yi-Ting FANG, Tzung-Chian HUANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Routing Table Compaction for TCAM-Based IP Address Lookup},
year={2010},
volume={E93-B},
number={5},
pages={1272-1275},
abstract={In this work, we propose a scheme of routing table compaction for IP forwarding engines based on ternary content addressable memory (TCAM). Our scheme transforms the original routing table into a form with only disjoint prefixes. The most prevalent next hop of the routing table is then calculated and the route prefixes corresponding to the next hop are replaced by one TCAM entry. In combination with Espresso-II logic minimization algorithm, the proposed scheme reduces the TCAM storage requirements by more than 75% compared to the original routing tables. We also present an effective approach to support incremental updates.},
keywords={},
doi={10.1587/transcom.E93.B.1272},
ISSN={1745-1345},
month={May},}
Salinan
TY - JOUR
TI - Routing Table Compaction for TCAM-Based IP Address Lookup
T2 - IEICE TRANSACTIONS on Communications
SP - 1272
EP - 1275
AU - Pi-Chung WANG
AU - Yi-Ting FANG
AU - Tzung-Chian HUANG
PY - 2010
DO - 10.1587/transcom.E93.B.1272
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2010
AB - In this work, we propose a scheme of routing table compaction for IP forwarding engines based on ternary content addressable memory (TCAM). Our scheme transforms the original routing table into a form with only disjoint prefixes. The most prevalent next hop of the routing table is then calculated and the route prefixes corresponding to the next hop are replaced by one TCAM entry. In combination with Espresso-II logic minimization algorithm, the proposed scheme reduces the TCAM storage requirements by more than 75% compared to the original routing tables. We also present an effective approach to support incremental updates.
ER -