A heuristic and hybrid hash-based approach to fast lookup

Authors:
Gianni Antichi;Andrea Di Pietro;Domenico Ficara;Stefano Giordano;Gregorio Procissi;Fabio Vitucci
Affiliations:
Dept. of Information Engineering, University of Pisa, Italy;Dept. of Information Engineering, University of Pisa, Italy;Dept. of Information Engineering, University of Pisa, Italy;Dept. of Information Engineering, University of Pisa, Italy;Dept. of Information Engineering, University of Pisa, Italy;Dept. of Information Engineering, University of Pisa, Italy
Venue:
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Year:
2009

Citing 10
Cited 0

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
High-speed policy-based packet forwarding using efficient multi-dimensional range matching

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Summary cache: a scalable wide-area Web cache sharing protocol

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Introduction to Algorithms

Introduction to Algorithms
IP Lookup By Binary Search On Prefix Length

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Longest prefix matching using bloom filters

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Packet classification using multidimensional cutting

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

IP address lookup is a fundamental task for Internet routers. Because of the rapid growth of both traffic and links capacity, the time budget to process a packet continues to decrease and lookup tables unceasingly grow; therefore, new algorithms are required to improve lookup performance. However, the large density disparity on the prefix range within real lookup tables suggests a hybrid adaptive technique as effective and simple solution. Therefore, this paper presents a novel approach in which various prefix length ranges are represented with distinct data structures and stored in different memories. In this way, the different frequencies of forwarding rules can be taken in account and the memory hierarchy of real platforms can be exploited. This leads to small structures to be put in fast memory for the most dense ranges and larger structures (with a lower number of accesses) in the slower memories for the other ranges. The results remark the low number of off-chip memory accesses of our scheme and a valuable speedup.