By Topic

A novel automated fault identification approach in computer networks based on graph theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yijiao Yu ; Central China Normal Univ., Wuhan, China ; Qin Liu ; Liansheng Tan ; Debao Xiao

In large computer network, isolation of the primary source of failure is a challenging task. In this paper, we present a novel approach of modeling network fault diagnosis. With the model based on reachable theorems, we design an automated fault identification algorithm and analyze its performance and validity named as DAFMA. To judge the consistency between the fault effect of the given failure sources and the testing one, an efficient algorithm is also proposed named as FFEAJ. DAFMA can be carried out automatically in computer because both DAFMA and FFEAJ are based on matrix and Boolean operations. Finally, to illustrate the details of DAFAM, four classical fault effects are classified and the working steps of DAFAM are described.

Published in:

Communication Technology Proceedings, 2003. ICCT 2003. International Conference on  (Volume:1 )

Date of Conference:

9-11 April 2003