Small Forwarding Tables For Fast Routing Lookups

IP address lookup is an important design issue for the high performance Internet routers. Due tornthe rapid growth of traffic in the Internet, backbone links of several gigabits per second arerncommonly deployed. To handle gigabit-per-second traffic rates, the backbone routers must bernable to forward millions of packets per second on each of their ports. Fast IP address lookup inrnthe routers, which uses the packet’s destination address to determine for each packet the nextrnhop, is therefore crucial to achieve the packet forwarding rates required. In the last few years,rnvarious algorithms for high-performance IP address lookup have been proposed. The algorithmrnthat is under scrutiny in this project is based on matching longest IP prefix. This algorithmrnincorporates a technique of complete trie in building prefix tries. This mechanism enables tornbuild small forwarding tables.rnIn this project we will present a forwarding table data structure designed for quick routingrnlookups. The Forwarding tables are small enough to fit in the cache of a conventional generalrnpurpose processor. This means that it is feasible to do a full routing lookup for each IP packet atrngigabit speeds without using special hardware.rnKeywords: Address lookup, Complete Trie, Data Structure

Get Full Work

Report copyright infringement or plagiarism