[go: up one dir, main page]

Guo et al., 2010 - Google Patents

False negative problem of counting bloom filter

Guo et al., 2010

View PDF
Document ID
8426329632730239551
Author
Guo D
Liu Y
Li X
Yang P
Publication year
Publication venue
IEEE transactions on knowledge and data engineering

External Links

Snippet

Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often believe that it is possible that a Bloom filter returns a false positive, but it will never return a false …
Continue reading at www.cs.iit.edu (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
    • H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
    • H04L63/1416—Event detection, e.g. attack signature detection
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
    • H04L63/1441—Countermeasures against malicious traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/26—Monitoring arrangements; Testing arrangements
    • H04L12/2602—Monitoring arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup or address filtering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Guo et al. False negative problem of counting bloom filter
Yang et al. HeavyKeeper: an accurate algorithm for finding Top-$ k $ elephant flows
Xiao et al. Hyper-compact virtual estimators for big network data based on register sharing
Guo et al. The dynamic bloom filters
Mun et al. New approach for efficient ip address lookup using a bloom filter in trie-based algorithms
Einziger et al. Counting with tinytable: Every bit counts!
Xiao et al. Cardinality estimation for elephant flows: A compact solution based on virtual register sharing
CN103930887B (en) The inquiry stored using raw column data collects generation
Yang et al. Diamond sketch: Accurate per-flow measurement for big streaming data
Donnet et al. Retouched bloom filters: allowing networked applications to trade off selected false positives against false negatives
Hao et al. Fast dynamic multiple-set membership testing using combinatorial bloom filters
Guo et al. Set reconciliation via counting bloom filters
Yang et al. Adaptive measurements using one elastic sketch
Shi et al. Ndn-nic: Name-based filtering on network interface card
Huang et al. Memory-efficient and flexible detection of heavy hitters in high-speed networks
Wang et al. On performance of cache policy in information-centric networking
Xiong et al. kBF: a bloom filter for key-value storage with an application on approximate state machines
Gou et al. Single hash: Use one hash function to build faster hash based data structures
Hua et al. A multi-attribute data structure with parallel bloom filters for network services
Ye et al. Ua-sketch: An accurate approach to detect heavy flow based on uninterrupted arrival
Fan et al. Pisketch: finding persistent and infrequent flows
Nayak et al. countBF: A general-purpose high accuracy and space efficient counting bloom filter
Reviriego et al. The Tandem Counting Bloom Filter-It Takes Two Counters to Tango
Xiao et al. Universal and accurate sketch for estimating heavy hitters and moments in data streams
Luo et al. A capacity-elastic cuckoo filter design for dynamic set representation