Citation

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

Text Robust routing table design for IPv6 lookup.pdf Restricted to Repository staff only Download (108kB)

Abstract

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.

Item Type:	Book Section
Additional Information:	Proceeding ICITA '05 Proceedings of the Third International Conference on Information Technology and Applications (ICITA'05) Volume 2 - Volume 02
Subjects:	Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions:	Faculty of Computing and Informatics (FCI)
Depositing User:	Ms Rosnani Abd Wahab
Date Deposited:	22 Aug 2011 03:13
Last Modified:	02 Dec 2013 02:20
URII:	http://shdl.mmu.edu.my/id/eprint/2389

Downloads

Edit (login required)