Improving Bloom Filter Forwarding Architectures

Lee, HyunYong; Nakao, Akihiro

doi:10.1109/lcomm.2014.2355199

Cited by 8 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since finding the face of the longest matching name prefix in wire-speed is a challenging research issue, various lookup algorithms and data structures have been introduced. These algorithms can be categorized into three groups: (a) trie-based [14,15]; (b) hashing-based [6,16]; and (c) Bloom filter-based [14,[17][18][19].…”

Section: Forwarding In Named Data Networkingmentioning

confidence: 99%

On Sharing an FIB Table in Named Data Networking

Mun

Lim

2019

Applied Sciences

View full text Add to dashboard Cite

As a new networking paradigm, Named Data Networking (NDN) technology focuses on contents, and content names are used as identifiers for forwarding and routing, as opposed to IP addresses in the current Internet. NDN routers forward packets by looking up a Forwarding Information Base (FIB), each entry of which has a name prefix and output faces. An FIB should have the information to forward Interest packets for any contents. Hence, the size of an FIB would be excessively large in NDN routers, and the traffic for building an FIB would be significant. In order to reduce the traffic associated with building an FIB table and memory requirement for storing an FIB table, this paper proposes a new efficient method which combines the routing of network connectivity and the building of a forwarding engine using Bloom filters. We propose to share the summary of an FIB using a Bloom filter rather than to advertise each name prefix. The forwarding engine of the proposed scheme is a combination of Bloom filters, and hence the memory requirement of the forwarding can be much smaller than the regular FIB. Simulation results using ndnSIM under real network topologies show that the proposed method can achieve nearly the same performance as the conventional link state algorithm with 6-8% of the traffic for distributing the connectivity information and 5-9% of the memory consumption.

show abstract

Section: Forwarding In Named Data Networkingmentioning

confidence: 99%

On Sharing an FIB Table in Named Data Networking

Mun

Lim

2019

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…Also, these approaches only slightly decrease the FPR and do not provide scalability for arbitrary large networks. Furthermore, because the FPR still remains positive, these forwarding schemes must employ extra countermeasures against forwarding loops caused by false-positives thus further complicating the router design [15,16].…”

Section: Challenges Of Bf-forwardingmentioning

confidence: 99%

XBF: Scaling up Bloom-filter-based Source Routing

Antikainen¹,

Wang²,

Trossen³

et al. 2016

Preprint

View full text Add to dashboard Cite

A well known drawback of IP-multicast is that it requires per-group state to be stored in the routers. Bloom-filter based source-routed multicast remedies this problem by moving the state from the routers to the packets. However, a fixed sized Bloom-filter can only store a limited number of items before the false positive ratio grows too high implying scalability issues. Several proposals have tried to address these scalability issues in Bloom-filter forwarding. These proposals, however, unnecessarily increase the forwarding complexity.In this paper, we present Extensible-Bloom-filter (XBF), a new framing and forwarding solution which effectively circumvents the aforementioned drawbacks. XBF partitions a network into sub-networks that reflect the network topology and traffic patterns, and uses a separate fixed-length Bloomfilter in each of these. We formulate this partition assignment problem into a balanced edge partitioning problem, and evaluate it with simulations on realistic topologies. Our results show that XBF scales to very large networks with minimal overhead and completely eliminate the false-positives that have plagued the traditional Bloom-filter-based forwarding protocols. It furthermore integrates with SDN environments, making it highly suitable for deployments in off-the-shelf SDN-based networks.

show abstract

Constant-Weight Group Coded Bloom Filter for Multiple-Set Membership Queries

Tian

Zhao

2020

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Improving Bloom Filter Forwarding Architectures

Cited by 8 publications

References 9 publications

On Sharing an FIB Table in Named Data Networking

On Sharing an FIB Table in Named Data Networking

XBF: Scaling up Bloom-filter-based Source Routing

Constant-Weight Group Coded Bloom Filter for Multiple-Set Membership Queries

Contact Info

Product

Resources

About