Problem determination using probing

• US 7,167,998 B2
• Filed: 09/30/2003
• Issued: 01/23/2007
• Est. Priority Date: 09/30/2003
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Rish, Irina, Ma, Sheng, Brodie, Mark A.
• Primary Examiner(s): Iqbal; Nadeem
• Application Number:
  US10/676,244
• Publication Number:
  US 20050081082A1
• Time in Patent Office: 1,211 Days
• Field of Search: 714/4, 714/8, 714/27, 714/43, 714/37, 709/224, 709/226
• US Class Current: 714/4.1
• CPC Class Codes: H04L 43/0805 by checking availability
• CPC Class Codes: H04L 43/12 Network monitoring probes

Abstract

The deployment of probing technology for the purpose of problem determination in a server or network element is disclosed. One can actively select which probes to send in order to be able to diagnose problems which one is particularly interested in, allowing for greater flexibility and efficiency. The extra load imposed on a network by the use of probes is small, especially if the algorithms described in this disclosure are used.

Claims

1. An apparatus for diagnosing problems in multiple node networks using probing technology, the apparatus comprising:

an arrangement for determining a candidate probe set;

an arrangement for determining which problems can be diagnosed by the candidate probe set;

an arrangement for finding small probe sets which can diagnose the same problems as the candidate probe set; and

an arrangement for diagnosing problems in the multiple node network based upon a success or failure of probes in the small probe sets.

2. The apparatus according to claim 1, wherein the candidate probe set is determined by considering the routes that a probe can traverse through the network from at least one node to at least one other node in the network.

3. The apparatus according to claim 2, wherein the candidate probe set is determined by using a dependency matrix which has as many rows as the number of probes and as many columns as the number of nodes and each matrix entiy is either 1 or 0 depending an whether or not the probe passes through that node.

4. The apparatus according to claim 3, wherein which problems can be diagnosed by the candidate probe are determined by traversing the dependency matrix row-by-row and grouping nodes together if a fault in any one of them cannot be distinguished by a fault in another node in the group.

5. The apparatus according to claim 4, wherein the faults cannot be distinguished by determining if their corresponding columns in the dependency matrix are identical.

6. The apparatus according to claim 5, wherein the small probe sets which can diagnose the same problems as the candidate probe set are found using a search selected from the group consisting of exhaustive search, quick search, and greedy search.

7. The apparatus according to claim 6, wherein the exhaustive search considers in order of increasing size all possible combinations of probes such that each node has at least one probe passing through it until a set is found that can diagnose the same problems as the candidate set.

8. The apparatus according to claim 6, wherein the quick search traverses the candidate probe set row-by-row and removes probes that are not needed to diagnose the same problems as the candidate set.

9. The apparatus according to claim 6, wherein at each step of the greedy search what is believed to be the “

most informative”

of the remaining probes is added to the current probe set until the probe set diagnoses the same problems as the candidate set.

10. A method for diagnosing problems in multiple node networks using probing technology, the method comprising the steps of:

determining a candidate probe set;

determining which problems can be diagnosed by the candidate probe set;

finding small probe sets which can diagnose the same problems as the candidate probe set; and

diagnosing problems in the multiple node network based upon a success or failure of probes in the small probe sets.

11. The method according to claim 10, wherein the candidate probe set is determined by considering the routes that a probe can traverse through the network from at least one node to at least one other node in the network.

12. The method according to claim 11, wherein the candidate probe set is determined by using a dependency matrix which has as many rows as the number of probes and as many columns as the number of nodes and each matrix entry is either 1 or 0 depending on whether or not the probe passes through that node.

13. The method according to claim 12, wherein which problems can be diagnosed by the candidate probe are determined by traversing the dependency matrix row-by-row and grouping nodes together if a fault in any one of them cannot be distinguished by a fault in another node in the group.

14. The method according to claim 13, wherein the faults cannot be distinguished by determining if their corresponding columns in the dependency matrix are identical.

15. The method according to claim 14, wherein the small probe sets which can diagnose the same problems as the candidate probe set are found using a search selected from the group consisting of exhaustive search, quick search, and greedy search.

16. The method according to claim 15, wherein the exhaustive search considers in order of increasing size all possible combinations of probes such that each node has at least one probe passing through it until a set is found that can diagnose the same problems as the candidate set.

17. The method according to claim 15, wherein the quick search traverses the candidate probe set row-by-row and removes probes that are not needed to diagnose the same problems as the candidate set.

18. The method according to claim 15, wherein at each step of the greedy search what is believed to be the “

most informative”

of the remaining probes is added to the current probe set until the probe set diagnoses the same problems as the candidate set.

19. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for diagnosing problems in multiple node networks using probing technology, said method comprising the steps of:

determining a candidate probe set;

determining which problems can be diagnosed by the candidate probe set;

finding small probe sets which can diagnose the same problems as the candidate probe set; and

diagnosing problems in the multiple node network based upon a success or failure of probes in the small probe sets.