[go: up one dir, main page]

Rajeev et al., 2005 - Google Patents

Modified Bloom filter for efficient congestion control in wireless DiffServ networks

Rajeev et al., 2005

Document ID
10316036648768877791
Author
Rajeev S
Sivanandam S
Sreenaath K
Publication year
Publication venue
2005 IEEE International Conference on Personal Wireless Communications, 2005. ICPWC 2005.

External Links

Snippet

A Bloom filter is a simple space efficient data structure for representing a set in order to support membership queries. Conventional Bloom filters perform poorly in conditions where both time efficiency and accuracy are critical. In this paper we introduce the use of the …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • 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
    • H04L69/00—Application independent communication protocol aspects or techniques in packet data networks
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—High level architectural aspects of 7-layer open systems interconnection [OSI] type protocol stacks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L29/00—Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/00 - H04L27/00 contains provisionally no documents
    • H04L29/02—Communication control; Communication processing contains provisionally no documents
    • H04L29/06—Communication control; Communication processing contains provisionally no documents characterised by a protocol
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication

Similar Documents

Publication Publication Date Title
Song et al. Fast hash table lookup using extended bloom filter: an aid to network processing
Datar et al. Estimating rarity and similarity over data stream windows
Lakshman et al. High-speed policy-based packet forwarding using efficient multi-dimensional range matching
Apostolopoulos et al. QoS routing mechanisms and OSPF extensions
US7870200B2 (en) Monitoring the flow of messages received at a server
US8212695B2 (en) Generating a log-log hash-based hierarchical data structure associated with a plurality of known arbitrary-length bit strings used for detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit strings
US7149801B2 (en) Memory bound functions for spam deterrence and the like
US6735670B1 (en) Forwarding table incorporating hash table and content addressable memory
EP1365556B1 (en) Method and apparatus for efficiently matching responses to requests previously passed by a network node
US8453240B2 (en) System for efficiently handling cryptographic messages containing nonce values in a wireless connectionless environment without comprising security
US7669241B2 (en) Streaming algorithms for robust, real-time detection of DDoS attacks
US7868792B2 (en) Generating a boundary hash-based hierarchical data structure associated with a plurality of known arbitrary-length bit strings and using the generated hierarchical data structure for detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit springs
CN1965306A (en) High-performance network content analysis platform
Suri et al. Range counting over multidimensional data streams
US20070211647A1 (en) Method and apparatus for payload-based flow estimation
US10681007B2 (en) String search and matching for gate functionality
Hua et al. A multi-attribute data structure with parallel bloom filters for network services
US8195710B2 (en) Method for summarizing data in unaggregated data streams
Goldstein et al. Network characteristics of blockchain technology of on board communication
Lu et al. Bloom filters: Design innovations and novel applications
Hao et al. Fast multiset membership testing using combinatorial bloom filters
Hu et al. Verifying spatial queries using voronoi neighbors
Liben-Nowell et al. Finding longest increasing and common subsequences in streaming data
Ficara et al. Enhancing counting Bloom filters through Huffman-coded multilayer structures
Rajeev et al. Modified Bloom filter for efficient congestion control in wireless DiffServ networks