A fast IPv6 route lookup scheme implemented by hardware is proposed in this paper. It supports a fast IP address lookup and can insert and delete the prefixes effectively. A novel compressed multibit trie algorithm that decreases the memory space occupied and the average searching time is applied. The scheme proposed in this paper is superior to other IPV6 route lookup ones, for example, by using SRAM pipeline, a lookup speed of 125 x 106 per second can be realized to satisfy 40Gbps optical link rate with only 1.9Mbyte consumption of memory space. As there is no actual IPv6 route prefix, we generate various simulation databases in which prefix length distribution is different. Simulation results show that our scheme has reasonable lookup time, memory space for all the prefix length distribution.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.