Method and system for managing performance data about a network

• US 6,993,578 B1
• Filed: 12/08/1999
• Issued: 01/31/2006
• Est. Priority Date: 12/08/1999
• Status: Expired due to Term

• Current Assignee: Keysight Technologies Singapore (Holdings) Pte. Limited. (Keysight Technologies, Inc.)
• Original Assignee: Agilent Technologies, Inc.
• Inventors: Dmitroca, Robert Walter
• Primary Examiner(s): Caldwell, Andrew
• Assistant Examiner(s): WILLETT, STEPHAN F
• Application Number:
  US09/456,603
• Time in Patent Office: 2,246 Days
• Field of Search: 709/224, 709/318, 702/57, 702/108, 702/111, 702/120, 702/189, 707/100, 707/101, 707/102, 707/500.1, 707/504, 707/508, 707/516, 345/660, 345/736, 345/745, 345/746, 345/866
• US Class Current: 709/224
• CPC Class Codes: H04L 43/045 for graphical visualisation of monitoring data
• CPC Class Codes: H04L 43/087 Jitter

Abstract

The inventive mechanism manages packet delay values that a network incurs in transported data packets. The mechanism uses a plurality of bins for maintaining the number of times that delay values fall within the range of a particular bin. The mechanism also uses a storage array for maintaining delay values that do not fall with the range of the bins. For each delay value that is received, the mechanism determines whether the delay value falls within the bin range. If so, the mechanism increments the number of a particular bin into which the delay value falls within. If not, the mechanism stores the delay value in the storage array and effectively doubles the size of the range of the bins. The mechanism will then effectively re-slot the values into the scaled bins. This allows for the numbers in the bins to used to form graphs detailing the latency of the network for display to a user.

Claims

1. A method for managing performance data about a network for graphical display, wherein the performance data is in the form of data values, wherein method uses a plurality of bins for maintaining a count of instances that data values are within a current range, wherein each bin maintains a number of instances that data values are within a particular portion of the current range, wherein each portion has an equal size, and wherein the method further uses an array for maintaining performance data values that are not within the current range, the method comprising the steps of:

receiving a data value;

determining whether the data value is within the current range;

incrementing the number of a particular bin of the plurality of bins, if the data value is within the current range, wherein the particular bin is selected based on the data value;

storing the data value in the array, if the data value is not within the current range; and

scaling the current range and the size of the portions, if the data value is not within the current range.

2. The method of claim 1, further comprising the step of:

repeating the steps of determining, incrementing, storing and scaling for each received data value.

3. The method of claim 1, further comprising the step of:

formatting the numbers for graphical display based on the size of the portions and the current range.

4. The method of claim 3, further comprising the step of:

displaying the formatted numbers as a graph to a user.

5. The method of claim 1, wherein the network transports data packets, and the data values are latencies in transporting the data packets through the network.

6. The method of claim 1, further comprising the step of:

determining an amount of jitter that the network is incurring from the numbers of the plurality of bins.

7. The method of claim 1, further comprising the step of:

re-calculating the numbers of the plurality of bins according to the scaled size of the portions.

8. The method of claim 1, wherein the plurality of bins are one set of bins of a plurality of sets of bins, wherein each set of bins is formed from one dimension of elements of a two dimensional array, the step of scaling comprises:

incrementing an index to point to a subsequent set of bins in the two dimensional array; and

multiplying the current range and the size of the portions by a factor.

9. The method of claim 8, wherein:

the factor is 2.

10. The method of claim 8, further comprising the steps of:

receiving a subsequent data value;

determining whether the subsequent data value is within the factored range;

incrementing the number of a particular bin of the plurality of bins, if the subsequent data value is within the factored range, wherein the particular bin is selected based on the subsequent data value;

storing the subsequent data value in the array, if the subsequent data value is not within the factored range; and

scaling the factored range and the size of the factored portions, if the subsequent data value is not within the factored range.

11. The method of claim 10, further comprising the step of:

re-calculating the numbers of the plurality of bins according to the scaled size of the factored portions.

17. The system of claim 1, further comprising:

logic for re-calculating the numbers of the plurality of bins according to the scaled size of the portions.

12. A system for managing performance data about a network for graphical display, wherein the performance data is in the form of data values, wherein the system comprises:

a plurality of bins for maintaining a count of instances that data values are within a current range, wherein each bin maintains a number of instances that data values are within a particular portion of the current range, wherein each portion has an equal size;

an array for maintaining performance data values that are not within the current range;

logic for receiving a data value;

logic for determining whether the data value is within the current range;

logic for incrementing the number of a particular bin of the plurality of bins, if the data value is within the current range, wherein the particular bin is selected based on the data value;

logic for storing the data value in the array, if the data value is not within the current range; and

logic for scaling the current range and the size of the portions, if the data value is not within the current range.

13. The system of claim 12, further comprising:

logic for formatting the numbers for graphical display based on the size of the portions and the current range.

14. The system of claim 13, further comprising:

a display for presenting the formatted numbers as a graph to a user.

15. The system of claim 12, wherein the network transports data packets, and the data values are latencies in transporting the data packets through the network.

16. The system of claim 12, further comprising:

logic for determining an amount of jitter that the network is incurring from the numbers of the plurality of bins.

18. The system of claim 12, wherein the plurality of bins are one set of bins of a plurality of sets of bins, wherein each set of bins is formed from one dimension of elements of a two dimensional array, the logic for scaling comprises:

logic for incrementing an index to point to a subsequent set of bins in the two dimensional array; and

logic for multiplying the current range and the size of the portions by a factor.

19. The system of claim 18, further comprising:

logic for receiving a subsequent data value;

logic for determining whether the subsequent data value is within the factored range;

logic for incrementing the number of a particular bin of the plurality of bins, if the subsequent data value is within the factored range, wherein the particular bin is selected based on the subsequent data value;

logic for storing the subsequent data value in the array, if the subsequent data value is not within the factored range; and

logic for scaling the factored range and the size of the factored portions, if the subsequent data value is not within the factored range.

20. The system of claim 19, further comprising:

logic for re-calculating the numbers of the plurality of bins according to the scaled size of the factored portions.