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

Full description

Bibliographic Details

Published in:	Computer communication review. 33, 4 (2003).
Main Author:	Dharmapurikar, Sarang
Format:	Article
Language:	English
Subjects:	Computer systems organization. Computer communication networks. Internetworking. Routers. Algorithms. Design. Performance.