Fishing in Poisson streams: focusing on the whales, ignoring the minnows

• Main Authors: Raginsky, Maxim, Jafarpour, Sina, Willett, Rebecca, Calderbank, Robert
• Format: Report
• Language: unknown
• Published: arXiv 2010
• Subjects: Information Theory cs.IT; FOS Computer and information sciences; Minnows; The Minnows
• Online Access: https://dx.doi.org/10.48550/arxiv.1003.2836; https://arxiv.org/abs/1003.2836

This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arrivals of packets in each flow follow a Poisson process. Assuming that the rate vector of this Poisson process is sparse or approximately sparse, the goal is to maintain a compressed summary of the process sample paths using a small number of counters, such that at any time it is possible to reconstruct both the total number of packets in each flow and the underlying rate vector. We show that these tasks can be accomplished efficiently and accurately using compressed sensing with expander graphs. In particular, the compressive counts are a linear transformation of the underlying counting process by the adjacency matrix of an unbalanced expander. Such a matrix is binary and sparse, which allows for efficient incrementing when new packets arrive. We describe, analyze, and compare two methods that can be used to estimate both the current vector of total packet counts and the underlying vector of arrival rates. : 6 pages, 6 pdf figures; invited paper to appear in CISS 2010