Cuckoo sampling: robust collection of flow aggregates under a fixed memory budget
Visualitza/Obre
Cuckoo Sampling Robust Collection of Flow (1011,Kb) (Accés restringit)
Sol·licita una còpia a l'autor
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
10.1109/INFCOM.2012.6195693
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/19307
Tipus de documentText en actes de congrés
Data publicació2012
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés restringit per política de l'editorial
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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
Citació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.
ISBN978-1-4673-0775-8
Versió de l'editorhttp://www2.research.att.com/~duffield/papers/1569487347.pdf
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Cuckoo Sampling Robust Collection of Flow.pdf | Cuckoo Sampling Robust Collection of Flow | 1011,Kb | Accés restringit |