메뉴 건너뛰기




Volumn 41, Issue 3, 2002, Pages 372-385

Intelligent probing: A cost-effective approach to fault diagnosis in computer networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; COMPUTER NETWORKS; COMPUTER SOFTWARE;

EID: 0036994888     PISSN: 00188670     EISSN: None     Source Type: Journal    
DOI: 10.1147/sj.413.0372     Document Type: Article
Times cited : (39)

References (29)
  • 1
    • 0013224322 scopus 로고    scopus 로고
    • EPP: A framework for measuring the end-to-end performance of distributed applications
    • IBM Academy of Technology
    • A. Frenkiel and H. Lee, "EPP: A Framework for Measuring the End-to-End Performance of Distributed Applications," Proceedings of Performance Engineering 'Best Practices' Conference, IBM Academy of Technology (1999).
    • (1999) Proceedings of Performance Engineering 'Best Practices' Conference
    • Frenkiel, A.1    Lee, H.2
  • 4
    • 85038481247 scopus 로고    scopus 로고
    • note
    • If the problems are not marginally independent, appropriate edges must be added between them.
  • 5
    • 0025401005 scopus 로고
    • The computational complexity of probabilistic inference using bayesian belief networks
    • G. F. Cooper, "The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks," Artificial Intelligence 42, Nos. 2-3, 393-405 (1990).
    • (1990) Artificial Intelligence , vol.42 , Issue.2-3 , pp. 393-405
    • Cooper, G.F.1
  • 9
    • 85038482923 scopus 로고    scopus 로고
    • A paper on the NP-hardness result is to be submitted to the NIPS (Neural Information Processing Systems) 2002 Conference to be held December 10-12, 2002
    • A paper on the NP-hardness result is to be submitted to the NIPS (Neural Information Processing Systems) 2002 Conference to be held December 10-12, 2002.
  • 11
    • 85038496910 scopus 로고    scopus 로고
    • note
    • i).
  • 13
    • 85038513563 scopus 로고    scopus 로고
    • note
    • Clearly, finding a set of probes that may actually achieve the bound, if such a set of probes exists, is a much harder task.
  • 14
    • 0023842374 scopus 로고
    • Network-based heuristics for constraint satisfaction problems
    • R. Dechter and J. Pearl, "Network-Based Heuristics for Constraint Satisfaction Problems," Artificial Intelligence 34, 1-38 (1987).
    • (1987) Artificial Intelligence , vol.34 , pp. 1-38
    • Dechter, R.1    Pearl, J.2
  • 15
    • 85038504827 scopus 로고    scopus 로고
    • note
    • p), where p is the number of "positive findings" (failed probes in our case). However, the algorithm is tailored to belief updating and cannot be used for finding MPE.
  • 19
    • 0013321066 scopus 로고    scopus 로고
    • Ph.D. thesis, University of California, Irvine, Irvine, CA
    • I. Rish, Efficient Reasoning in Graphical Models, Ph.D. thesis, University of California, Irvine, Irvine, CA (1999).
    • (1999) Efficient Reasoning in Graphical Models
    • Rish, I.1
  • 20
    • 85038491777 scopus 로고    scopus 로고
    • note
    • 21
  • 21
    • 84898964205 scopus 로고    scopus 로고
    • A revolution: Belief propagation in graphs with cycles
    • M. I. Jordan, M. J. Kearns, and S. A. Solla, Editors, MIT Press, Cambridge, MA
    • B. J. Frey and D. J. C. MacKay, "A Revolution: Belief Propagation in Graphs with Cycles," Advances in Neural Information Processing Systems, Vol. 10, M. I. Jordan, M. J. Kearns, and S. A. Solla, Editors, MIT Press, Cambridge, MA (1998).
    • (1998) Advances in Neural Information Processing Systems , vol.10
    • Frey, B.J.1    MacKay, D.J.C.2
  • 22
    • 84938017623 scopus 로고
    • On the connection assignment problem of diagnosable systems
    • December
    • F. P. Preparata, G. Metze, and R. T. Chien, "On the Connection Assignment Problem of Diagnosable Systems," IEEE Transactions on Electronic Computers 16, No. 6, 848-854 (December 1967).
    • (1967) IEEE Transactions on Electronic Computers , vol.16 , Issue.6 , pp. 848-854
    • Preparata, F.P.1    Metze, G.2    Chien, R.T.3
  • 23
    • 0016575662 scopus 로고
    • System fault diagnosis: Closure and diagnosability with repair
    • November
    • J. D. Russell and C. R. Kime, "System Fault Diagnosis: Closure and Diagnosability with Repair," IEEE Transactions on Computers C-24, No. 11, 1078-1089 (November 1975).
    • (1975) IEEE Transactions on Computers , vol.C-24 , Issue.11 , pp. 1078-1089
    • Russell, J.D.1    Kime, C.R.2
  • 29
    • 0031351694 scopus 로고    scopus 로고
    • Proactive network fault detection
    • Kobe, Japan (April 7-12)
    • C.-S. Hood and C. Ji, "Proactive Network Fault Detection," Proceedings of IEEE INFOCOM, Kobe, Japan (April 7-12, 1997), pp. 1147-1155.
    • (1997) Proceedings of IEEE INFOCOM , pp. 1147-1155
    • Hood, C.-S.1    Ji, C.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.