Overview
In this project we study and investigate network anomaly detection algorithms [1] [2] [3] for Internet Paths. We also develop a Decision Theoretic Approach based on our observations about the characteristics of the performance measurements statistics obtained from the IEPM-BW project.
To study and compare the algorithms we use the data sets collected by IEPM-BW spanning approximately 2 years (i.e. 2006 - 2008). The Internet paths observed were the links between Stanford Linear Accelerator Center (SLAC) and the following sites:
- San Diego Supercomputing Center (SDSC) USA,
- Oak Ridge National Laboratory (ORNL) USA,
- European Organization for Nuclear Research (CERN) Geneva, Switzerland,
- Forschungszentrum Karlsruhe (FZK) Germany,
- Deutsches Elektronen- Synchrotron (DESY) Germany and
- University of Toronto (UTORONTO) Canada.
Data Sets
The data sets used in the study may be downloaded from the links listed below. Latest performance statistics may be accessed from here.
|
Raw data |
Labeled data |
||
---|---|---|---|---|
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="f9be9234-0b73-43b2-b066-2d99074709bc"><ac:plain-text-body><![CDATA[ |
SDSC |
[csv], [xls] |
[txt] |
]]></ac:plain-text-body></ac:structured-macro> |
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="1c77c73d-aa81-4405-9a53-0a62be6a8ee9"><ac:plain-text-body><![CDATA[ |
ORNL |
[csv], [xls] |
[txt] |
]]></ac:plain-text-body></ac:structured-macro> |
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="8cffac5f-8e6a-4f76-88d5-243fdef68208"><ac:plain-text-body><![CDATA[ |
CERN |
[csv], [xls] |
[txt] |
]]></ac:plain-text-body></ac:structured-macro> |
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="956fc22f-c154-4b67-950e-fdb1a72b2ea5"><ac:plain-text-body><![CDATA[ |
FZK |
[csv], [xls] |
[txt] |
]]></ac:plain-text-body></ac:structured-macro> |
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="6a1c3ce2-da42-46d6-8de2-803282aa80a0"><ac:plain-text-body><![CDATA[ |
DESY |
[csv], [xls] |
[txt] |
]]></ac:plain-text-body></ac:structured-macro> |
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="3e26b793-1c97-46c7-b263-37e98d913893"><ac:plain-text-body><![CDATA[ |
UTORONTO |
[csv], [xls] |
[txt] |
]]></ac:plain-text-body></ac:structured-macro> |
Labeling Algorithm
The labeling algorithm is as under:
Implementations and Parameter Tuning
The source code of the implementations and the tuning of parameters is discussed below.
References
- C. Logg, L. Cottrell, and J. Navratil. Experiences in traceroute and available bandwidth change analysis. In NetT '04: Proceedings of the ACM SIGCOMM workshop on Network troubleshooting, pages 247-252. ACM, 2004.
- A. Soule, K. Salamatian, and N. Taft. Combining filtering and statistical methods for anomaly detection. In Internet Measurement Conference (IMC 2005), pages 331-344. USENIX, 2005.
- H. Hajji. Statistical analysis of network traffic for adaptive faults detection. In IEEE Transactions on Neural Networks, pages 1053-1063, 2005.