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

Mô tả đầy đủ

Chi tiết về thư mục
Xuất bản năm:Computer communication review. 33, 4 (2003).
Tác giả chính: Dharmapurikar, Sarang
Định dạng: Bài viết
Ngôn ngữ:English
Những chủ đề:
Computer systems organization.
Computer communication networks.
Internetworking.
Routers.
Algorithms.
Design.
Performance.