A scalable and small forwarding table for fast IP address lookups

Abstract

IP address lookup is an important design issue for the high performance Internet routers. The most important function of routers is to determine the output port of an incoming IP packet according to its destination address. In this papel; we propose a scalable and simple forwarding table structure for fast hardware-based IP address lookup which reduces memory requirements and memory access times. Proposed scheme requires maJcimum two memory access times in the worst case tojnish an IP address lookup.And it consumes about 0.6 N I.1MBytes memory for large routing tables with 16,000 N 43,000 routing prejixes when any compression method is not used.