JP2011008629A - System for calculating time lag of computer network - Google Patents

Abstract

PROBLEM TO BE SOLVED: To derive an accurate measurement result by calculating a time lag between computers.SOLUTION: Telegrams exchanged between a pair of adjacent computers are extracted for each pair of adjacent computers, each of the telegrams is classified into a plurality of grids partitioned at fixed time intervals, and a time difference of a minimum time difference telegram with the minimum time difference between transmission time and receiving time of each telegram in each grid unit is identified as a provisional time lag in the grid. Regression analysis is performed on a combination of the provisional time lag and the transmission time of the minimum time difference telegram in each grid to calculate an equation for regulating a relation between transition of time and change in time lag. When a specific time and a type of telegram are designated from a client terminal, a path of the telegram is identified, the time is substituted to the equation of each computer constituting the path to calculate a time lag between computers at the time, and the lags of all the computers constituting the path are integrated to determine an overall time lag of the path.

Description

  The present invention relates to a computer network time lag calculation system, and in particular, eliminates the effects of system time lag between computers when measuring the performance of a system in which a series of processes are executed by the cooperative operation of a plurality of computers. Thus, the present invention relates to a technique suitable for deriving an accurate calculation result.

  FIG. 6 shows an outline of a computer network 20 in which a series of processing is executed by a plurality of computers connected to the network in cooperation. When an operation message is input from the client terminal 24, the computer A The necessary processing is executed by the program 22a, and the message X as the processing result is transmitted to the computer B. The necessary processing is executed by the program 22b of the computer B that receives the processing, and the message Y as the processing result is obtained. A state is shown in which a necessary process is executed by the program 22c of the computer C, which is transmitted to the computer C, and a message Z as a final processing result is transmitted to the external computer 26.

In the computers A to C, log data such as received message ID and received date and time, and corresponding transmission message ID and date and time are recorded in the log data storage units 28a to 28c.
On the other hand, the performance evaluation system 30 calculates the processing performance between the computers by referring to the log data of each computer.
For example, the performance of the entire computer network 20 can be measured by subtracting the reception date / time of the operation message recorded in the log data of the computer A from the transmission date / time of the message Z recorded in the log data of the computer C. Further, the processing performance in the computers A and B can be calculated by subtracting the reception date / time of the operation message recorded in the log data of the computer A from the transmission date / time of the message Y recorded in the log data of the computer B. .

However, in the case of this conventional measurement method, since it is premised on comparing date and time information stamped by different computers, the influence (inaccuracy) based on the system time shift of each computer is included in the calculation result. There was a problem of reaching.
In other words, each computer obtains the system time based on the output signal from the clock circuit mounted on the motherboard, but there is a variation in the characteristics of the elements that make up the clock circuit, so there is a shift in the system time. It cannot be avoided.
In an environment where a series of information processing is executed in milliseconds or microseconds, as in the case of an automatic execution system for stocks, even if there is a slight deviation, the calculation result of processing performance will be greatly affected. Become.

  Of course, as shown in Non-Patent Document 1, each computer is periodically accessed by a time server to correct each system time. However, in this case as well, the communication environment varies. For this reason, it is difficult to completely synchronize the system time of each computer.

Further, even if perfect synchronization is realized, it is temporary, and a shift due to variations in the elements of each computer starts to occur from the next moment and expands with time. However, extremely increasing the frequency of time adjustment using a time server not only increases the system load, but also causes the reference time axis to fluctuate frequently during processing, so it starts on the same computer. Other programs are also affected, so it cannot be adopted.
NTP server [time synchronization] / Server-Config Internet URL: http://linux.kororo.jp/cont/server/ntp.php Search date: May 1, 2009

  The present invention has been devised to solve such a conventional problem, and does not synchronize the system time of individual computers constituting a computer network, but calculates the amount of time lag between computers. However, it is intended to provide a technique capable of deriving an accurate measurement result by reflecting the amount of time lag in the performance measurement of a computer network.

  In order to achieve the above object, the computer network time lag calculation system according to claim 1 is configured such that a plurality of computers are connected, and a message inputted to one computer has other necessary depending on the type. A computer network time lag calculation system that outputs to a computer via a necessary number in order, each computer having a message processing program and a log in which history information of operations by the processing program is recorded The log data storage means, at least ID of each message, reception time and transmission time are recorded, for each pair of computers, refer to the respective log data storage means, Means for extracting messages exchanged between each other, transmission time by one computer of each message, or other compilation A means for classifying each message into a plurality of grids separated by a certain time interval based on the reception time in the data, and a message transmission from one computer and a message reception in another computer are associated with each grid unit. The means for extracting the current message, the transmission direction of each extracted message are checked, the means for selecting only one of the messages in one direction, and the time difference between the transmission time and the reception time of each selected message is calculated. A means for identifying a message having the smallest absolute value of this time difference in units of grids, a means for certifying the time difference of this minimum time difference message as a provisional time lag between both computers in the grid, and a provisional time lag for each grid A regression analysis is performed on the combination of the transmission time or the reception time of the minimum time difference message, and the relationship between the transition of time and the amount of time deviation is specified. A time offset relational expression calculating unit that calculates an equation and associates it with both computers and stores it in a predetermined storage unit, and when a specific time and type of message are specified, a route corresponding to the type of message A means for specifying, a means for obtaining an equation relating to each computer constituting the path of the electronic message with reference to the storage means, and substituting the time for each of the above equations, between a pair of computers at the time Means for calculating the amount of time lag, and means for calculating the amount of time lag between the pair of computers for all the computers constituting the route and calculating the amount of time lag for the entire route at the time. It is characterized by that. The present invention can also be applied to a computer network in which only two computers are connected. In this case, the “time lag amount between a pair of computers” and the time lag amount in the whole route obtained by “integrating all the computers constituting the route” are eventually equalized.

  The time lag calculation system for a computer network according to claim 2 is based on the system of claim 1, and the time lag relational expression calculating means further includes a provisional time lag amount for each grid and a transmission time of the minimum time difference telegram. Alternatively, after performing regression analysis on the combination with the reception time and calculating the above equation defining the relationship between the transition of time and the amount of time lag, the transmission time of the minimum time difference message of each grid is calculated in the equation. Alternatively, the process of substituting the reception time and calculating the time lag amount at the time, the process of calculating the distance between the time lag amount and the provisional time lag amount, and arranging the minimum time difference messages in descending order of the distance. , A process of discarding the uppermost predetermined number or predetermined ratio of the minimum time difference message as exceptional data, the remaining temporary time difference amount of the minimum time difference message and its transmission time Alternatively, the regression analysis is performed again on the combination with the reception time, a process for calculating an equation that defines the relationship between the transition of the time and the change in the time lag, and the equation is stored in the storage means in association with both computers. It is characterized by executing the processing.

  According to the computer network time lag calculation system according to claim 1, an equation that prescribes a relationship between a time transition and a time lag change is calculated in advance for each pair of computers constituting the computer network. When the time and type of a message are specified, the computer that automatically configures the message path is automatically identified, the amount of time deviation between each computer is calculated, and then the amount of time deviation for the entire route is calculated Therefore, by reflecting this time lag amount on the performance evaluation value, it is possible to perform accurate performance evaluation without correcting the system time of each computer.

  The time difference calculation system for a computer network according to claim 2, further comprising a mechanism in which an equation defining a relationship between a transition of time and a change in time difference is derived through a process of excluding unusual data. Therefore, it is possible to improve the accuracy of the finally calculated time lag amount.

  FIG. 1 is a block diagram showing the overall configuration of a time lag calculation system 10 for a computer network according to the present invention, which includes a time lag relational expression calculation unit 12, a calculation result storage unit 14, and a performance evaluation unit 16. The system 18 is broadly divided into a computer network 20 to be subjected to performance evaluation.

  The time lag relational expression calculation unit 12 and the performance evaluation unit 16 are realized by the CPU of the computer executing necessary processes according to the OS and a dedicated application program. The calculation result storage unit 14 is provided in the hard disk of the computer.

The computer network 20 includes a computer A loaded with a program 22a, a computer B loaded with a program 22b, and a computer C loaded with a program 22c.
When the operation message α is transmitted from the client terminal 24 to the computer network 20, a necessary process is executed by the program 22a of the computer A, and a message X as a result of the process is transmitted to the computer B. Necessary processing is executed by the program B of the computer B, and the message Y as a result of the processing is transmitted to the computer C. Necessary processing is executed by the program 22c of the computer C and receives the final processing result. Is transmitted to the external computer 26.

  When a message Z ′ as a processing result is returned from the external computer 26, a necessary process is executed by the program 22c of the computer C, and a message Y ′ as a processing result is transmitted to the computer B. Necessary processing is executed by the program 22b of the computer B, and the electronic statement X ′ as a result of the processing is transmitted to the computer A. The necessary processing is executed by the program 22a of the computer A and receives the final processing. The resulting message is sent to the client terminal 24.

  Further, in the computers A to C, data such as received message IDs and reception dates and times, transmission message IDs and transmission dates corresponding thereto are recorded in the log data storage units 28a to 28c one by one.

  For convenience of explanation, in the above description, the computer network 20 having a very simple configuration in which three computers A to C are network-connected is illustrated, but an actual computer network has a configuration in which more computers are network-connected. Usually, a plurality of programs are started on each computer. In addition, there are a plurality of electronic message transmission paths, and an optimal path is selected each time depending on the type of electronic message, the load state of the network, and the like.

  Hereinafter, a processing procedure related to the calculation of the time lag relational expression will be described with reference to the flowchart of FIG. First, the time lag relational expression calculation unit 12 acquires log data from the log data storage units 28a to 28c of each computer (S10).

  Next, the time lag relational expression calculating unit 12 extracts all messages exchanged between the pair of adjacent computers from the acquired log data (S12). Here, “a pair of adjacent computers” corresponds to a combination of computers such as “computer A and computer B” and “computer B and computer C” that exchange messages directly via a network. This “adjacent computer” is set in advance by a definition file, for example. Or when the data regarding the transmission destination server is included in the message, the transmission destination server indicated by the data is the “neighboring computer”.

  Next, the time lag relational expression calculation unit 12 classifies each message between the pair of computers into a plurality of grids at certain time intervals (for example, every 30 minutes) based on the respective transmission time or reception time. (S14).

Next, the time lag relational expression calculation unit 12 extracts a message in which a message transmission and a message reception are linked (a message in which the correspondence between the two can be confirmed) among the messages included in each grid (S16).
For example, as shown in FIG. 3 (a), when there is a record of the transmission time of the message X in the log data of the computer A, and there is a record of the reception time of the message X in the log data of the computer B, The deviation relational expression calculation unit 12 extracts the message X as “the message transmission and the message reception are linked”. The identity of “message X” in the log data of computer A and “message X” in the log data of computer B is the unique message ID (IP address + process ID + message) assigned to each message. Identifier).
Similarly, as shown in FIG. 3 (b), when there is a record of the transmission time of the message Y in the log data of the computer B, and there is a record of the reception time of the message Y in the log data of the computer C, The time lag relational expression calculating unit 12 extracts the message Y as “the message transmission and the message reception are linked”.

  Next, the time lag relational expression calculation unit 12 checks the transmission direction of each extracted message, and selects only one direction of messages as an analysis target (S18). For example, between A and B, messages in the direction “A → B” and messages in the direction “A ← B” are mixed for each grid, but only messages in the direction “A → B” are extracted as analysis targets. This is true.

Next, the time lag relational expression calculation unit 12 calculates the time difference by subtracting the transmission time from the reception time of each message (S20).
FIG. 3A illustrates that “0.000010 (seconds)” is obtained as the time difference of the message X. FIG. 3B illustrates that “0.000001 (seconds)” is obtained as the time difference of the message Y.

Next, the time lag relational expression calculation unit 12 searches for a message (hereinafter, “minimum time difference message”) in which the absolute value of the time difference is minimum in grid units, and calculates the time difference between the two computers in the grid as “provisional time”. The amount of displacement is recognized (S22).
Of course, when the capacity of the message is larger than a certain level, it takes time for the transmission itself, so it cannot be recognized that “the reception time−the transmission time = the amount of deviation of the system time”. However, in a system that requires measurement at the millisecond / microsecond level as the object of the present invention, an infinite number of small-capacity messages whose transmission time is almost zero are exchanged between a pair of computers. Since there are many cases, the “time difference” of the message having the smallest “reception time−transmission time” is tentatively recognized as the time lag amount between the two computers. In addition, if the above small-capacity messages are not often exchanged, the data required for calculating the time lag can be obtained by running a program that exchanges some small-capacity messages for measurement in parallel. Can be aligned.

Next, the time lag relational expression calculation unit 12 performs a single regression analysis based on a combination of the system time and the tentative time lag amount for all grids as (x, y) = (system time, tentative time lag amount). Then, a linear equation that defines the relationship between the transition of the system time and the change of the time lag is derived (S24).
Here, either the transmission time or the reception time of the minimum time difference message is substituted for “system time”.

  Next, the time lag relational expression calculation unit 12 calculates the distance between the provisional time lag amount and the single regression line based on the linear equation for each grid (S26). FIG. 4 is an image diagram illustrating the positional relationship between a single regression line and the value of each grid (provisional time lag amount).

Specifically, this distance is calculated by the following procedure.
(1) The transmission time or reception time of the minimum time difference telegram of each grid is substituted into the above linear equation, and the time lag amount at the time is calculated.
(2) The provisional time lag amount of each grid is subtracted from this time lag amount to obtain the difference (absolute value).
This difference corresponds to the distance between the provisional time shift amount of each grid and the single regression line.

  Next, the time lag relational expression calculating unit 12 arranges the minimum time difference messages in the descending order of the distance, and discards the minimum time difference messages of a certain upper order (for example, the upper 5%) as exceptional data (S28). The time lag relational expression calculating unit 12 can also discard the uppermost constant (for example, the upper five) minimum time difference telegrams as exceptional data.

Next, the time lag relational expression calculating unit 12 executes the single regression analysis again based on the combination of the system time (transmission time or reception time) of the remaining minimum time difference telegram and the provisional time lag amount, and the time transition and time A linear equation that defines the relationship with the change in deviation is derived (S30).
Finally, the time lag relational expression calculation unit 12 associates this linear equation with both computers and stores it in the calculation result storage unit 14 (S32).

Next, a processing procedure by the performance evaluation unit 16 will be described according to the flowchart of FIG.
First, when the performance evaluation unit 16 receives a performance evaluation request from the client terminal 24 (S40), the performance evaluation unit 16 specifies a path of a message to be subjected to the performance evaluation (S42).
For example, when a request for “processing time of a specific type of operation message α issued at 13: 01: 15.0012” is made from the client terminal 24, the performance evaluation unit 16 sets the message type and route (combination of computers). With reference to the information defining the correspondence relationship, “computer A → computer B → computer C” is recognized as a message path.

Next, the performance evaluation unit 16 acquires a linear equation between the computers included in the path (a linear equation between the computers A and B and a linear equation between the computers B and C) from the calculation result storage unit 14. (S44).
Next, the performance evaluation unit 16 refers to the log data storage units 28a to 28c of the computers A to C, receives the date and time when the corresponding operation message α is received by the computer A, and the transmission date and time of the message X that is the processing result of the computer A. The reception date and time of the message X at the computer B, the transmission date and time of the message Y as the processing result at the computer B, the reception date and time of the message Y at the computer C, and the transmission date and time of the message Z as the processing result at the computer C are acquired. (S46).
Next, the performance evaluation unit 16 calculates the first processing time by subtracting the reception date / time of the operation message α from the transmission date / time of the message Z (S48).

Next, the performance evaluation unit 16 calculates a time lag amount relating to the entire route (S50).
For this purpose, the performance evaluation unit 16 first substitutes the reception date and time of the message X into a linear equation that defines the amount of deviation between the computers A and B, and calculates the amount of time deviation between the computers A and B at that time.
Next, the performance evaluation unit 16 substitutes the reception date and time of the electronic message Y into a linear equation that defines the amount of time difference between the computers BC, and calculates the amount of time difference between the computers BC at that time.
Next, the performance evaluation unit 16 integrates the time lag amounts between the computers, and obtains the time lag amount between the computers A and C (= time lag amount of the entire route).

  Next, the performance evaluation unit 16 calculates the second processing time by subtracting the time lag amount of the entire route from the first processing time (S52). For example, when the first processing time is 1 second and the time shift amount of the entire route is +0.1 seconds, “1−0.1 = 0.9” seconds is the second processing time. Alternatively, when the first processing time is 1 second and the time shift amount of the entire route is −0.1 seconds, “1 − (− 0.1) = 1.1” seconds is the second processing time.

This second processing time is returned to the client terminal 24 as a result of the final performance evaluation (S54).
From this second processing time, since the time lag amount of the entire route is removed, it can be evaluated that the processing performance of the computer network 20 is expressed very accurately.

In the above, a very simple example in which the computer network 20 is composed of three computers A to C has been given. However, since an actual computer network has a configuration in which a large number of computers are complicatedly involved, Multiple transmission paths may be assumed.
In this case, the performance evaluation unit 16 recognizes a route with the smallest number of intervening computers as a target route, and executes a time shift amount calculation process. When there are a plurality of routes having the smallest number of intervening computers, the performance evaluation unit 16 selects one route according to a certain rule.

It is a block diagram which shows the whole structure of the time difference calculation system of the computer network which concerns on this invention. It is a flowchart which shows the process sequence which concerns on calculation of a time gap relational expression. It is explanatory drawing which shows the relationship between the record of message transmission, and the record of message reception. It is explanatory drawing which shows the positional relationship of a single regression line and the provisional time shift amount of each grid. It is a flowchart which shows the process sequence which concerns on performance evaluation. It is a block diagram which shows the method of the conventional performance evaluation with respect to a computer network.

10 Computer network time lag calculation system
12 Time offset relational expression calculator
14 Calculation result storage
16 Performance Evaluation Department
18 Performance evaluation system
20 computer network
22a-22c program
24 client terminals
26 External computer
Log data storage unit A Computer B Computer C Computer α Operation message X Message Y Message Z Message

Claims (2)

A computer network time lag calculation system in which a plurality of computers are connected, and a message input to one computer is output to the outside via the necessary number of other necessary computers in sequence according to the type. There,
Each computer includes a message processing program, and log data storage means for recording history information of operations by this processing program,
In the log data storage means, at least ID of each message, reception time and transmission time are recorded,
Means for referring to each log data storage means for each pair of computers and extracting messages exchanged between each other;
Means for classifying each message into a plurality of grids separated by a certain time interval based on a transmission time by one computer of each message or a reception time by another computer;
Means for extracting, in each grid unit, a message in which a message transmission from one computer is associated with a message reception in another computer;
Means for checking the transmission direction of each extracted message and selecting only one of the messages;
Means for calculating a time difference between the transmission time and the reception time of each selected message;
Means for identifying a message having the smallest absolute value of this time difference in units of grids, and certifying the time difference of this minimum time difference message as a provisional time lag between the computers in the grid;
Perform regression analysis on the combination of the provisional time lag amount of each grid and the transmission time or reception time of the minimum time difference message, and calculate an equation that defines the relationship between time transition and time lag amount, A time lag relational expression calculating means for associating it with both computers and storing it in a predetermined storage means;
Means for specifying a route corresponding to the type of message when a specific time and type of message are specified;
Means for referring to the storage means and obtaining an equation relating to each computer constituting the path of the message;
Means for substituting the time into each of the above equations and calculating a time lag between a pair of computers at the time;
Means for integrating the time lag between the pair of computers for all computers constituting the path, and calculating a time lag for the entire path at the time;
A time shift amount calculation system for a computer network, comprising: The time lag relational expression calculating means performs a regression analysis on the combination of the provisional time lag amount of each grid and the transmission time or reception time of the minimum time difference message, and the time transition and the time lag amount change After calculating the above equation that defines the relationship,
Substituting the transmission time or reception time of the minimum time difference message of each grid into the equation, and calculating the amount of time deviation at the time,
A process for calculating the distance between the time lag and the provisional time lag,
A process of arranging the minimum time difference messages in descending order of the distance and discarding the upper predetermined number or the predetermined ratio of the minimum time difference messages as exceptional data;
A process of performing regression analysis again on the combination of the provisional time lag amount of the remaining minimum time difference message and its transmission time or reception time, and calculating an equation that defines the relationship between the time transition and the time lag amount; ,
A process of associating this equation with both computers and storing it in the storage means;
The time difference calculation system for a computer network according to claim 1, wherein:

Images