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
fDate :
12/5/2002 12:00:00 AM
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;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20021017
