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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking 2006-04, Vol.14 (2), p.397-409
Hauptverfasser:	Dharmapurikar, S., Krishnamurthy, P., Taylor, D.E.
Format:	Artikel
Sprache:	eng
Schlagworte:	Access protocols Algorithms Arrays Bloom filter computer networking Data structures Hash based algorithms Information filtering Information filters Internet Internet Protocol IP (Internet Protocol) IP lookup Longest Prefix Matching Matched filters Matching Probes Queries Routing protocols Scalability Search engines Tables (data)
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!