NDLI: A Fast Bloom Filters Method in APN Filtering

Content Provider	IEEE Xplore Digital Library
Author	ZhenYu Liu ShengLi Xie Yue Lai
Copyright Year	2008
Description	Author affiliation: Sch. of Electron. & Inf. Eng., South China Univ. of Technol., Guangzhou (ZhenYu Liu; ShengLi Xie; Yue Lai)
Abstract	APN (access point name) is a valuable parameter for charge in the third generation (3G) communication. So the APN filtering check GTP protocol messages to determine if a roaming subscriber is allowed to access a specified external network which is an important function in 3G security device. The length of APN character and indefinite length matching are two difficulties for some Trie tree algorithms. Bloom filter is a fast method for approximate matching. But the LSF method of streaming data is affected by the maximum length of the characters. Too long characters may increase the matching times and reduce the matching speed. A fast APN filtering method which uses the feature of APN to partition by the character-dot is shown. The method has a two-stage structure Bloom filters (TSBF method). The first stage is to match the first string of the suffixes in the APN filtering list. The second stage is to match the whole suffixes. The realization of the APN filtering used TSBF is introduced. And the experiments show the TSBF has better performance than the LSF method.
Starting Page	145
Ending Page	150
File Size	373218
Page Count	6
File Format	PDF
ISBN	9780769534909
DOI	10.1109/PACIIA.2008.371
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-12-19
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Conferences Access protocols Information filtering Hash Industrial electronics Matched filters Bloom Filter Communication industry Electronics industry Information filters Computer industry Computational intelligence APN
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

Improving false positive in Bloom filter

Fast Bloom Filters and Their Generalization

Longest prefix matching using bloom filters

A Fast Suffix Matching Method in Network Processor

Application and Research on Weighted Bloom Filter and Bloom Filter in Web Cache

Efficient Filter Based Replication for LDAP Directories

IP Traceback Methodology Using Markov Chain and Bloom Filter in 802.16e

Bloom Filters Based on the B-tree

A modified algorithm based on the Bloom Filter

A Fast Bloom Filters Method in APN Filtering

Similar Documents

Improving false positive in Bloom filter

Fast Bloom Filters and Their Generalization

Longest prefix matching using bloom filters

A Fast Suffix Matching Method in Network Processor

Application and Research on Weighted Bloom Filter and Bloom Filter in Web Cache

Efficient Filter Based Replication for LDAP Directories

IP Traceback Methodology Using Markov Chain and Bloom Filter in 802.16e

Bloom Filters Based on the B-tree

A modified algorithm based on the Bloom Filter

A Fast Bloom Filters Method in APN Filtering