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...

ver descrição completa

Detalhes bibliográficos

Publicado no:	Computer communication review. 33, 4 (2003).
Autor principal:	Dharmapurikar, Sarang
Formato:	Artigo
Idioma:	English
Assuntos:	Computer systems organization. Computer communication networks. Internetworking. Routers. Algorithms. Design. Performance.