DocumentCode
2332875
Title
Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow
Author
Lee, Myungjin ; Duffield, Nick ; Kompella, Ramana Rao
fYear
2010
fDate
14-19 March 2010
Firstpage
1
Lastpage
9
Abstract
The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems and hence, the aggregate behavior within a router appears normal. To address this problem, in this paper, we propose a Consistent NetFlow (CNF) architecture for measuring per-flow performance measurements within routers. CNF utilizes NetFlow architecture that already reports the first and last timestamps per-flow, and hash-based sampling for ensuring that two routers record same flows. We devise a novel Multiflow estimator that approximates the intermediate delay samples from other background flows to improve the per-flow latency estimates significantly compared to the naive estimator that only uses actual flow samples. In our experiments using real backbone traces and realistic delay models, we show that Multiflow estimator is accurate with a median relative error of less than 20% for flows of size greater than 100 packets. We also show that prior approach based on trajectory sampling performs about 2-3Ã worse.
Keywords
IP networks; computer network management; cryptography; protocols; telecommunication network routing; IP networks; SNMP counters; backbone traces; consistent NetFlow architecture; delay models; flow-specific problems; hash-based sampling; multiflow estimator; opportunistic flow-level latency estimation; per-flow latency estimation; per-flow performance measurements; routers; timestamps per-flow; trajectory sampling; Aggregates; Communications Society; Counting circuits; Delay estimation; IP networks; Inference algorithms; Probes; Protocols; Sampling methods; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM, 2010 Proceedings IEEE
Conference_Location
San Diego, CA
ISSN
0743-166X
Print_ISBN
978-1-4244-5836-3
Type
conf
DOI
10.1109/INFCOM.2010.5462044
Filename
5462044
Link To Document