ACM Home Page
Please provide us with feedback. Feedback
Automatically inferring patterns of resource consumption in network traffic
Full text PdfPdf (260 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications table of contents
Karlsruhe, Germany
SESSION: Measurement table of contents
Pages: 137 - 148  
Year of Publication: 2003
ISBN:1-58113-735-4
Authors
Cristian Estan  University of California San Diego, San Diego, CA
Stefan Savage  University of California San Diego, San Diego, CA
George Varghese  University of California San Diego, San Diego, CA
Sponsors
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 91,   Citation Count: 44
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/863955.863972
What is a DOI?

ABSTRACT

The Internet service model emphasizes flexibility -- any node can send any type of traffic at any time. While this design has allowed new applications and usage models to flourish, it also makes the job of network management significantly more challenging. This paper describes a new method of traffic characterization that automatically groups traffic into minimal clusters of conspicuous consumption. Rather than providing a static analysis specialized to capture flows, applications, or network-to-network traffic matrices, our approach dynamically produces hybrid traffic definitions that match the underlying usage. For example, rather than report five hundred small flows, or the amount of TCP traffic to port 80, or the "top ten hosts", our method might reveal that a certain percent of traffic was used by TCP connections between AOL clients and a particular group of Web servers. Similarly, our technique can be used to automatically classify new traffic patterns, such as network worms or peer-to-peer applications, without knowing the structure of such traffic a priori. We describe a series of algorithms for constructing these traffic clusters and minimizing their representation. In addition, we describe the design of our prototype system, AutoFocus and our experiences using it to discover the dominant and unusual modes of usage on several different production networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Coralreef - workload characterization. http://www.caida.org/analysis/workload/.
 
2
Ipmon - packet trace analysis. http://ipmon.sprintlabs.com/packstat/packetoverview.php.
3
4
 
5
C. Estan, S. Savage, and G. Varghese. Automatically inferring patterns of resource consumption in network traffic. Technical report CS2003-0746, UCSD.
6
 
7
A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Quicksand: Quick summary and analysis of network data. Dimacs technical report, 2001.
8
 
9
 
10
T. Hastie, R. Tibshirani, and J. Friedman. The elements of statistical learning. Springer, 2001. pages 453--479.
11
 
12
D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford, and N. Weaver. The spread of the sapphire/slammer worm. Technical report, January 2003. http://www.caida.org/outreach/papers/2003/sapphire.
 
13
Cisco netflow. http://www.cisco.com/warp/public/732/Tech/netflow.
 
14
15

CITED BY  44

Collaborative Colleagues:
Cristian Estan: colleagues
Stefan Savage: colleagues
George Varghese: colleagues