ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Semi-automated discovery of application session structure
Full text PdfPdf (279 KB)
Source Internet Measurement Conference archive
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement table of contents
Rio de Janeriro, Brazil
SESSION: Tools table of contents
Pages: 119 - 132  
Year of Publication: 2006
ISBN:1-59593-561-4
Authors
Jayanthkumar Kannan  UC Berkeley, Berkeley, CA, USA
Jaeyeon Jung  Mazu Networks, Cambridge, MA, USA
Vern Paxson  International Computer Science Institute and Lawrence Berkeley National Laboratory, Berkeley, CA, USA
Can Emre Koksal  EPFL, Luasanne, Switzerland
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 51,   Citation Count: 7
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/1177080.1177096
What is a DOI?

ABSTRACT

While the problem of analyzing network traffic at the granularity of individual connections has seen considerable previous work and tool development, understanding traffic at a higher level - the structure of user-initiated sessions comprised of groups of related connections - remains much less explored. Some types of session structure, such as the coupling between an FTP control connection and the data connections it spawns, have prespecified forms, though the specifications do not guarantee how the forms appear in practice. Other types of sessions, such as a user reading email with a browser, only manifest empirically. Still other sessions might exist without us even knowing of their presence, such as a botnet zombie receiving instructions from its master and proceeding in turn to carry them out. We present algorithms rooted in the statistics of Poisson processes that can mine a large corpus of network connection logs to extract the apparent structure of application sessions embedded in the connections. Our methods are semi-automated in that we aim to present an analyst with high-quality information (expressed as regular expressions) reflecting different possible abstractions of an application's session structure. We develop and test our methods using traces from a large Internet site, finding diversity in the number of applications that manifest, their different session structures, and the presence of abnormal behavior. Our work has applications to traffic characterization and monitoring, source models for synthesizing network traffic, and anomaly detection.


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
 
2
A. Blum, D. Song, and S. Venkataraman. Detection of interactive stepping stones: Algorithms and confidence bounds. In 7th International Symposium on Recent Advances in Intrusion Detection (RAID 2004), pages 20--29, Sep 2004.
3
 
4
K. Claffy, H.-W. Braun, and G. Polyzos. A parameterizable methodology for internet traffic flow profiling. IEEE JSAC, 13(8):1481--1494, 1995.
 
5
M. Costa, J. Crowcroft, M. Castro, A. Rowstron, C. Shannon, and J. Brown. Can we contain Internet worms? In Proc. HOTNETS, 2004.
 
6
7
 
8
W. Cui, V. Paxson, N. Weaver, and R. H. Katz. Protocol-Independent Adaptive Replay of Application Dialog. In Proc. NDSS, San Deigo, CA, Feb 2006.
 
9
P. Danzig, S. Jamin, R. Caceres, D. Mitzel, and D. Estrin. "an empirical workload model for driving wide-area tcpip network simulations". Internetworking: Research and Experience, 3(1):1--26, 1992.
 
10
 
11
H. Fowler and W. Leland. Local area network traffic characteristics, with implications for broadband network congestion management. IEEE JSAC, 9(7):1139--1149, 1991.
 
12
Finite State Automata Utilities (version 6.2). http://odur.let.rug.nl/~ vannoord/Fsa/.
 
13
Graphviz - Graph Visualization Software. http://www.graphviz.org/.
 
14
S. Heimlich. Traffic characterization of the nsfnet national backbone. In Proc. Winter USENIX Conference, 1990.
 
15
R. Jain and S. Routhier. Packet trains - measurements and a new model for computer network traffic. IEEE JSAC, 4(6):986--995, 1986.
 
16
J. Kannan, J. Jung, V. Paxson, and C. E. Koksal. Detecting hidden causality in network connections. Technical report, University of California, Berkeley, 2005.
 
17
A. Kumar, V. Paxson, and N. Weaver. Exploiting underlying structure for detailed reconstruction of an internet-scale event. In Proc. ACM IMC, Oct 2005.
 
18
19
20
21
22
 
23
J. Newsome and D. Song. Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software. In Proc. NDSS, 2005.
 
24
25
 
26
27
28
 
29
 
30
TCP Ports List, UDP Ports List. http://seifried.org/security/ports.
 
31
The Protocol Informatics Project. http:www.//baselineresearch.net/PI/.
 
32
S. M. Ross. Introduction to Probability Models, 8th Edition. Academic Press, 2003.
33
 
34
S. Staniford, S. Cheung, R. Crawford, M. Dilger, J. Frank, J. Hoagland, K. Levitt, C. Wee, R. Yip, and D. Zerkle. GrIDS - A graph-based intrusion detection system for large networks. In Proc. National Information Systems Security Conference, 1996.
 
35
 
36
Timbuktu Pro Remote Control Software. http://www.netopia.com/software/productst/b2/.
37
 
38
 
39
40
41
 
42
Y. Zhang and V. Paxson. Detecting Stepping Stones. In Proc. 9th USENIX Security Symposium, Denver, CO, Aug 2000.

CITED BY  8

Collaborative Colleagues:
Jayanthkumar Kannan: colleagues
Jaeyeon Jung: colleagues
Vern Paxson: colleagues
Can Emre Koksal: colleagues