ACM Home Page
Please provide us with feedback. Feedback
A generic language for application-specific flow sampling
Full text PdfPdf (1.78 MB)
Source
ACM SIGCOMM Computer Communication Review archive
Volume 38 ,  Issue 2  (April 2008) table of contents
SESSION: Reviewed articles table of contents
Pages 5-16  
Year of Publication: 2008
ISSN:0146-4833
Authors
Harsha V. Madhyastha  University of Washington
Balachander Krishnamurthy  AT&T Labs--Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 97,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1355734.1355736
What is a DOI?

ABSTRACT

Flow records gathered by routers provide valuable coarse-granularity traffic information for several measurement-related network applications. However, due to high volumes of traffic, flow records need to be sampled before they are gathered. Current techniques for producing sampled flow records are either focused on selecting flows from which statistical estimates of traffic volume can be inferred, or have simplistic models for applications. Such sampled flow records are not suitable for many applications with more specific needs, such as ones that make decisions across flows

As a first step towards tailoring the sampling algorithm to an application's needs, we design a generic language in which any particular application can express the classes of traffic of its interest. Our evaluation investigates the expressive power of our language, and whether flow records have sufficient information to enable sampling of records of relevance to applications. We use templates written in our custom language to instrument sampling tailored to three different applications--BLINC, Snort, and Bro. Our study, based on month-long datasets gathered at two different network locations, shows that by learning local traffic characteristics we can sample relevant flow records near-optimally with low false negatives in diverse applications


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
Flexible Netflow. http://www.cisco.com/en/US/products/ps6965/products_ios_protocol_option_home.html.
 
2
Netflow input filters. http://www.cisco.com/en/US/products/sw/iosswrel/ps5207/products_feature_guide09186a00801d3108.html.
3
 
4
C. Cranor, T. Johnson, O. Spatscheck, and V. Shkapenyuk. Gigascope: A stream database for network applications. In IMC, 2003.
5
 
6
 
7
N. Duffield. Sampling for passive Internet measurement: A review. Statistical Science, 19(3):472¿498, 2004.
 
8
N. Duffield. A framework for packet selection and reporting, 2007. IETF draft: psamp-framework-11.
9
10
11
 
12
N. Duffield, C. Lund, and M. Thorup. Learn more, sample less: Control of volume and variance in network measurement. IEEE Transactions on Information Theory, 51:1756--1775, 2005.
 
13
N. Duffield, C. Lund, and M. Thorup. Optimal combination of sampled network measurements. In IMC, 2005.
14
15
 
16
Juniper Networks. Using compound signatures to protect against complex attacks, 2004.
17
18
 
19
20
 
21
S. Kundu, S. Pal, K. Basu, and S. Das. Fast classification and estimation of Internet traffic flows. In PAM, 2007.
22
23
24
 
25
 
26
J. Reves and S. Panchen. Traffic monitoring with packet-based sampling for defense against security threats. InMon Technology Whitepaper, 2002.
27
 
28
Snort. http://www.snort.org.
29
 
30
31
32
 
33

Collaborative Colleagues:
Harsha V. Madhyastha: colleagues
Balachander Krishnamurthy: colleagues