Bloom filter (BF) has been widely used to support membership query, ie, to judge whether a
given element x is a member of a given set S or not. Recent years have seen a flourish …

The network users need to evaluate the alternative transmission pathways to avoid some
routing problems such as possible network attacks, data traffic, etc. in computer networks. In …

Bloom filters are a data structure for storing data in a compressed form. They offer excellent
space and time efficiency at the cost of some loss of accuracy (so-called lossy compression) …

Distributed denial of service (DDoS) flooding attacks are very harmful and difficult to prevent
due to the default-on nature of both inter-domain and intra-domain routing adopted by the …

Named Data Networking (NDN) is a novel networking approach that aims at overcoming
some of the limitations of the current Internet. In particular, NDN aims at providing better …

High-performance multicast-enabled packet forwarding engines (PFEs), as an essential
component of high-end switches, use a polynomial-time membership query algorithm to …

Abstract Information centric networking is a new concept that places emphasis on the
information items themselves rather than on where the information items are stored …

In multicast source-routing scheme, packet encodes the generated multicast tree at the
header, and can be delivered successfully by checking the encoded tree. Traditional …

In recent years, the information-centric networking (ICN) concept has been attracting
increasing attention of the research community. The aim is to overcome intrinsic …

In this study it is introduced that the structure behind a random data structure called Bloom
filter is applied to a routing scheme in a hexagonal grid in two dimensional case. The Bloom …