Dynamic routing tables using simple balanced search trees

Yeim-Kuan Chang, Yung Chieh Lin

研究成果: Conference contribution

3 引文 斯高帕斯(Scopus)


Various schemes for high-performance IP address lookups have been proposed recently. Pre-computations are usually used by the special designed IP address lookup algorithms to improve the lookup speed and reduce the memory requirement. However, the disadvantage of the pre-computation based schemes is when a single prefix is added or deleted, the entire data structure may need to be rebuilt. Rebuilding the entire data structure seriously affects the lookup performance of a backbone router, and thus is not suitable for dynamic routing tables. In this paper, we develop a new dynamic routing table algorithm. The proposed data structure consists of a collection of balanced binary search trees. The search, insertion, and deletion operations can be finished in O(log N) time, where N is the number of prefixes in a routing table. Comparing with the best existing dynamic routing table algorithm, PBOB (Prefix Binary tree On Binary tree), our experiment results using the real routing tables show that the proposed scheme performs better than PBOB in terms of the lookup speed, insertion time, deletion time, and memory requirement.

主出版物標題Information Networking
主出版物子標題Advances in Data Communications and Wireless Networks - International Conference, ICOIN 2006. Revised Selected Papers
發行者Springer Verlag
ISBN(列印)3540485635, 9783540485636
出版狀態Published - 2006 一月 1
事件International Conference on Information Networking, ICOIN 2006 - Sendai, Japan
持續時間: 2006 一月 162006 一月 19


名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3961 LNCS


OtherInternational Conference on Information Networking, ICOIN 2006

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

指紋 深入研究「Dynamic routing tables using simple balanced search trees」主題。共同形成了獨特的指紋。