Longest prefix matching using bloom filters.

Longest prefix matching using bloom filters.

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 data structure for membership queries, in order to determine address prefix membership in sets of prefixes sorted by...

Descrizione completa

Dettagli Bibliografici
Pubblicato in:Computer communication review. 33, 4 (2003).
Autore principale: Dharmapurikar, Sarang
Natura: Articolo
Lingua:English
Soggetti:
Computer systems organization.
Computer communication networks.
Internetworking.
Routers.
Algorithms.
Design.
Performance.