View : 94 Download: 0

High Speed IP Address Lookup Architecture Using Hashing

Title
High Speed IP Address Lookup Architecture Using Hashing
Authors
Lim H.Seo J.-H.Jung Y.-J.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2003
Journal Title
IEEE Communications Letters
ISSN
1089-7798JCR Link
Citation
vol. 7, no. 10, pp. 502 - 504
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
One of the most important design issues for IP routers responsible for datagram forwarding in computer networks is route-lookup mechanism. In this letter, we explored a practical IP address lookup scheme which converts longest prefix matching problem into the exact matching problem. In the proposed architecture, the forwarding table is composed of multiple SRAMs, and each SRAM represents an address lookup table in a single prefix. Hashing functions are applied to each address lookup table in order to find out matching entries in parallel, and the entry matched with the longest prefix among them is selected. Simulation using data from MAE-WEST router shows that a large routing table with 37 000 entries is compacted to a forwarding table of 189 kbytes in the proposed scheme and achieves one route lookup every two memory accesses in average.
DOI
10.1109/LCOMM.2003.818885
Appears in Collections:
엘텍공과대학 > 전자공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE