2007•대한전자공학회 학술대회Requires access
A New Efficient IP Address Lookup Based on Binary Search
Hyun‐Sik Kim, Hyuntae Park, Daein Kang, Sungho Kang
Open publisher page 0 citations
Abstract
IP address lookup is an important function in a router to settle overall performance of the router. Binary search on range is a useful algorithm based on binary search for IP address lookup. However, this approach requires a lot of memories for adapting binary search to variable-length prefixes. We propose the improved algorithm to reduce memory requirements than binary search on range dramatically by a different view of a range. It reduces the number of entries and the memory requirements for pointers by about 21 % and 52% on average, respectively.