Scan statistics for the online detection of locally anomalous subgraphs
Saved in:
| Title: | Scan statistics for the online detection of locally anomalous subgraphs |
|---|---|
| Authors: | Neil, Joshua |
| Committee Members: | Storlie, Curtis; Curtis B. Storlie; Scott Vander Weil; Terran Lane; Ronald Christensen |
| Summary: | Identifying anomalies in computer networks is a challenging and complex problem. Often, anomalies occur in extremely local areas of the network. Locality is complex in this setting, since we have an underlying graph structure. To identify local anomalies, we introduce a scan statistic for data extracted from the edges of a graph over time. In the computer network setting, the data on these edges are multivariate measures of the communications between two distinct machines, over time. We describe two shapes for capturing locality in the graph: the star and the k-path. While the star shape is not new to the literature, the path shape, when used as a scan window, appears to be novel. Both of these shapes are motivated by hacker behaviors observed in real attacks. A hacker who is using a single central machine to examine other machines creates a star-shaped anomaly on the edges emanating from the central node. Paths represent traversal of a hacker through a network, using a set of machines in sequence. To identify local anomalies, these shapes are enumerated over the entire graph, over a set of sliding time windows. Local statistics in each window are compared with their historic behavior to capture anomalies within the window. These local statistics are model-based. To capture the communications between computers, we have applied two different models, observed and hidden Markov models, to each edge in the network. These models have been effective in handling various aspects of this type of data, but do not completely describe the data. Therefore, we also present ongoing work in the modeling of host-to-host communications in a computer network. Data speeds on larger networks require online detection to be nimble. We describe a full anomaly detection system, which has been applied to a corporate sized network and achieves better than real-time analysis speed. We present results on simulated data whose parameters were estimated from real network data. In addition, we present a result from our analysis of a real, corporate-sized network data set. These results are very encouraging, since the detection corresponded to exactly the type of behavior we hope to detect. |
| URL: | https://digitalrepository.unm.edu/math_etds/60 |
| Database: | OpenDissertations |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: ddu DbLabel: OpenDissertations An: ddu.oai.digitalrepository.unm.edu.math_etds.1059 AccessLevel: 6 PubType: Dissertation/ Thesis PubTypeId: dissertation PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Scan statistics for the online detection of locally anomalous subgraphs – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Neil%2C+Joshua%22">Neil, Joshua</searchLink> – Name: Author Label: Committee Members Group: Au Data: <searchLink fieldCode="CO" term="%22Storlie%2C+Curtis%22">Storlie, Curtis</searchLink>; <searchLink fieldCode="CO" term="%22Curtis+B%2E+Storlie%22">Curtis B. Storlie</searchLink>; <searchLink fieldCode="CO" term="%22Scott+Vander+Weil%22">Scott Vander Weil</searchLink>; <searchLink fieldCode="CO" term="%22Terran+Lane%22">Terran Lane</searchLink>; <searchLink fieldCode="CO" term="%22Ronald+Christensen%22">Ronald Christensen</searchLink> – Name: Abstract Label: Summary Group: Ab Data: Identifying anomalies in computer networks is a challenging and complex problem. Often, anomalies occur in extremely local areas of the network. Locality is complex in this setting, since we have an underlying graph structure. To identify local anomalies, we introduce a scan statistic for data extracted from the edges of a graph over time. In the computer network setting, the data on these edges are multivariate measures of the communications between two distinct machines, over time. We describe two shapes for capturing locality in the graph: the star and the k-path. While the star shape is not new to the literature, the path shape, when used as a scan window, appears to be novel. Both of these shapes are motivated by hacker behaviors observed in real attacks. A hacker who is using a single central machine to examine other machines creates a star-shaped anomaly on the edges emanating from the central node. Paths represent traversal of a hacker through a network, using a set of machines in sequence. To identify local anomalies, these shapes are enumerated over the entire graph, over a set of sliding time windows. Local statistics in each window are compared with their historic behavior to capture anomalies within the window. These local statistics are model-based. To capture the communications between computers, we have applied two different models, observed and hidden Markov models, to each edge in the network. These models have been effective in handling various aspects of this type of data, but do not completely describe the data. Therefore, we also present ongoing work in the modeling of host-to-host communications in a computer network. Data speeds on larger networks require online detection to be nimble. We describe a full anomaly detection system, which has been applied to a corporate sized network and achieves better than real-time analysis speed. We present results on simulated data whose parameters were estimated from real network data. In addition, we present a result from our analysis of a real, corporate-sized network data set. These results are very encouraging, since the detection corresponded to exactly the type of behavior we hope to detect. – Name: URL Label: URL Group: URL Data: <link linkTarget="URL" linkTerm="https://digitalrepository.unm.edu/math_etds/60" linkWindow="_blank">https://digitalrepository.unm.edu/math_etds/60</link> |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=ddu&AN=ddu.oai.digitalrepository.unm.edu.math_etds.1059 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English Subjects: – SubjectFull: Computer networks--Security measures--Statistical methods Type: general – SubjectFull: Computer networks--Monitoring--Statistical methods Type: general – SubjectFull: Computer security--Statistical methods. Type: general Titles: – TitleFull: Scan statistics for the online detection of locally anomalous subgraphs Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Neil, Joshua IsPartOfRelationships: – BibEntity: Dates: – D: 16 M: 09 Type: published Y: 2011 |
| ResultId | 1 |
