Name
Abstract | ||
|---|---|---|
A modeling approach is proposed in this paper to build the bipartite fault propagation model (FPM) for Internet services. The FPM is layered as Internet services involve multiple layers. Two fault localization algorithms, MCA (Max-Covering Algorithm) and MCA+, are designed for the bipartite FPM. MCA+ is an extension of MCA, taking lost and spurious symptoms into account. Simulation results show that MCA+ achieves high detection rate, low false positive rate and has polynomial computational complexity even in the presence of lost and spurious symptoms. © 2006 IEEE. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICC.2006.254814 | ICC |
Keywords | Field | DocType |
false positive rate,quality of service,computational modeling,graph theory,neural networks,service oriented architecture,computational complexity,uncertainty,bipartite graph,fault management,algorithm design and analysis | False positive rate,Algorithm design,Polynomial,Computer science,Computer network,Quality of service,Algorithm,Fault management,Spurious relationship,Computational complexity theory,The Internet | Conference |
Volume | Issue | ISSN |
2 | null | null |
ISBN | Citations | PageRank |
1-4244-0355-3 | 5 | 0.47 |
References | Authors | |
9 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaohui Huang | 1 | 14 | 1.33 |
| Shihong Zou | 2 | 469 | 26.19 |
| Wendong Wang | 3 | 821 | 72.69 |
| Shiduan Cheng | 4 | 817 | 87.36 |