High-performance IP forwarding with efficient routing-table update

Authors:
Chia-Tai Chan;Pi-Chung Wang;Shuo-Cheng Hu;Chung-Liang Lee;Rong-Chang Chen
Affiliations:
Telecommunication Laboratories, Chunghwa Telecom Co., Ltd. 7F, No.11 Lane 74 Hsin Rd. Sec. 4, Taipei 106, Taiwan, ROC;Telecommunication Laboratories, Chunghwa Telecom Co., Ltd. 7F, No.11 Lane 74 Hsin Rd. Sec. 4, Taipei 106, Taiwan, ROC;Department of Information Management, Ming-Hsin University of Science and Technology, Hsinchu 304, Taiwan, ROC;Telecommunication Laboratories, Chunghwa Telecom Co., Ltd. 7F, No.11 Lane 74 Hsin Rd. Sec. 4, Taipei 106, Taiwan, ROC;Department of Logistics Engineering and Management, National Taichung Institute of Technology, Taichung 404, Taiwan, ROC
Venue:
Computer Communications
Year:
2003

Citing 9
Cited 1

Small forwarding tables for fast routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable high speed IP routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
A 50-Gb/s IP router

IEEE/ACM Transactions on Networking (TON)
Fast address lookups using controlled prefix expansion

ACM Transactions on Computer Systems (TOCS)
IP lookups using multiway and multicolumn search

IEEE/ACM Transactions on Networking (TON)
Memory-efficient state lookups with fast updates

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
IP switching and gigabit routers

IEEE Communications Magazine
Issues and trends in router design

IEEE Communications Magazine
IP-address lookup using LC-tries

IEEE Journal on Selected Areas in Communications

You can get there from here: routing in the internet

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking

Quantified Score

Hi-index	0.24

Visualization

Abstract

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.