Theory and practice of bloom filters for distributed systems

S Tarkoma, CE Rothenberg… - … Surveys & Tutorials, 2011‏ - ieeexplore.ieee.org
Many network solutions and overlay networks utilize probabilistic techniques to reduce
information processing and networking costs. This survey article presents a number of …

Network applications of bloom filters: A survey

A Broder, M Mitzenmacher - Internet mathematics, 2004‏ - Taylor & Francis
A Bloom filter is a simple space-efficient randomized data structure for representing a set in
order to support membership queries. Bloom filters allow false positives but the space …

Scaling blockchains without giving up decentralization and security: A solution to the blockchain scalability trilemma

GD Monte, D Pennino, M Pizzonia - Proceedings of the 3rd Workshop on …, 2020‏ - dl.acm.org
Public blockchains should be able to scale with respect to the number of nodes and to the
transactions workload. The blockchain scalability trilemma has been informally conjectured …

Denial-of-service attacks in bloom-filter-based forwarding

M Antikainen, T Aura, M Särelä - IEEE/ACM Transactions On …, 2013‏ - ieeexplore.ieee.org
Bloom-filter-based forwarding has been suggested to solve several fundamental problems
in the current Internet, such as routing-table growth, multicast scalability issues, and denial …

A unified unicast and multicast routing and forwarding algorithm for software-defined datacenter networks

WK Jia, LC Wang - IEEE Journal on Selected Areas in …, 2013‏ - ieeexplore.ieee.org
In this article, we consider a scalability problem associated with software-defined datacenter,
of which the unicast/multicast routing states is proven to be NP-complete. We introduce an …

Towards a new generation of information-oriented internetworking architectures

C Esteve, FL Verdi, MF Magalhães - Proceedings of the 2008 ACM …, 2008‏ - dl.acm.org
In response to the limitations of the Internet architecture when used for applications for which
it was not originally designed, a series of clean slate efforts have emerged to shape the so …

Fractional-N SVRF Forwarding Algorithm for Low Port-Density Packet Forwarding Engines

WK Jia, Z ** - IEEE Networking Letters, 2021‏ - ieeexplore.ieee.org
High-performance multicast-enabled switches and routers are being constantly developed,
which use a polynomial-time group membership query algorithm within the Packet …

Caesar: High-speed and memory-efficient forwarding engine for future internet architecture

M Moradi, F Qian, Q Xu, ZM Mao… - 2015 ACM/IEEE …, 2015‏ - ieeexplore.ieee.org
In response to the critical challenges of the current Internet architecture and its protocols, a
set of so-called clean slate designs has been proposed. Common among them is an …

Scalable multicast control-plane for optical packet forwarding engines: A multiway SVRF approach

WK Jia, YC Chen, Z **, W Geng - Optical Switching and Networking, 2023‏ - Elsevier
In control-plane of optical packet forwarding engines (OPFEs), the group-membership query
algorithm determines the egress through which a packet should be forwarded. To implement …

DH-SVRF: A reconfigurable unicast/multicast forwarding for high-performance packet forwarding engines

Z **, WK Jia - IEEE Transactions on Parallel and Distributed …, 2021‏ - ieeexplore.ieee.org
High-performance multicast-enabled packet forwarding engines (PFEs), as an essential
component of high-end switches, use a polynomial-time membership query algorithm to …