Skip to main content
Article thumbnail
Location of Repository

A Scalable and Small Forwarding Table for Fast IP Address Lookups

By Sungkee Jean, Sang-hun Chung, Jung-wdn Cho and Hyunsoo Yoon

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 in-coming 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 ac-cess 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. 1

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.1396
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://dspace.kaist.ac.kr/bits... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.