Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

An Efficient If Routing Lookup by Using Routing Interval

  • Wang, Pi-Chung (Telecommunication Laboratories, Chunghwa Telecom Co., Ltd. Taipei, Taiwan, R.O.C) ;
  • Chan, Chia-Tai (Telecommunication Laboratories, Chunghwa Telecom Co., Ltd. Taipei, Taiwan, R.O.C) ;
  • Chen, Yaw-Chung (Department of Computer Science and Information Engineering, National Chiao Tung University, Taiwan, R.O.C.)
  • Published : 2001.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

Nowadays, the commonly used table lookup scheme for IP routing is based on the sc-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes hale been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based Gn BMP and significantly reduces the complexity, thus the computation cast of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.

Keywords