Method for implementing TopN measurements in operations support systems

• US 8,108,510 B2
• Filed: 01/28/2005
• Issued: 01/31/2012
• Est. Priority Date: 01/28/2005
• Status: Expired due to Fees

• Current Assignee: Viavi Solutions, Inc. (Lumentum Holdings Inc.)
• Original Assignee: Viavi Solutions, Inc. (Lumentum Holdings Inc.)
• Inventors: Nelson, Ellen Maureen, Votipka, Bruce, Ehike, Craig A., Neal, Scott S.
• Primary Examiner(s): Caldwell, Andrew
• Assistant Examiner(s): Pollack, Melvin H
• Application Number:
  US11/045,819
• Publication Number:
  US 20060190578A1
• Time in Patent Office: 2,559 Days
• Field of Search: 709/202, 709/203, 709/223, 709/224, 709/219, 715/772, 715/215, 715733-736, 707/10, 707/104.1, 707/752, 707/755, 707/805, 703/20, 702/80, 702/81, 702/187, 702/188
• US Class Current: 709/224
• CPC Class Codes: G06F 11/3419 by assessing time
• CPC Class Codes: G06F 11/3476 Data logging G06F11/14, G06F11/2205 take precedence
• CPC Class Codes: G06F 2201/805 Real-time
• CPC Class Codes: G06F 2201/86 Event-based monitoring
• CPC Class Codes: H04L 43/022 by sampling
• CPC Class Codes: H04L 43/045 for graphical visualisation of monitoring data
• CPC Class Codes: H04L 43/0852 Delays

Abstract

In an OSS, storing a plurality, typically less than all, of name-value pairs from a sample space and calculating a “representative” value based on values in the entire sample space. Optionally, a “remainder” value can be generated based on name-value pairs in the sample space that were not stored as part of the plurality of name-value pairs. Displays may be generated based on the top “M” name-value pairs, with “M” typically being set by the user at some number less than “M.”

Claims

1. A method of operating a computer system to characterize a network, said computer system comprising a central computer and a plurality of agents that make measurements of transactions that take place on said network, each agent operating independently of others of said agents, said method comprising:

causing each agent to make a series of measurements over a measurement time period and to store a first subset of said measurements made during said time period, wherein the first subset consists of M measurements wherein M is greater than 1,

wherein each measurement is related to said network, and

wherein each measurement in the first subset is stored as a name-value pair, and

wherein each agent compares each measurement made by that agent with a predetermined criterion to determine if that measurement is to replace one of said stored measurements;

causing each agent to calculate a remainder value that is determined by said measurements made during said measurement time period that are not included in the first subset of measurements; and

,

causing each agent to transmit said first subset of measurements and said reminder value to said central computer.

2. A method, as set forth in claim 1 wherein said agent performs said storage and transmission of said first subset of measurements and said reminder value by storing said first subset of measurements and said reminder value in a predetermined data structure and transmitting said data structure to said central computer.

3. A method, as set forth in claim 2 wherein said central computer aggregates a plurality of said predetermined data structures to generate an aggregated data structure.

4. A method, as set forth in claim 1 further comprising:

causing each agent to calculate a representative value that is determined by all of said measurements made during said time period, and to transmit said representative value to the central computer.

5. A method, as set forth in claim 1, wherein said subset is determined either by selecting only M name-value pairs with M largest values measured in said time period or by selecting only M name-value pairs with M smallest values measured in said time period.

6. A method, as set forth in claim 4, wherein said representative value is selected from the group comprising:

a largest value measured in said time period, a smallest value measured in said time period, an average of the values measured in said time period, and a sum of all the values measured in said time period.

7. A method, as set forth in claim 1, further comprising:

displaying a graphic based on a subset of said first subset of measurements.

8. A method, as set forth in claim 2 wherein said central computer intervalizes a plurality of said predetermined data structures to generate an intervalized data structure.

9. A method, as set forth in claim 1, wherein the remainder value is selected from the group comprising:

a largest of the-values measured in said time period not included in said first subset;

a smallest of the values measured in said time period not included in said first subset;

an average of the values measured in said time period not included in said first subset; and

a sum of the values measured in said time period not included in said first subset.

10. A method, as set forth in claim 1, further comprising:

creating a bar graph having at least one segmented bar with N segments representing top N values of said first subset of measurements, wherein N is less or equal to M, and at least one segment representing a first other value determined by all the measurements made during said time period other than those having the top “

M”

values.

11. A method, as set forth in claim 10, further comprising:

causing each agent to make a second series of measurements over a second time period and to store a second subset of said second series of measurements, wherein the second subset consists of M measurements,

wherein each measurement is related to said network and is characterized by a name-value pair; and

causing each agent to calculate a second other value determined by all the measurements made during said second time period other than those included in the second subset; and

wherein the step of creating a bar graph comprises creating a bar graph having at least two segmented bars with the first segmented bar representing N name-value pairs having the top N values measured in said first time period and the first other value and the second segmented bar representing N name-value pairs having the top N values measured in said second time period and the second other value, wherein N is less or equal to M.

12. An OSS system comprising a computer system running one or more software programs, said computer system comprising:

a central computer and a plurality of agents that make measurements of transactions that take place on said network, each agent operating independently of others of said agents and independently of said central computer,

wherein each agent makes a series of measurements over a time period, and forms a predetermined data structure, said data structure comprising a subset of M said measurements wherein M>

1, a representative value that is determined by all of said measurements made during said time period, and a remainder value that is determined by all of said measurements other than those in said subset,

wherein each measurement is related to said network and is characterized by a name-value pair, and

wherein each agent compares each measurement made by that agent with a predetermined criterion to determine if that measurement is to replace one of said measurements in said data structure.

13. An OSS system, as set forth in claim 12, further comprising:

a database system in which said central computer stores the data structures created by the agents.

14. An OSS system, as set forth in claim 12, further comprising:

a graphical user interface adapted to generate graphics based on the data structures formed by the agents.

15. An OSS system, as set forth in claim 14, wherein the graphical user interface generates a bar graph display with a single bar for each representative value of each data structure.

16. An OSS system, as set forth in claim 14, wherein the graphical user interface generates a bar graph for a single object data structure with a bar for each name-value pair of a subset of said predetermined subset of said measurements in said data structure, said subset including only N name-value pairs with N top values, wherein N≦

M.

17. An OSS system, as set forth in claim 16, wherein the bar graph includes a bar representative of all the values of the name-value pairs of measurements made during said time period other than those with the N top values.

18. A method of operating a computer system to characterize a network, said computer system comprising a central computer and at least one agent for making measurements of transactions that take place on said network, said method comprising:

a) causing the agent to make a series of measurements over a pre-determined time period, wherein each measurement is characterized by a name-value pair comprising a name and a value;

b) causing the agent to select top M measurements from the first series of measurements, wherein M is greater than 1 and is smaller than a total number of the measurements made by the agent during said time period, wherein the top M measurements are characterized by M name-value pairs having M largest values or M smallest values among all said measurements performed during said time period;

c) causing the agent to calculate a remainder value that is determined by all said measurements made during said time period excluding the top M measurements;

d) causing the agent to transmit to the central computer the M name-value pairs corresponding to the top M measurements and the reminder value, while not transmitting to the central computer all the measurements made during the time interval that are not included in the top M measurements; and

,

e) storing, at the central computer, a top-M data structure comprising the M name-value pairs received from the agent and the reminder value received from the agent for said time period.

19. The method of claim 18, comprising:

causing the agent to repeat steps (a)-(e) for a plurality of successive time periods, storing for each of the time periods a separate top-M data structure at the central computer to obtain a plurality of time-stamped top-M data structures; and

,

forming, at the central computer, a new top-M data structure from the plurality of time-stamped top-M data structures, the new top-M data structure comprising a plurality of name-value pairs, and at least one of;

a new reminder value and a representative value.