A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree

Free registration required

Executive Summary

The Internet consists of a mesh of routers interconnected by links. In a router, the major function in packet forwarding process is to lookup the destination addresses for the incoming packets according to the routing table. In the recent years, due to the prevalence of the World Wide Web (WWW) and many emerging multimedia networking applications, network traffic at major exchange points is doubling every few months. The increasing traffic has put great loads on the capacity of routers. To keep pace with the Internet traffic growth and continue to furnish good Quality-of-Service (QoS) on the Internet, there is an urgent need of the fast IP lookup algorithm with fast update.

  • Format: PDF
  • Size: 288 KB