View : 36 Download: 0

A new pipelined binary search architecture for IP address lookup

Title
A new pipelined binary search architecture for IP address lookup
Authors
Lim H.Lee B.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2004
Journal Title
IEEE Workshop on High Performance Switching and Routing, HPSR
Indexed
SCOPUS scopus
Abstract
Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solves the issues of the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 250-kbyte SRAM to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by one memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.
ISBN
0780383753; 9780780383753
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