The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Towards highly reliable enterprise network services via inference of multi-level dependencies
Abstract
Localizing the sources of performance problems in large enterprise networks is extremely challenging. Dependencies are numerous, complex and inherently multi-level, spanning hardware and software components across the network and the computing infrastructure. To exploit these dependencies for fast, accurate problem localization, we introduce an Inference Graph model, which is well-adapted to user-perceptible problems rooted in conditions giving rise to both partial service degradation and hard faults. Further, we introduce the Sherlock system to discover Inference Graphs in the operational enterprise, infer critical attributes, and then leverage the result to automatically detect and localize problems. To illuminate strengths and limitations of the approach, we provide results from a prototype deployment in a large enterprise network, as well as from testbed emulations and simulations. In particular, we find that taking into account multi-level structure leads to a 30% improvement in fault localization, as compared to two-level approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1988) · Cited by 16,582
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
Loopy Belief Propagation for Approximate Inference: An Empirical Study
Murphy, K. P., Weiss, Y., & Jordan, M. I. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6725 · Cited by 1,397
InformationTheory, Inference, and Learning Algorithms
Mackay, D. J. C. (2003) · Cited by 648
Using magpie for request extraction and workload modelling
Barham, P., Donnelly, A., Isaacs, R., & Mortier, R. (2004) · Operating Systems Design and Implementation · Cited by 559
Performance debugging for distributed systems of black boxes
Aguilera, M. K., Mogul, J. C., Wiener, J. L., Reynolds, P., & Muthitacharoen, A. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945454 · Cited by 558
High speed and robust event correlation
Yemini, S. A., Kliger, S., Mozes, E., Yemini, Y., & Ohsie, D. (1996) · IEEE Communications Magazine · doi:10.1109/35.492975 · Cited by 364
Performance debugging for distributed systems of black boxes
Aguilera, M. K., Mogul, J. C., Wiener, J. L., Reynolds, P., & Muthitacharoen, A. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles · doi:10.1145/945445.945454 · Cited by 334
Path-based faliure and evolution management
Chen, M. Y., Accardi, A., Kıcıman, E., Lloyd, J., Patterson, D., Fox, A., & Brewer, E. (2004) · Networked Systems Design and Implementation · Cited by 302
Cited by
The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines
Barroso, L. A., & Hölzle, U. (2009) · Synthesis lectures on computer architecture · doi:10.2200/s00193ed1v01y200905cac006 · Cited by 1,714
Huang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D. (2011) · Proceedings of the 4th ACM workshop on Security and artificial intelligence · doi:10.1145/2046684.2046692 · Cited by 1,194
Barroso, L. A., Clidaras, J., & Hölzle, U. (2013) · Synthesis lectures on computer architecture · doi:10.2200/s00516ed2v01y201306cac024 · Cited by 489
ANTIDOTE: understanding and defending against poisoning of anomaly detectors
Rubinstein, B. I. P., Nelson, B., Huang, L., Joseph, A. D., Lau, S.-H., Rao, S., Taft, N., & Tygar, J. D. (2009) · Proceedings of the 9th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1644893.1644895 · Cited by 331
Shirazi, S. N., Gouglidis, A., Farshad, A., & Hutchison, D. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2760478 · Cited by 284
Metadata
- Authors
- Bahl, P., Chandra, R., Greenberg, A., Kandula, S., Maltz, D. A., & Zhang, M.
- Venue
- Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2007-08-27
- Pages
- 13-24
- OpenAlex
- W2127577941
- Cited by
- 369
- References
- 20
- FWCI
- 21.12
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Towards highly reliable enterprise network services via inference of multi-level dependencies. https://app.cochat.ai/papers/10.1145/1282380.1282383
- The paper
- Bahl, P., Chandra, R., Greenberg, A., Kandula, S., Maltz, D. A., & Zhang, M. (2007). Towards highly reliable enterprise network services via inference of multi-level dependencies. Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications. https://doi.org/10.1145/1282380.1282383
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.