ویراساینس.
سند علمی

Hash-Based Paging and Location Update Using Bloom Filters

Pars Mutaf, Claude Castelluccia

چکیده

We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal identifier field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call “false location updates” although they are not being paged. We compare the total number of paging and false location update messages with the cost of the standard paging procedure. Fortunately, the false location update probabilities can be made very small, and important bandwidth gains can be expected. The larger the size of the terminal identifier, the less probable are false location updates. Therefore, hash-based paging especially shows promise for IP paging in mobile IPv6 networks with 128-bit mobile host addresses.

اسناد مشابه

  • Fast and deterministic hash table lookup using discriminative bloom filters

    سند علمی۲۰۱۳J. Network and Computer ApplicationsKun Huang, Gaogang Xie, Rui Li, Shuai Xiong

    Hash tables are widely used in network applications, as they can achieve O(1) query, insert, and delete operations at moderate loads. However, at high loads, collisions are prevalent in the table, which increases the access time and induces non-deterministic performance. Slow rat

  • Bloom Filters via d - Left Hashing and Dynamic Bit Reassignment Extended

    سند علمی۲۰۰۶Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh

    In recent work, the authors introduced a data structure with the same functionality as a counting Bloom filter (CBF) based on fingerprints and the d-left hashing technique. This paper describes dynamic bit reassignment, an approach that allows the size of the fingerprint to flexi

  • Design and Implementation of a String Matching System for Network Intrusion Detection using FPGA-based low power multiple-hashing Bloom Filters

    سند علمی۲۰۰۹Arun M, A. Krishnan

    Modern Network Intrusion Detection Systems (NIDS) inspect the network packet payload to check if it conforms to the security policies of the given network. This process, often referred to as deep packet inspection, involves detection of predefined signature strings or keywords st

  • Hash-Based Paging and Location Update Using Bloom Filters

    مقاله‌ی دسترسی آزاد۲۰۰۴Mobile Networks and ApplicationsParsMutaf, ClaudeCastelluccia

  • Less Hashing, Same Performance: Building a Better Bloom Filter

    سند علمی۲۰۰۶Random Struct. AlgorithmsAdam Kirsch, Michael Mitzenmacher

    A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstrate that this technique can be usefully applied to Bloom filters and related data structures. Specifi

  • Bloom Filters and Locality - Sensitive Hashing

    سند علمی۲۰۱۶Kurt Mehlhorn

    This section follows 5.5.3 in Mitzenmacher/Upfal. Bloom Filters are a compact data structure for approximate membership queries. The data structure uses only linear space. It makes mistakes in the sense that non-members may be declared members with small probability. Let S = {e1,