Name
Abstract | ||
|---|---|---|
Detecting dependencies among network services has been well-studied in previous research. These attempts at service dependency detection fall into two classes: active and passive approaches. While passive approaches suffer from high false positives, active approaches suffer from applicability problems. In this paper, we design a new application-independent active approach for detecting dependencies among services. We present a traffic watermarking approach with arbitrarily low false positives and easy applicability. We provide statistical tests for detecting watermarked flows, and we compute the false positive and false negative rates of these tests both analytically and experimentally. Furthermore, we implemented the proposed watermarking system (Rippler) in a small university lab network. We ran our system for four months and detected 38 dependencies among 54 services. Finally, we compared the efficiency of our approach against three previous systems by testing them on this real-world network data. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/INFOCOM.2014.6848158 | Toronto, ON |
Keywords | Field | DocType |
delays,electronic mail,statistical testing,telecommunication security,telecommunication traffic,watermarking,Rippler,delay injection,electronic mail,service dependency detection,statistical tests,traffic watermarking approach | Digital watermarking,Computer science,Computer network,Real-time computing,Network data,Statistical hypothesis testing,False positive paradox | Conference |
ISSN | Citations | PageRank |
0743-166X | 8 | 0.52 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ali Zand | 1 | 102 | 7.86 |
| Giovanni Vigna | 2 | 7121 | 507.72 |
| Richard A. Kemmerer | 3 | 1462 | 171.20 |
| Christopher Kruegel | 4 | 8799 | 516.05 |