Scalable IP routing lookup in next generation network

Chia Tai Chan*, Pi Chung Wang, Shuo Cheng Hu, Chung Liang Lee, Rong Chang Chen

*此作品的通信作者

研究成果: Chapter同行評審

1 引文 斯高帕斯(Scopus)

摘要

Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O(1) time without considering the number of prefixes and its lengths. As compared to the software-based solutions, the Ternary content-addressable memory can offer sustained throughput and simple system architecture. It is attractive for IPv6 routing lookup. However, it also comes with several shortcomings, such as the limited number of entries, expansive cost and power consumption. Accordingly, we propose an efficient algorithm to reduce the required size of Ternary content-addressable memory. The proposed scheme can eliminate 98 percentage of Ternary content-addressable memory entries by adding tiny DRAM. We also address related issues in supporting IPv6 anycasting.

原文English
主出版物標題Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
編輯Hyun-Kook Kahng
發行者Springer Verlag
頁面46-55
頁數10
ISBN(電子)3540408274, 9783540408277
DOIs
出版狀態Published - 2003

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2662
ISSN(列印)0302-9743
ISSN(電子)1611-3349

指紋

深入研究「Scalable IP routing lookup in next generation network」主題。共同形成了獨特的指紋。

引用此