High-performance IP forwarding with efficient routing-table update

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

*此作品的通信作者

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

There has been an extensive study in constructing the routing tables during the past few years. Although the existing works have certain advantages, those approaches either use complicated data structures which result in large storage requirement and high complexity for updating/building the forwarding table or they are not scalable to fit in Internet protocol version 6 (IPv6). In this work, we propose a fast forwarding-table construction algorithm. With the modified multiway search tree, we can further reduce the depth of the tree and eliminate the storage for pointers. It leads to reduce the FT size and shorten the routing-table lookup time. While considering the route flaps, the forwarding performance will degrade by only 3.1% with 4000 BGP updates per 30 s in the worst case. Moreover, it is simple enough to fulfill the need of the fast packet forwarding. An extension approach to solve the IPv6 routing lookup is also presented for the future deployment.

原文English
頁(從 - 到)1681-1692
頁數12
期刊Computer Communications
26
發行號14
DOIs
出版狀態Published - 1 9月 2003

指紋

深入研究「High-performance IP forwarding with efficient routing-table update」主題。共同形成了獨特的指紋。

引用此