View : 46 Download: 0

Survey and proposal on binary search algorithms for longest prefix match

Title
Survey and proposal on binary search algorithms for longest prefix match
Authors
Lim H.Lee N.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2012
Journal Title
IEEE Communications Surveys and Tutorials
ISSN
1553-877XJCR Link
Citation
vol. 14, no. 3, pp. 681 - 697
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
The IP address lookup has been a major challenge for Internet routers. This is accompanied with a background of advances in link bandwidth and rapid growth in Internet traffic and the number of networks. This survey paper explores binary search algorithms as a simple and efficient approach to the IP address lookup problem. Binary search algorithms are categorized as algorithms based on the trie structure, algorithms performing binary search on prefix values, and algorithms performing binary search on prefix lengths. In this paper, algorithms in each category are described in terms of their data structures, routing tables, and performance. Performance is evaluated with respect to pre-defined metrics, such as search speed and memory requirement. Table update, scalability toward large routing data, and the migration to IPv6 are also discussed. Simulation results are shown for real routing data with sizes of 15000 to 227000 prefixes acquired from backbone routers. Suggestions are made for the choice of algorithms depending on the table size, routing data statistics, or implementation flexibility. © 2012 IEEE.
DOI
10.1109/SURV.2011.061411.00095
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