SYSTEM ANALYZING PROGRAM, SYSTEM ANALYZING APPARATUS, AND SYSTEM ANALYZING METHOD

• US 20100017486A1
• Filed: 05/06/2009
• Published: 01/21/2010
• Est. Priority Date: 07/16/2008
• Status: Abandoned Application

• Current Assignee: Fujitsu Limited
• Original Assignee: Fujitsu Limited
• Inventors: Yokoyama, Ken
• Application Number:
  US12/436,518
• Publication Number:
  US 20100017486A1
• Time in Patent Office: Days
• US Class Current: 709/206
• CPC Class Codes: H04L 69/18 Multiprotocol handlers, e.g. single devices capable of handling multiple protocols
• CPC Class Codes: H04L 69/26 Special purpose or proprietary protocols or architectures network applications for proprietary or special purpose networking environments H04L67/12
• CPC Class Codes: H04L 69/28 Timers or timing mechanisms used in protocols

Abstract

A system analyzing apparatus obtains a message group including a message ID, a protocol, a type, and a transmission time of messages transmitted/received in a system where a hierarchical structure of protocols is defined. The apparatus detects pairs of a request message and a response message of the same message ID from the obtained message group. The apparatus identifies a request time and a response time of each of the detected pairs. The apparatus searches for a child-layer pair that has a request time and a response time between the request time and the response time of a parent-layer pair arbitrarily selected from among the pairs and that has a protocol in a layer lower than the protocol of the parent-layer pair on the basis of the identified result. The apparatus outputs the found child-layer pair as a candidate pair having a call relationship with the parent-layer pair.

Claims

1. A computer-readable recording medium storing a system analyzing program containing instructions executed on a computer, the program causing the computer to execute:

an obtaining procedure which obtains a message data group including a message ID, a protocol, a type, and a transmission time of a message transmitted/received in a system where a hierarchical structure of protocols is defined;

a detecting procedure which detects a pair of a request message and a response message with the same message ID from the obtained message data group;

an identifying procedure which identifies a request time and a response time of each of the detected pairs;

a searching procedure which searches for a child-layer pair that has a request time and a response time between the request time and the response time of a parent-layer pair arbitrarily selected from among the pairs and that has a protocol in a layer lower than the protocol of the parent-layer pair on the basis of an identification result generated in the identifying procedure; and

an outputting procedure which outputs the found child-layer pair as a candidate pair having a call relationship with the parent-layer pair.

2. The computer-readable recording medium according to claim 1, wherein the searching procedure searches for a child-layer pair of the protocol in the layer immediately under the protocol of the parent-layer pair.

3. The computer-readable recording medium according to claim 1, the program further causing the computer to execute:

a first calculating procedure which calculates a response period from a request to a response of each parent-layer pair and each child-layer pair by using the identified request time and response time of each of the pairs; and

a second calculating procedure which calculates a processing period of a server that is a destination of a request message of the parent-layer pair on the basis of the response periods of the parent-layer pair and the child-layer pair calculated in the first calculating procedure,

wherein the outputting procedure outputs the processing period of the server calculated in the second calculating procedure.

4. The computer-readable recording medium according to claim 3, wherein, if the protocol of the child-layer pair is in the lowest layer, the outputting procedure outputs the response period of the child-layer pair as a processing period of the server that is a destination of a request message of the child-layer pair.

5. The computer-readable recording medium according to claim 3, the program further causing the computer to execute:

a counting procedure which counts the number of candidates of parent-layer pairs having a call relationship with the child-layer pair on the basis of a search result generated in the searching procedure,

wherein the second calculating procedure calculates the processing period of the server that is the destination of the request message of the parent-layer pair on the basis of the response periods of the parent-layer pair and the child-layer pair calculated in the first calculating procedure and the number of candidates counted in the counting procedure.

6. The computer-readable recording medium according to claim 5,

wherein the searching procedure repeatedly executes a searching process until there is no parent-layer pair selected from among the remaining pairs of protocols except the protocol in the lowest layer, and

wherein the counting procedure counts the number of candidates of parent-layer pairs having a call relationship with the child-layer pair on the basis of a search result generated in the searching procedure.

7. The computer-readable recording medium according to claim 1,

wherein the parent-layer pair is a pair arbitrarily selected from among the remaining pairs of protocols except the protocol in the lowest layer among the pairs.

8. The computer-readable recording medium according to claim 3,

wherein the second calculating procedure calculates an average processing period of the server by totaling processing periods of the server that is the destination of the request message of the parent-layer pair when an address in an arbitrarily designated time slot is designated for each address identified by the request message of the protocol in the highest layer, and

wherein the outputting procedure outputs the average processing period of the server calculated in the second calculating procedure.

9. The computer-readable recording medium according to claim 8,

wherein the second calculating procedure calculates an average processing period of the server by totaling the processing periods of the server that is the destination of the request message of the child-layer pair in the lowest layer if the address in the time slot is designated.

10. The computer-readable recording medium according to claim 9,

wherein the outputting procedure outputs, for each address, the processing period of the server that is the destination of the request message of the protocol in each layer from the highest layer to the lowest layer if the address is designated.

11. A system analyzing apparatus comprising:

obtaining means for obtaining a message data group including a message ID, a protocol, a type, and a transmission time of a message transmitted/received in a system where a hierarchical structure of protocols is defined;

detecting means for detecting a pair of a request message and a response message of the same message ID from the obtained message data group;

identifying means for identifying a request time and a response time of each of the detected pairs;

searching means for searching for a child-layer pair that has a request time and a response time between the request time and the response time of a parent-layer pair arbitrarily selected from among the pairs and that has a protocol in a layer lower than the protocol of the parent-layer pair on the basis of a identification result generated by the identifying means; and

outputting means for outputting the found child-layer pair as a candidate pair having a call relationship with the parent-layer pair.

12. A system analyzing method executed by a computer, the method comprising:

obtaining a message data group including a message ID, a protocol, a type, and a transmission time of a message transmitted/received in a system where a hierarchical structure of protocols is defined;

detecting pairs of a request message and a response message of the same message ID from the obtained message data group;

identifying a request time and a response time of each of the detected pairs;

searching for a child-layer pair that has a request time and a response time between the request time and the response time of a parent-layer pair arbitrarily selected from among the pairs and that has a protocol in a layer lower than the protocol of the parent-layer pair on the basis of a identification result generated in the identifying; and

outputting the found child-layer pair as a candidate pair having a call relationship with the parent-layer pair.