Internet was developed as a packet data network where users and data sources (server)
with specific IP addresses interacted over a pre-established communication channel. This …

When network is undergoing problems such as congestion, scan attack, DDoS attack, etc.,
measurements are much more important than usual. In this case, traffic characteristics …

Estimating the frequency of each distinct item in data streams is a fundamental problem in
data mining. The speed of existing algorithms is not fast enough, and at the same time, some …

Approximate stream processing algorithms, such as Count-Min sketch, Space-Saving, etc.,
support numerous applications in databases, storage systems, networking, and other …

Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They
implement fast set representations to support membership queries with limited error and …

Abstract Information-centric networking (ICN) raises data objects to first class routable
entities in the network and changes the Internet paradigm from host-centric connectivity to …

Set queries are fundamental operations in computer systems and applications. This paper
addresses the fundamental problem of designing a probabilistic data structure that can …

Named Data Networking (NDN) is a recent paradigm conceived for future Internet
architectures, where communications are driven by contents instead of host addresses. To …

A Pending Interest Table (PIT) is a core component in Named Data Networking. Scalable
PIT design is challenging because it requires per-packet updates, and the names stored in …

A range filter is a data structure to answer range membership queries. Range queries are
common in modern applications, and range filters have gained rising attention for improving …