View : 64 Download: 0

Priority tries for IP address lookup

Title
Priority tries for IP address lookup
Authors
Lim H.Yim C.Swartzlander Jr. E.E.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2010
Journal Title
IEEE Transactions on Computers
ISSN
0018-9340JCR Link
Citation
vol. 59, no. 6, pp. 784 - 794
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
High-speed IP address lookup is essential to achieve wire speed packet forwarding in Internet routers. The longest prefix matching for IP address lookup is more complex than exact matching because it involves dual dimensions: length and value. This paper presents a new formulation for IP address lookup problem using range representation of prefixes and proposes an efficient binary trie structure named a priority trie. In this range representation, prefixes are represented as ranges on a number line between 0 and 1 without expanding to the maximum length. The best match to a given input address is the smallest range that includes the input. The priority trie is based on the trie structure, with empty internal nodes in the trie replaced by the priority prefix which is the longest among those in the subtrie rooted by the empty nodes. The search ends when an input matches a priority prefix, which significantly improves the search performance. Performance evaluation using real routing data shows that the proposed priority trie is very good in performance metrics such as lookup speed, memory size, update performance, and scalability. © 2006 IEEE.
DOI
10.1109/TC.2010.38
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