Issue No. 05 - May (2005 vol. 54)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2005.83
Haibin Lu , IEEE
Sartaj Sahni , IEEE
Two schemes—prefix partitioning and interval partitioning—are proposed to improve the performance of dynamic IP router-table designs. While prefix partitioning applies to all known dynamic router-table designs, interval partitioning applies to the alternative collection of binary search tree designs of Sahni and Kim . Experiments using public-domain IPv4 router databases indicate that one of the proposed prefix partitioning schemes—TLDP—results in router tables that require less memory than when prefix partitioning is not used. Further significant reduction in the time to find the longest matching-prefix, insert a prefix, and delete a prefix is achieved.
Packet routing, dynamic router-tables, longest-prefix matching, prefix partitioning, interval partitioning.
Haibin Lu, Kun Suk Kim, Sartaj Sahni, "Prefix and Interval-Partitioned Dynamic IP Router-Tables", IEEE Transactions on Computers, vol. 54, no. , pp. 545-557, May 2005, doi:10.1109/TC.2005.83