DocumentCode
415778
Title
Diagnosing network states through intelligent probing
Author
Kirmani, E. ; Hood, C.S.
Author_Institution
Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
Volume
1
fYear
2004
fDate
23-23 April 2004
Firstpage
147
Abstract
The methodology of probing is useful in fault localization, in periodic auditing of functionality of network elements, and in measuring the overall quality of network performance. Probes resulting in binary responses have been proposed in the literature to diagnose the up or down status of network nodes. A sharp upper bound is obtained for the probability that the most probable explanation (MPE) of the network states computed on the basis of probe results does not coincide with the true network state. This upper bound supplements a lower bound available in the literature. In considering the diagnosis of a set of priority nodes, two indices are introduced to assess the reliability of the probe results in the leaky noisy-AND model. These indices are useful in deciding whether or not the result of a binary probe should be followed up, by individual testing of the priority nodes. Some problems for future research are outlined.
Keywords
auditing; belief networks; computer network management; fault diagnosis; grid computing; monitoring; performance evaluation; probability; quality of service; Bayesian networks; Grid computing; MPE; QoS; computer networks; fault localization; intelligent probing; leaky noisy-AND model; most probable explanation; network monitoring; network performance quality; network state diagnosis; periodic auditing; priority nodes; probability; sharp upper bound; Competitive intelligence; Computer network management; Computer network reliability; Computer networks; Computerized monitoring; Intelligent networks; Probes; Testing; Upper bound; Working environment noise;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Operations and Management Symposium, 2004. NOMS 2004. IEEE/IFIP
Conference_Location
Seoul, South Korea
ISSN
1542-1201
Print_ISBN
0-7803-8230-7
Type
conf
DOI
10.1109/NOMS.2004.1317651
Filename
1317651
Link To Document