Name
Abstract | ||
|---|---|---|
Identifying network anomalies is an important measure to ensure reliability and quality of data transfers among facilities. Scientific workflows in particular heavily rely on good network performance to ensure their smooth executions. In this paper, we present a lightweight classifier system that is able to recognize anomalous TCP transfers. Using random forest trees and labeled data sets, we evaluate the classifier with real workflow transfers for ground truth data. Our studies reveal that various TCP congestion algorithms behave differently in anomalous conditions. We show that training classifiers on these separately can aid detection in network performance deterioration. Results reveal that our classifiers are able to better predict anomalous flows for TCP Reno and Hamilton compared to Cubic and BBR, due to the manner how their congestion control algorithms handle the anomalies. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/INDIS49552.2019.00012 | 2019 IEEE/ACM Innovating the Network for Data-Intensive Science (INDIS) |
Keywords | Field | DocType |
TCP-congestion-algorithms,Cubic,Reno,Hamilton,BBR,Random-forest-tree-classification | Data mining,Computer science,Congestion control algorithm,Ground truth,Labeled data,Classifier (linguistics),Random forest,Workflow,TCP congestion-avoidance algorithm,Network performance | Conference |
ISBN | Citations | PageRank |
978-1-7281-5974-4 | 1 | 0.37 |
References | Authors | |
32 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| George Papadimitriou | 1 | 4 | 4.19 |
| Mariam Kiran | 2 | 121 | 17.83 |
| Cong Wang | 3 | 3 | 2.13 |
| Anirban Mandal | 4 | 550 | 40.69 |
| Ewa Deelman | 5 | 5948 | 420.48 |