View : 5 Download: 0

Binary searches on multiple small trees for IP address lookup

Title
Binary searches on multiple small trees for IP address lookup
Authors
Lim H.Lee B.Kim W.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2005
Journal Title
IEEE Communications Letters
ISSN
1089-7798JCR Link
Citation
vol. 9, no. 1, pp. 75 - 77
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
Rapid growth of internet traffic requires more internet bandwidth and high-speed packet processing in internet routers. IP address lookup in routers is an essential operation that should be performed in real-time for routers where hundreds of million packets arrive per second. In this paper, we propose a new software-based architecture for efficient IP address lookup. In the proposed scheme, a large routing table is divided into multiple balanced trees, and sequential binary searches are performed on those trees, and hence the number of memory accesses depends on the number of routing entries not on the length of routing prefixes. Performance evaluation results show that the proposed architecture requires a single 301.7 KByte SRAM to store about 41000 routing entries, and an address lookup is achieved by 11 memory accesses in average. © 2005 IEEE.
DOI
10.1109/LCOMM.2005.01029
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