NDLI: Optimized Hash Lookup for Bloom Filter Based Packet Routing

Content Provider	IEEE Xplore Digital Library
Author	Dagang Li Pei Chen
Copyright Year	2013
Description	Author affiliation: Shenzhen Grad. Sch., Peking Univ., Shenzhen, China (Dagang Li) \|\| Sch. of Electron. & Comput. Eng., Peking Univ., Shenzhen, China (Pei Chen)
Abstract	As an efficient data structure for membership testing, the Bloom filter has found wide applications in modern day data networks, including high-speed packet routing for IPbased networks as well as future data-centric networks. In packet routing, Bloom filters are mainly used to pre-process incoming routing queries so as to minimize unnecessary lookups in the main routing table, as the latter is normally stored in slow off chip memory in the form of a hash table due to its large size. In this paper an optimized hash lookup scheme is proposed to utilize the preceding Bloom filter for better forwarding performance and usability. With the help of a 'summary vector', internal hash calculations of the Bloom filter are reused in the operations of the routing table to get fast single-access table lookup. Compared with previous work, our scheme achieves improved space efficiency, less calculation overhead, more deterministic lookup performance, and simpler update procedures. The performance of our scheme is confirmed by simulations.
Starting Page	31
Ending Page	37
File Size	430353
Page Count	7
File Format	PDF
e-ISBN	9781479925100
DOI	10.1109/NBiS.2013.38
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-09-04
Publisher Place	South Korea
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Packet Routing Radiation detectors Bloom Filter Routing Educational institutions Vectors Hash Lookup System-on-chip Table lookup
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Binary search on levels using a Bloom filter for IPv6 address lookup

Fast hash table lookup using extended Bloom filter: an aid to network processing (2005)

A Hash-based scalable IP lookup using bloom and fingerprint filters (2009)

Fast hash table lookup using extended bloom filter: an aid to network processing

IP routing processing with graphic processors

An Improved Chord Based on Counting Bloom Filter and Topology-Aware Lookup

TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in Content-Centric Networking

IP routing processing with graphic processors

Optimization of the Routing Table Lookup Algorithm for IPv6

Optimized Hash Lookup for Bloom Filter Based Packet Routing

Similar Documents

Binary search on levels using a Bloom filter for IPv6 address lookup

Fast hash table lookup using extended Bloom filter: an aid to network processing (2005)

A Hash-based scalable IP lookup using bloom and fingerprint filters (2009)

Fast hash table lookup using extended bloom filter: an aid to network processing

IP routing processing with graphic processors

An Improved Chord Based on Counting Bloom Filter and Topology-Aware Lookup

TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in Content-Centric Networking

IP routing processing with graphic processors

Optimization of the Routing Table Lookup Algorithm for IPv6

Optimized Hash Lookup for Bloom Filter Based Packet Routing