Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget

—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sampling rates is problematic, since worst-case resource usage is orders of magnitude higher than the average. To address this issue, adaptive schemes have been proposed in the last few years that periodically adjust packet sampling rates to network conditions. However, such proposals rely on complex algorithms and data structures of costly maintenance. As a consequence, adaptive sampling is still not widely implemented in routers. We present a novel flow sampling based measurement scheme called Cuckoo Sampling that efficiently collects per-flow aggregates, while smoothly discarding information as it exceeds the available memory. After a measurement epoch, it provides a random sample of the input flows, at a close-to-maximum rate as allowed by the available memory budget. Our proposal relies on a very simpl...

• Type: Journal
• Year: 2012
• Where: INFOCOM
• Authors: Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick G. Duffield, Ramana Rao Kompella
• Keywords: Adaptive Sampling, Algorithms And Data Structures, Communications, INFOCOM 2012, Sampling Schemes