2026-04-14T02:28:16Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/193072026-02-01T02:28:42Zcom_2072_1033col_2072_452950

Cuckoo sampling: robust collection of flow aggregates under a fixed memory budget Sanjuàs Cuxart, Josep Barlet Ros, Pere Duffield, Nick Kompella, Ramana Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors Universitat Politècnica de Catalunya. CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors::Trànsit de dades Computer networks Data transmission systems Adaptive sampling Adaptive scheme Complex algorithms Fixed memory budget High-speed links Network condition Orders of magnitude Packet sampling Resource usage Sampling rates Traffic mix Traffic sampling Ordinadors, Xarxes d' Dades -- Transmissió Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to hand le peak rates and extreme traffic mixes. Static selection of sam pling rates is problematic, since worst-case resource usage is or ders of magnitude higher than the average. To address this issue, adaptive schemes have been proposed in the last few years tha t periodically adjust packet sampling rates to network condi tions. However, such proposals rely on complex algorithms and data structures of costly maintenance. As a consequence, adapti ve 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 ag gre- gates, 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 simple data structure, require s few per-packet operations, has a CPU cost that is independen t of the memory budget and traffic profile, and is suitable for hardware implementation. We back the theoretical analysis of the algorithm with experiments with both synthetic and real net work traffic, and show that our algorithm requires significantly l ess resources than existing adaptive sampling schemes Peer Reviewed Postprint (published version) 2012 Conference report Sanjuas, J. [et al.]. Cuckoo sampling: robust collection of flow aggregates under a fixed memory budget. A: IEEE Conference on Computer Communications. "2012 Proceedings IEEE INFOCOM: March 25-30, 2012, Orlando, Florida, USA". Orlando, Florida: Institute of Electrical and Electronics Engineers (IEEE), 2012, p. 2751-2755. 978-1-4673-0775-8 https://hdl.handle.net/2117/19307 10.1109/INFCOM.2012.6195693 eng http://www2.research.att.com/~duffield/papers/1569487347.pdf http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Restricted access - publisher's policy Attribution-NonCommercial-NoDerivs 3.0 Spain 5 p. application/pdf Institute of Electrical and Electronics Engineers (IEEE)