Survey and taxonomy of IP address lookup algorithms

MÁ Ruiz-Sánchez, EW Biersack, W Dabbous - IEEE network, 2001 - ieeexplore.ieee.org
Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per
second are commonly deployed. To handle gigabit-per-second traffic rates, the backbone …

Fast and scalable layer four switching

V Srinivasan, G Varghese, S Suri… - Proceedings of the ACM …, 1998 - dl.acm.org
In Layer Four switching, the route and resources allocated to a packet are determined by the
destination address as well as other header fields of the packet such as source address …

Packet classification on multiple fields

P Gupta, N McKeown - Proceedings of the conference on Applications …, 1999 - dl.acm.org
Routers classify packets to determine which flow they belong to, and to decide what service
they should receive. Classification may, in general, be based on an arbitrary number of …

IP-address lookup using LC-tries

S Nilsson, G Karlsson - IEEE Journal on selected Areas in …, 1999 - ieeexplore.ieee.org
There has been a notable interest in the organization of routing information to enable fast
lookup of IP addresses. The interest is primarily motivated by the goal of building …

Tradeoffs for packet classification

A Feldman, S Muthukrishnan - Proceedings IEEE INFOCOM …, 2000 - ieeexplore.ieee.org
We present an algorithmic framework for solving the packet classification problem that
allows various access time versus memory tradeoffs. It reduces the multidimensional packet …

[SÁCH][B] Handbook of data structures and applications

DP Mehta, S Sahni - 2004 - taylorfrancis.com
Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Longest prefix matching using bloom filters

S Dharmapurikar, P Krishnamurthy… - Proceedings of the 2003 …, 2003 - dl.acm.org
We introduce the first algorithm that we are aware of to employ Bloom filters for Longest
Prefix Matching (LPM). The algorithm performs parallel queries on Bloom filters, an efficient …

Fast address lookups using controlled prefix expansion

V Srinivasan, G Varghese - ACM Transactions on Computer Systems …, 1999 - dl.acm.org
Internet (IP) address lookup is a major bottleneck in high-performance routers. IP address
lookup is challenging because it requires a longest matching prefix lookup. It is …

Tree bitmap: hardware/software IP lookups with incremental updates

W Eatherton, G Varghese, Z Dittia - ACM SIGCOMM Computer …, 2004 - dl.acm.org
Even with the significant focus on IP address lookup in the published literature as well as
focus on this market by commercial semiconductor vendors, there is still a challenge for …

[SÁCH][B] Network Algorithmics: an interdisciplinary approach to designing fast networked devices

G Varghese, J Xu - 2022 - books.google.com
Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices,
Second Edition takes an interdisciplinary approach to applying principles for efficient …