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 |