MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

New Directions in Traffic Measurement and Accounting (2001) [200 citations — 11 self]

by Cristian Estan ,  George Varghese
Add To MetaCart

Abstract:

Accurate network traffic measurement is required for accounting, bandwidth provisioning and detecting DoS attacks. These applications see the traffic as a collection of flows they need to measure. As link speeds and the number of flows increase, keeping a counter for each flow is too expensive (using SRAM) or slow (using DRAM). The current state-of-the-art methods (Cisco's sampled NetFlow) which log periodically sampled packets are slow, inaccurate and resource-intensive. Previous work showed that at different granularities a small number of "heavy hitters" accounts for a large share of traffic. Our paper introduces a paradigm shift for measurement by concentrating only on large flows --- those above some threshold such as 0.1% of the link capacity. We propose two novel and scalable algorithms for identifying the large flows: sample and hold and multistage filters, which take a constant number of memory references per packet and use a small amount of memory. If M is the available memory, we show analytically that the errors of our new algorithms are proportional to 1/M ; by contrast, the error of an algorithm based on classical sampling is proportional to 1/ # M , thus providing much less accuracy for the same amount of memory. We also describe further optimizations such as early removal and conservative update that further improve the accuracy of our algorithms, as measured on real traffic traces, by an order of magnitude. Our schemes allow a new form of accounting called threshold accounting in which only flows above a threshold are charged by usage while the rest are charged a fixed fee. Threshold accounting generalizes usage-based and duration based pricing.

Citations

825 Space/time trade-offs in hash coding with allowable errors – Bloom - 1970
158 New sampling-based summary statistics for improving approximate query answers – Gibbons, Matias - 1998
131 Trajectory Sampling for Direct Traffic Observation – Duffield, Grossglauser - 2001
84 Inter-As traffic patterns and their implications – Fang, Peterson - 1999
79 Charging from sampled network usage – Duffield, Lund, et al. - 2001
52 Computer Organization and Design – Hennessy, Patterson - 1998
33 Traffic Flow Measurement: Architecture – Brownlee, Mills, et al. - 1999
15 Wide-area traffic patterns and characteristics – Thomson, Miller, et al. - 1997
9 et al., “Controlling high bandwidth aggregates in the network – Mahajan - 2002
6 Public Access to the Internet, chapter Pricing the Internet – MacKie-Mason, Varian - 1995
5 et al., Deriving traffic demands for operational IP networks: methodology and experience – Feldmann - 2001
5 et al. Pricing in computer networks: Reshaping the research agenda – Shenker - 1996
4 Identifying long term high rate flows at a router – Smitha, Reddy - 2001
3 A proposal for a flexible service plan that is attractive to users and internet service providers – Altman, Chu - 2001
3 et al. Computing iceberg queries efficiently – Fang - 1998
3 NetFlow http://www.cisco.com /warp /public /732 /Tech /netflow – Cisco
1 et al. Stochastic fair blue: A queue management algorithm for enforcing fairness – Feng - 2001
1 Design of an OC-192 flow monitoring chip – Huber - 2001
1 http://www.caida.org/ analysis/ security/ code-red – Moore
1 et al. Approximate fairness through differential dropping – Pan - 2001
1 et al Rapid profiling via stratified sampling – Sastry - 2001