A Small and Fast IP Forwarding Table Using Hashing
Summary :
Building next generation routers with the capability of forwarding multiple millions of packets per second is required for the increasing demand for high bandwidth on the Internet. Reducing the required memory size of the forwarding table is a possible solution since small forwarding table can be integrated into the application specific integrated circuit (ASIC). In this paper a hash technique is developed to reduce the size of the IP forwarding table. The proposed data structure is a compressed 8-8-8-8 multibit trie that is based on hash tables of 4-bit addresses. Two optimization techniques are also proposed to further improve the performance of the proposed schemes. Our experimental results show that the proposed hashing-based schemes are better than the Small Forwarding Table scheme both in memory size and lookup latency.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.1 pp.239-246
- Publication Date
- 2005/01/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.1.239
- Type of Manuscript
- PAPER
- Category
- Internet
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
Yeim-Kuan CHANG, "A Small and Fast IP Forwarding Table Using Hashing" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 1, pp. 239-246, January 2005, doi: 10.1093/ietcom/e88-b.1.239.
Abstract: Building next generation routers with the capability of forwarding multiple millions of packets per second is required for the increasing demand for high bandwidth on the Internet. Reducing the required memory size of the forwarding table is a possible solution since small forwarding table can be integrated into the application specific integrated circuit (ASIC). In this paper a hash technique is developed to reduce the size of the IP forwarding table. The proposed data structure is a compressed 8-8-8-8 multibit trie that is based on hash tables of 4-bit addresses. Two optimization techniques are also proposed to further improve the performance of the proposed schemes. Our experimental results show that the proposed hashing-based schemes are better than the Small Forwarding Table scheme both in memory size and lookup latency.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.1.239/_p
Copy
@ARTICLE{e88-b_1_239,
author={Yeim-Kuan CHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Small and Fast IP Forwarding Table Using Hashing},
year={2005},
volume={E88-B},
number={1},
pages={239-246},
abstract={Building next generation routers with the capability of forwarding multiple millions of packets per second is required for the increasing demand for high bandwidth on the Internet. Reducing the required memory size of the forwarding table is a possible solution since small forwarding table can be integrated into the application specific integrated circuit (ASIC). In this paper a hash technique is developed to reduce the size of the IP forwarding table. The proposed data structure is a compressed 8-8-8-8 multibit trie that is based on hash tables of 4-bit addresses. Two optimization techniques are also proposed to further improve the performance of the proposed schemes. Our experimental results show that the proposed hashing-based schemes are better than the Small Forwarding Table scheme both in memory size and lookup latency.},
keywords={},
doi={10.1093/ietcom/e88-b.1.239},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - A Small and Fast IP Forwarding Table Using Hashing
T2 - IEICE TRANSACTIONS on Communications
SP - 239
EP - 246
AU - Yeim-Kuan CHANG
PY - 2005
DO - 10.1093/ietcom/e88-b.1.239
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2005
AB - Building next generation routers with the capability of forwarding multiple millions of packets per second is required for the increasing demand for high bandwidth on the Internet. Reducing the required memory size of the forwarding table is a possible solution since small forwarding table can be integrated into the application specific integrated circuit (ASIC). In this paper a hash technique is developed to reduce the size of the IP forwarding table. The proposed data structure is a compressed 8-8-8-8 multibit trie that is based on hash tables of 4-bit addresses. Two optimization techniques are also proposed to further improve the performance of the proposed schemes. Our experimental results show that the proposed hashing-based schemes are better than the Small Forwarding Table scheme both in memory size and lookup latency.
ER -
English
