Bloom filters are probabilistic data structures commonly used for approximate membership
problems in many areas of Computer Science (networking, distributed systems, databases …

Standard pattern-matching methods used for deep packet inspection and network security
can be evaded by means of TCP and IP fragmentation. To detect such attacks, intrusion …

Hash tables are used in many networking applications, such as lookup and packet
classification. But the issue of collisions resolution makes their use slow and not suitable for …

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 …

本文提出一种基于多层次结构的树形布鲁姆过滤器TBF. 多层次结构是近年来布鲁姆过滤器及
相关数据结构研究的热点. 这一结构使得多层次的存储方式得以实现, 减轻了片上存储的负担 …

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 …

Bloom filters are frequently used to to check the membership of an item in a set. However,
Bloom filters face a dilemma: the transmission bandwidth and the accuracy cannot be …

Monitoring is a matter of the greatest importance for the correct operation of current
communication networks. In spite of that, analyzing and checking out the traffic flowing over …

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 …

Over the last few years the Internet has become a pervasive network that inter-connects
billions of users and heterogeneous devices. The speed at which ser-vices mutate and the …