View : 5 Download: 0

Efficient binary search for IP address lookup

Title
Efficient binary search for IP address lookup
Authors
Yim C.Lee B.Lim H.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2005
Journal Title
IEEE Communications Letters
ISSN
1089-7798JCR Link
Citation
vol. 9, no. 7, pp. 652 - 654
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
As an essential function in internet routers, address lookup determines overall router performance. The most important performance metric in software-based address lookup is the number of memory accesses since it is directly related to lookup time. This letter proposes an algorithm to perform efficient binary search for IP address lookup. The depth of the proposed binary tree is very dose to the minimum bound, and hence it results in much smaller number of worst case memory accesses compared to previous schemes. The proposed algorithm requires comparably small size of memory, and it can be used for software-based address lookup in practical internet routers. © 2005 IEEE.
DOI
10.1109/LCOMM.2005.07010
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