Robust routing table design for IPv6 lookup
The most pressing issue in IP lookup has been to solve the longest prefix match (LPM) problem. The solution must appeal to 3 major criteria of lookup and update performance of the routing table, and memory consumption. However, in IPv6 route table lookup addressing the problem of the possible long p...
| Main Authors: | , |
|---|---|
| Format: | Book Section |
| Language: | English |
| Published: |
IEEE Xplore
2005
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2389/ http://shdl.mmu.edu.my/2389/1/Robust%20routing%20table%20design%20for%20IPv6%20lookup.pdf |
| _version_ | 1848790042666860544 |
|---|---|
| author | Yong, S. M. Ewe, Hong Tat |
| author_facet | Yong, S. M. Ewe, Hong Tat |
| author_sort | Yong, S. M. |
| building | MMU Institutional Repository |
| collection | Online Access |
| description | The most pressing issue in IP lookup has been to solve the longest prefix match (LPM) problem. The solution must appeal to 3 major criteria of lookup and update performance of the routing table, and memory consumption. However, in IPv6 route table lookup addressing the problem of the possible long prefix (128-bit) in the worst case is crucial. In this study, this challenge is met by 'breaking' the address length into 'smaller' pieces of different prefix length in separate but contiguous tables. Coupled with smart prefix sorting and hardware hashing, this scheme is designed to be flexible and memory efficient. |
| first_indexed | 2025-11-14T18:06:20Z |
| format | Book Section |
| id | mmu-2389 |
| institution | Multimedia University |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T18:06:20Z |
| publishDate | 2005 |
| publisher | IEEE Xplore |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | mmu-23892013-12-02T02:20:56Z http://shdl.mmu.edu.my/2389/ Robust routing table design for IPv6 lookup Yong, S. M. Ewe, Hong Tat QA75.5-76.95 Electronic computers. Computer science The most pressing issue in IP lookup has been to solve the longest prefix match (LPM) problem. The solution must appeal to 3 major criteria of lookup and update performance of the routing table, and memory consumption. However, in IPv6 route table lookup addressing the problem of the possible long prefix (128-bit) in the worst case is crucial. In this study, this challenge is met by 'breaking' the address length into 'smaller' pieces of different prefix length in separate but contiguous tables. Coupled with smart prefix sorting and hardware hashing, this scheme is designed to be flexible and memory efficient. IEEE Xplore 2005 Book Section NonPeerReviewed text en http://shdl.mmu.edu.my/2389/1/Robust%20routing%20table%20design%20for%20IPv6%20lookup.pdf Yong, S. M. and Ewe, Hong Tat (2005) Robust routing table design for IPv6 lookup. In: Third International Conference on Information Technology and Applications, 2005. ICITA 2005. IEEE Xplore, pp. 531-536. ISBN 0-7695-2316-1 http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1488860 10.1109/ICITA.2005.241 10.1109/ICITA.2005.241 10.1109/ICITA.2005.241 |
| spellingShingle | QA75.5-76.95 Electronic computers. Computer science Yong, S. M. Ewe, Hong Tat Robust routing table design for IPv6 lookup |
| title | Robust routing table design for IPv6 lookup |
| title_full | Robust routing table design for IPv6 lookup |
| title_fullStr | Robust routing table design for IPv6 lookup |
| title_full_unstemmed | Robust routing table design for IPv6 lookup |
| title_short | Robust routing table design for IPv6 lookup |
| title_sort | robust routing table design for ipv6 lookup |
| topic | QA75.5-76.95 Electronic computers. Computer science |
| url | http://shdl.mmu.edu.my/2389/ http://shdl.mmu.edu.my/2389/ http://shdl.mmu.edu.my/2389/ http://shdl.mmu.edu.my/2389/1/Robust%20routing%20table%20design%20for%20IPv6%20lookup.pdf |