Accelerating Computation Bounded IP Lookup Methods by Adding Simple Instructions

Most of software-based IP lookup methods are memory bounded so their speed depends on memory technology. However, some of them are computation bounded, meaning that their memory time is less than computation. In this paper, we present general ideas to ask simple supports from hardware to accelerate an IP lookup method and as our main case we show that IP Lookup using DMP-Tree data structure is computation bounded and we accelerate this method by adding simple instructions to the running processor. We present hardware implementation of new instructions and resulted IP lookup speed.

[1]  Sartaj Sahni,et al.  Efficient construction of variable-stride multibit tries for IP lookup , 2002, Proceedings 2002 Symposium on Applications and the Internet (SAINT 2002).

[2]  Gunnar Karlsson,et al.  IP-address lookup using LC-tries , 1999, IEEE J. Sel. Areas Commun..

[3]  Tzi-cker Chiueh,et al.  High-performance IP routing table lookup using CPU caching , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Nasser Yazdani,et al.  Augmenting general purpose processors for network processing , 2003, Proceedings. 2003 IEEE International Conference on Field-Programmable Technology (FPT) (IEEE Cat. No.03EX798).

[5]  Nick McKeown,et al.  Routing lookups in hardware at memory access speeds , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[6]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[7]  Nasser Yazdani,et al.  HASIL: hardware assisted software-based IP lookup for large routing tables , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[8]  N Yazdani,et al.  FAST AND SALABLE SCHEMES FOR IP LOOKUP PROBLEM , 2000 .

[9]  Günter Karjoth,et al.  Routing on longest-matching prefixes , 1996, TNET.

[10]  Nasser Yazdani,et al.  IP lookup in software for large routing tables using DMP-tree data structure , 2003, 9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732).

[11]  Nasser Yazdani,et al.  Performing IP Lookup on Very High Line Speed , 2002, EurAsia-ICT.

[12]  Svante Carlsson,et al.  Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.

[13]  Huan Liu,et al.  Routing prefix caching in network processor design , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[14]  Butler W. Lampson,et al.  IP lookups using multiway and multicolumn search , 1999, TNET.

[15]  Wen-Shyen E. Chen,et al.  A fast and scalable IP lookup scheme for high-speed networks , 1999, IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243).

[16]  Bernhard Plattner,et al.  Scalable high speed IP routing lookups , 1997, SIGCOMM '97.