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 …
information processing and networking costs. This survey article presents a number of …
[图书][B] Big data: Algorithms, analytics, and applications
As today's organizations are capturing exponentially larger amounts of data than ever, now
is the time for organizations to rethink how they digest that data. Through advanced …
is the time for organizations to rethink how they digest that data. Through advanced …
[图书][B] Practical cryptography: algorithms and implementations using C++
S Azad, ASK Pathan - 2014 - books.google.com
Cryptography, the science of encoding and decoding information, allows people to do online
banking, online trading, and make online purchases, without worrying that their personal …
banking, online trading, and make online purchases, without worrying that their personal …
A randomized scheme for IP lookup at wire speed on NetFPGA
Because of the rapid growth of both traffic and links capacity, the time budget to perform IP
address lookup on a packet continues to decrease and lookup tables of routers unceasingly …
address lookup on a packet continues to decrease and lookup tables of routers unceasingly …
The development status and trend of NetFPGA
J Cao, X Zheng, L Sun, J Jin - 2015 International Conference …, 2015 - ieeexplore.ieee.org
In recent years, with the rapid development of the Internet, ever increasing traffic and link-
bandwidths presented serious challenges for computer network-related research such as …
bandwidths presented serious challenges for computer network-related research such as …
A heuristic and hybrid hash-based approach to fast lookup
IP address lookup is a fundamental task for Internet routers. Because of the rapid growth of
both traffic and links capacity, the time budget to process a packet continues to decrease …
both traffic and links capacity, the time budget to process a packet continues to decrease …
Achieving perfect hashing through an improved construction of Bloom filters
A Bloom Filter is an efficient randomized data structure for membership queries on a set with
a certain known false positive probability. Bloom Filters (BFs) are very attractive for their …
a certain known false positive probability. Bloom Filters (BFs) are very attractive for their …
Streaming Algorithms for Big Data Processing on Multicore Architecture.
M Zhanikeev - 2015 - api.taylorfrancis.com
ABSTRACT is chapter brings together three topics: hash functions, Bloom lters, and the
recently emerged streaming algorithms. Hashing is the oldest of the three and is backed by …
recently emerged streaming algorithms. Hashing is the oldest of the three and is backed by …