DocumentCode
971933
Title
Parallelisation of trie-based longest prefix matching for fast IP address lookups
Author
Park, Jaehyung ; Jang, Ikhyeon
Author_Institution
Dept. of Electron., Comput. & Inf. Eng., Chonnam Nat. Univ., Kwangju, South Korea
Volume
38
Issue
25
fYear
2002
fDate
12/5/2002 12:00:00 AM
Firstpage
1757
Lastpage
1759
Abstract
IP address lookup is an important design issue for the high performance packet forwarding engine. The forwarding engine performs a longest prefix matching on the address lookup for an incoming IP packet to determine the next hop. A parallelisation scheme of longest prefix matching algorithms based on path-compressed trie is proposed. The proposed scheme reduces memory access time of IP address lookup while keeping memory spaces of parallel elements balanced.
Keywords
Internet; packet switching; parallel architectures; table lookup; fast IP address lookups; high performance packet forwarding engine; longest prefix matching algorithms; memory access time; memory spaces; parallel elements; parallelisation scheme; path-compressed trie; trie-based longest prefix matching;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:20021017
Filename
1137511
Link To Document