DocumentCode
3006692
Title
Optimization of the Routing Table Lookup Algorithm for IPv6
Author
Lin, Jinxian ; Li, Huimin
Author_Institution
Network Inf. Center, Fuzhou Univ., Fuzhou
fYear
2008
fDate
25-26 Sept. 2008
Firstpage
236
Lastpage
239
Abstract
With the extensive application of IPv6 protocol, the traditional IPv4 routing table lookup algorithms no longer satisfy the need of routing forward in the IPv6 network environment. So we optimize the routing table lookup algorithm to adapt for IPv6 that employs Bloom filters to realize parallel longest prefix match. The algorithm efficiently narrows the scope of the search, reduces the average time of hash probe per lookup, and thereby enhances lookup speed.
Keywords
IP networks; data structures; string matching; table lookup; telecommunication network routing; transport protocols; Bloom filter; IPv4 routing table lookup algorithm optimization; IPv6 network environment; IPv6 protocol; hash probe; parallel longest prefix string match; Computer networks; Computer science; Educational institutions; Genetics; Internet; Matched filters; Mathematics; Probes; Routing; Table lookup; Bloom filter; IPv6; routing table;
fLanguage
English
Publisher
ieee
Conference_Titel
Genetic and Evolutionary Computing, 2008. WGEC '08. Second International Conference on
Conference_Location
Hubei
Print_ISBN
978-0-7695-3334-6
Type
conf
DOI
10.1109/WGEC.2008.122
Filename
4637435
Link To Document