G-RCA: A Generic Root Cause Analysis Platform for Service Quality Management in Large IP Networks
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
An increasingly diverse set of applications, such as Internet games, streaming videos, e-commerce, online banking, and even mission-critical emergency call services, all relies on IP networks. In such an environment, best-effort service is no longer acceptable. This requires a transformation in network management from detecting and replacing individual faulty network elements to managing the end-to-end service quality as a whole. In this paper, we describe the design and development of a Generic Root Cause Analysis platform (G-RCA) for service quality management (SQM) in large IP networks. G-RCA contains a comprehensive service dependency model that incorporates topological and cross-layer relationships, protocol interactions, and control plane dependencies. G-RCA abstracts the root cause analysis process into signature identification for symptom and diagnostic events, temporal and spatial event correlation, and reasoning and inference logic. G-RCA provides a flexible rule specification language that allows operators to quickly customize G-RCA and provide different root cause analysis tools as new problems need to be investigated. G-RCA is also integrated with data trending, manual data exploration, and statistical correlation mining capabilities. G-RCA has proven to be a highly effective SQM platform in several different applications, and we present results regarding BGP flaps, PIM flaps in Multicast VPN service, and end-to-end throughput degradation in content delivery network (CDN) service.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Loghub supports evaluation across varied real-world logs and helps avoid overfitting to one system's logging habits [64].”
From Large language models for agentic NetOps and AIOps: Architectures, evaluation, and safety (2027) · cites this paper as [64]
In the citing paper
“In real deployments, however, this earlier promise depends on rather plain conditions: good log quality, stable parsing, manageable workload shift, and templates that do not change faster than the detector can learn them [127], [129], [64].”
From Large language models for agentic NetOps and AIOps: Architectures, evaluation, and safety (2027) · cites this paper as [64]
In the citing paper
“LogHub consolidated commonly used datasets into a shared collection, enabling more reproducible comparisons across systems and domains [64].”
From Large language models for agentic NetOps and AIOps: Architectures, evaluation, and safety (2027) · cites this paper as [64]
In the citing paper
“LogHub makes evaluation repeatable, but that does not guarantee realism [64].”
From Large language models for agentic NetOps and AIOps: Architectures, evaluation, and safety (2027) · cites this paper as [64]
Citations
Cites
An empirical study of the naive Bayes classifier
Rish, I. (2001) · Cited by 3,202
Moy, J. (1998) · doi:10.17487/rfc2328 · Cited by 972
A Border Gateway Protocol 4 (BGP-4)
(2006) · doi:10.17487/rfc4271 · Cited by 965
Globally distributed content delivery
Dilley, J., Maggs, B., Parikh, J., Prokop, H., Sitaraman, R., & Weihl, B. (2002) · IEEE Internet Computing · doi:10.1109/mic.2002.1036038 · Cited by 691
An analysis of Internet content delivery systems
Saroiu, S., Gummadi, K. P., Dunn, R. J., Gribble, S. D., & Levy, H. M. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844158 · Cited by 546
Cohen, I. L., Goldszmidt, M., Kelly, T., Symons, J., & Chase, J. S. (2004) · Operating Systems Design and Implementation · Cited by 545
Content delivery networks: Status and trends
Vakali, A., & Pallis, G. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1250586 · Cited by 472
Towards highly reliable enterprise network services via inference of multi-level dependencies
Bahl, P., Chandra, R., Greenberg, A., Kandula, S., Maltz, D. A., & Zhang, M. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282383 · Cited by 369
Streaming Pattern Discovery in Multiple Time-Series
Papadimitriou, S., Sun, J., & Faloutsos, C. (2018) · doi:10.1184/r1/6609941.v1 · Cited by 354 · cited 2×
“While CORDS [29] employs chi-squared analysis to mine correlations, SPIRIT [30] uses Principal Component Analysis.”
MethodStreaming Pattern Discovery in Multiple Time-Series
Papadimitriou, S., Sun, J., & Faloutsos, C. (2018) · doi:10.1184/r1/6609941 · Cited by 348
CORDS: automatic discovery of correlations and soft functional dependencies
Ilyas, I. F., Markl, V., Haas, P., Brown, P., & Aboulnaga, A. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007641 · Cited by 315 · cited 2×
“While CORDS [29] employs chi-squared analysis to mine correlations, SPIRIT [30] uses Principal Component Analysis.”
MethodCapturing, indexing, clustering, and retrieving system history
Cohen, I., Zhang, S., Goldszmidt, M., Symons, J., Kelly, T., & Fox, A. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095821 · Cited by 280
Dynamic syslog mining for network failure monitoring
Yamanishi, K., & Maruyama, Y. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081927 · Cited by 213 · cited 2×
“More sophisticated and computationally expensive techniques such as Hidden Markov Chain [31] and association rule mining [32], [33] have also been proposed to mine relationships among multiple-event time series.”
MethodShrink: a tool for failure diagnosis in IP networks
Kandula, S., Katabi, D., & Vasseur, J.-P. (2005) · Proceeding of the 2005 ACM SIGCOMM workshop on Mining network data - MineNet '05 · doi:10.1145/1080173.1080178 · Cited by 197 · cited 4×
“Shrink enhanced them by incorporating Bayesian network to model inaccurate measurements and SRLG information.”
BackgroundInfluentialIP Fault Localization Via Risk Modeling
Kompella, R. R., Yates, J. M., Greenberg, A. G., & Snoeren, A. C. (2005) · Cited by 183
Self-citationDetection and Localization of Network Black Holes
Kompella, R. R., Yates, J., Greenberg, A., & Snoeren, A. C. (2007) · IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications · doi:10.1109/infcom.2007.252 · Cited by 165 · cited 1×
“lower layer in large ISPs such as SCORE [27], Shrink [16], and [28].”
BackgroundSelf-citationCapturing, indexing, clustering, and retrieving system history
Cohen, I., Zhang, S., Goldszmidt, M., Symons, J., Kelly, T., & Fox, A. (2005) · Proceedings of the twentieth ACM symposium on Operating systems principles · doi:10.1145/1095810.1095821 · Cited by 161
Ensembles of Models for Automated Diagnosis of System Performance Problems
Zhang, S., Cohen, I., Goldszmidt, M., Symons, J., & Fox, A. (2005) · 2005 International Conference on Dependable Systems and Networks (DSN'05) · doi:10.1109/dsn.2005.44 · Cited by 145
OSPF monitoring: architecture, design and deployment experience
Shaikh, A., & Greenberg, A. G. (2004) · Networked Systems Design and Implementation · Cited by 109
Content Delivery Networks: State of the Art, Insights, and Imperatives
Pathan, M., Buyya, R., & Vakali, A. I. (2008) · Lecture notes in electrical engineering · doi:10.1007/978-3-540-77887-5_1 · Cited by 80
Treinen, J. J., & Thurimella, R. (2006) · Lecture notes in computer science · doi:10.1007/11856214_1 · Cited by 78
Troubleshooting chronic conditions in large IP networks
Mahimkar, A. A., Yates, J. M., Zhang⋆, Y., Shaikh, A., Wang, J., Ge, Z., & Ee, C. T. (2008) · ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) · doi:10.1145/1544012.1544014 · Cited by 66
Self-citationLe, F., Lee, S., Wong, T., Kim, H. S., & Newcomb, D. (2006) · doi:10.1145/1162678.1162681 · Cited by 52 · cited 1×
“More sophisticated and computationally expensive techniques such as Hidden Markov Chain [31] and association rule mining [32], [33] have also been proposed to mine relationships among multiple-event time series.”
MethodDarkstar: Using exploratory data mining to raise the bar on network reliability and performance
Kalmanek, C. R., Ge, I., Lee, S., Lund, C., Pei, D., Seidel, J., der Merwe, J. V., & Ates, J. (2009) · International Conference on the Design of Reliable Communication Networks (DRCN) · doi:10.1109/drcn.2009.5340032 · Cited by 32 · cited 1×
“For example, in the PIM case, domain experts use data exploratory tools [26] to manually inspect unexplained”
Self-citationUniversity Research Chair (2009) · Encyclopedia of Database Systems · doi:10.1007/978-0-387-39940-9_2280 · Cited by 24
An autonomous distributed expert system for switched network maintenance
Corn, P. A., Dube, R., McMichael, A. F., & Tsay, J. (2003) · Globecom · doi:10.1109/glocom.1988.26079 · Cited by 15 · cited 2×
“Capturing such service dependency relationships is vital for service quality management (SQM).”
BackgroundInfluential
Research works printed but not linked: 10
- 2011, SONET automatic protection switching
- 2010, Overview of multilink PPP bundle
- 2011, Overview of naive Bayes classifier
- yamahira, 1989, Integrated Network Management I
- wright, 1988, Expert Systems Applications to Telecommunications, 45
- 2011, IBM Tivoli
- 2011, HP Operations Center
- 2011, EMC Ionix platform
- joseph, 1989, Integrated Network Management I, 627
- 2011, Cisco IOS BGP command reference
Cited by
Opprentice: Towards Practical and Automatic Anomaly Detection Through Machine Learning
Liu, D., Zhao, Y., Xu, H., Sun, Y., Pei, D., Luo, J., Jing, X., & Feng, M. (2015) · Proceedings of the 2015 Internet Measurement Conference · doi:10.1145/2815675.2815679 · Cited by 252
Self-citationArgus: End-to-end service anomaly detection and localization from an ISP's point of view
Yan, H., Flavel, A., Ge, Z., Gerber, A., Dan Massey, G., Papadopoulos, C., Shah, H., & Yates, J. M. (2012) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2012.6195694 · Cited by 84
Self-citationBennacer, L., Amirat, Y., Chibani, A., Mellouk, A., & Ciavaglia, L. (2014) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2014.2321011 · Cited by 75
Understanding the Modeling of Computer Network Delays using Neural Networks
Mestres, A., Alarcón, E., Ji, Y., & Cabellos‐Aparicio, A. (2018) · doi:10.1145/3229607.3229613 · Cited by 77
“ine Learning mechanisms have been used in the field of communications, and such techniques have been used extensively in the area of traffic analysis [10], network security [11] and root-cause analysis [12]. Additionally, some works propose the use of Reinforcement Learning techniques for routing optimization [13]. In a…”
MethodCell Fault Management Using Machine Learning Techniques
Mulvey, D., Foh, C. H., Imran, M. A., & Tafazolli, R. (2019) · IEEE Access · doi:10.1109/access.2019.2938410 · Cited by 60
Metadata
- Authors
- Yan, H., Breslau, L., Ge, Z., Massey, D., Pei, D., & Yates, J.
- Affiliations
- AT&T (United States) (US)
- Colorado State University (US)
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2012-12
- Volume
- 20
- Issue
- 6
- Pages
- 1734-1747
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2216268987
- Cited by
- 72
- References
- 26
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 1 · 2023: 3 · 2022: 5 · 2021: 18 · 2020: 4 · 2019: 3 · 2018: 7 · 2017: 13 · 2016: 2 · 2015: 4 · 2014: 3 · 2013: 1 · 2012: 4
- FWCI
- 5.02
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE/ACM Transactions on Networking (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Agent-Based Network Management
- Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
- Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
- Keywords
- root cause analysis, service quality management, IP networks, event correlation, content delivery networks, network management
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
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.