Optimization of the Routing Table Lookup Algorithm for IPv6

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.