Characterizing application performance within a network
View Patent ↗A system and method are described for analyzing the performance of a network while processing an application. The method involves measuring and calculating the amount of time nodes are active processing and sending frames, as well as the amount of time that frames spend traversing the network. Graphical user interfaces are provided to effectively present significant measurements and calculations.
1. A method of characterizing application performance within a network, the method comprising:
determining an amount of time each frame of a flow in a thread is processed on a sending node and on a receiving node in the network;
determining an amount of time each frame of the flow is in transit on the network;
building a resource table, the resource table including a plurality of resource sets, each resource set comprising a resource, an initiation time that indicates the start of activity of the resource and a termination time that indicates the end of activity of the resource;
deriving a resource timeline from the resource table, the resource timeline including a plurality of events, each of the events comprising:
one of the resources,
an event time comprising one of an initiation time and a termination time, and
a sense that indicates initiation or expiration of the event; and
deriving a resource matrix from the resource timeline, the resource matrix including a plurality of processing sets arranged sequentially, each processing set comprising:
an instance of a resource,
a time interval during which all of the instances of all of the resources comprising the processing set are active, and
an allocated time for each resource within the processing set, the allocated time for each resource being equal to the time interval divided by the number of instances of said each resource within the processing set.
2. The method of claim 1 , wherein the sense is positive or negative where the event time is said initiation time or said termination time, respectively.
3. The method of claim 1 , further comprising the step of summing the allocated times for all resources within the resource matrix to produce a summed time.
4. The method of claim 1 , wherein each of the resources comprises a physical resource or a generic network resource.
5. The method of claim 1 , further comprising displaying an allocated time.
6. A computer readable medium storing computer program instructions executable by a processor, the computer program instructions implementing a method of characterizing application performance within a network, the method comprising:
determining an amount of time each frame of a flow in a thread is processed on a sending node and on a receiving node in the network;
determining an amount of time each frame of the flow is in transit on the network;
building a resource table, the resource table including a plurality of resource sets, each resource set comprising a resource, an initiation time that indicates the start of activity of the resource and a termination time that indicates the end of activity of the resource;
deriving a resource timeline from the resource table, the resource timeline including a plurality of events, each of the events comprising:
one of the resources,
an event time comprising one of an initiation time and a termination time, and
a sense that indicates initiation or expiration of the event; and
deriving a resource matrix from the resource timeline, the resource matrix including a plurality of processing sets arranged sequentially, each processing set comprising:
an instance of a resource,
a time interval during which all of the instances of all of the resources comprising the processing set are active, and
an allocated time for each resource within the processing set, the allocated time for each resource being equal to the time interval divided by the number of instances of said each resource within the processing set.
7. The computer readable medium of claim 6 , wherein the sense is positive or negative where the event time is said initiation time or said termination time, respectively.
8. The computer readable medium of claim 6 , further comprising computer program instructions for implementing a method of summing the allocated times for all resources within the resource matrix to produce a summed time.
9. The computer readable medium of claim 6 , wherein each of the resources comprises a physical resource or a generic network resource.
10. The computer readable medium of claim 6 , further comprising computer program instructions implementing a method for displaying an allocated time.
11. A computer-implemented method for determining node processing time relative to total transaction time, the method comprising:
deriving a resource timeline from a resource table, the resource timeline including a plurality of events, each of the events comprising:
one of the resources,
an event time comprising one of an initiation time and a termination time, and
a sense that indicates initiation or expiration of the event;
deriving a resource matrix from the resource timeline, the resource matrix including a plurality of processing sets arranged sequentially, each processing set comprising:
an instance of a resource,
a time interval during which all of the instances of all of the resources comprising the processing set are active, and
an allocated time for each resource within the processing set, the allocated time for each resource being equal to the time interval divided by the number of instances of said each resource within the processing set; and
providing for display through a graphical user interface results of the derived resource matrix.
12. The method of claim 11 , wherein the sense is positive or negative where the event time is said initiation time or said termination time, respectively.
13. The method of claim 11 , further comprising summing the allocated times for all resources within the resource matrix to produce a summed time.
14. The method of claim 11 , wherein each of the resources comprises a physical resource or a generic network resource.
15. The method of claim 11 , further comprising displaying an allocated time.
16. A computer readable medium storing computer program instructions executable by a processor, the computer program instructions when executed by a processor cause the processor to:
derive a resource timeline from a resource table, the resource timeline including a plurality of events, each of the events comprising:
one of the resources,
an event time comprising one of an initiation time and a termination time, and
a sense that indicates initiation or expiration of the event;
derive a resource matrix from the resource timeline, the resource matrix including a plurality of processing sets arranged sequentially, each processing set comprising:
an instance of a resource,
a time interval during which all of the instances of all of the resources comprising the processing set are active, and
an allocated time for each resource within the processing set, the allocated time for each resource being equal to the time interval divided by the number of instances of said each resource within the processing set; and
provide for display through a graphical user interface results of the derived resource matrix.
17. The computer readable medium of claim 16 , wherein the sense is positive or negative where the event time is said initiation time or said termination time, respectively.
18. The computer readable medium of claim 16 , further comprising instructions that cause the processor to sum the allocated times for all resources within the resource matrix to produce a summed time.
19. The computer readable medium of claim 16 , wherein each of the resources comprises a physical resource or a generic network resource.
20. The computer readable medium of claim 16 , further comprising instructions that cause the processor to display an allocated time.