Survey and taxonomy of IP address lookup algorithms
By M. A. Ruiz-Sánchez, Ernst W. Biersack, Walid Dabbous. IEEE Network, 2001
541 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Hardware and Architecture
View Paper: https://www.semanticscholar.org/paper/27e6ce9222818ce22a51101b9138a88bed8ae769
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Brad Calder
- Timothy Sherwood
- George Varghese
- Margaret Martonosi
- David E. Taylor
- Canturk Isci
- Greg Hamerly
- Erez Perelman
In Hardware and Architecture
- Brad Calder
- Timothy Sherwood
- George Varghese
- Margaret Martonosi
- David E. Taylor
- Canturk Isci
- Greg Hamerly
- Erez Perelman
Citations in the corpus
- Deterministic memory-efficient string matching algorithms for intrusion detection (2004, background): “While on the surface the problems of IP-lookup and String Matching looks very distinct, as has been noted previously [15], [4] they are very much analogs of one another in that both are longest prefix matching problems.”
- A high throughput string matching architecture for intrusion detection and prevention (2005, unknown): “There may also be opportunities to apply our technique to well studied areas of IP lookups [22], and packet classification [16].”