Identifying a polling communication pattern

• US 9,838,263 B2
• Filed: 01/23/2012
• Issued: 12/05/2017
• Est. Priority Date: 01/23/2012
• Status: Active Grant

• Current Assignee: Micro Focus LLC (Open Text Corporation)
• Original Assignee: entIT Software LLC (Open Text Corporation)
• Inventors: Eliassaf, Ofer, Kessner, Amir, Zemer, Meidan, Keret, Oded, Pekel, Leonid
• Primary Examiner(s): Lazaro, David
• Assistant Examiner(s): Khurshid, Zia
• Application Number:
  US14/373,595
• Publication Number:
  US 20140372590A1
• Time in Patent Office: 2,143 Days
• Field of Search: 709223
• CPC Class Codes: H04L 41/145 involving simulating, designing, planning or modelling of a network
• CPC Class Codes: H04L 43/026 using flow identification
• CPC Class Codes: H04L 43/50 Testing arrangements
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/566 Grouping or aggregating service requests, e.g. for unified processing

Abstract

A method for identifying a polling communication pattern within a sequence of communication entities includes grouping the communication entities into a plurality of clusters according to a criterion. Clusters are removed from the plurality according to at least one of a time pattern analysis, cluster size, and cluster duration. The clusters remaining are identified as having a polling communication pattern.

Claims

1. A method for identifying a polling communication pattern within a sequence of communication entities, comprising:

grouping the communication entities that share at least one of an identical request method, identical request domain, or identical number of request key value pairs into a cluster of a plurality of clusters, each of the communication entities being a request and a corresponding response pair exchanged between a client device and a server device;

removing at least one of the clusters from the plurality of clusters according to at least one of a time pattern analysis, a cluster size, or a cluster duration;

identifying remaining clusters of the plurality of clusters as having a polling communication pattern within the sequence of communication entities; and

outputting an indication that the remaining clusters have a polling communication pattern within the sequence of communication entities.

2. The method of claim 1, wherein grouping comprises:

comparing a first communication entity of the plurality of communication entities with a second communication entity of the plurality of entities; and

grouping the first and second communication entities in the same cluster in response to an edit distance between a request of the first communication entity and a request of the second communication entity being within a predetermined threshold.

3. The method of claim 2, wherein the request of the first communication entity and the request of the second communication entity each comprise strings, and wherein the edit distance between the request of the first communication entity and the request of the second communication entity is a number of edits needed to transform the string of the request of the first communication entity into the string of the request of the second communication entity.

4. The method of claim 1, wherein removing at least one of the clusters from the plurality of clusters further comprises removing at least one of the clusters according to a time pattern analysis by:

for each cluster, dividing that cluster into chains of sequential communication entities that exclude communication entities for which the time pattern analysis indicates are not polling communications;

examining the chains of each cluster; and

removing at least one of the clusters according to the examination.

5. The method of claim 4, wherein:

examining comprises distinguishing at least one of a cluster that contains chains of differing polling communication patterns or a cluster that contains less than a predetermined threshold percentage of communication entities included in a chain; and

removing comprises removing a distinguished cluster.

6. The method of claim 1, wherein outputting the indication further comprises updating a graphical user interface displaying details of the plurality of clusters to highlight the communication entities in the remaining clusters.

7. The method of claim 1, further comprising:

using a determination that the remaining clusters have the polling communication pattern to help ensure that a load testing script is properly emulating desired polling communication patterns.

12. The non-transitory medium of claim 1, wherein the remove engine is to remove a selected cluster where the examination for that cluster reveals at least one of:

that the selected cluster contains chains of differing polling communication patterns; and

the selected cluster contains more than a predetermined threshold percentage of communication entities excluded from a chain.

8. A non-transitory computer readable medium having instructions stored thereon that when executed by a processing resource implement a system comprising a cluster engine, a chain engine, a remove engine;

and an identification engine, wherein;

the cluster engine is to group a plurality of communication entities that share at least one of an identical request method, identical request domain, or identical number of request key value pairs into respective clusters of a plurality of clusters, each of the communication entities representing a request and a corresponding response pair exchanged between a client device and a server device;

the chain engine is to divide each of the plurality of clusters into chains of sequential communication entities excluding communication entities having timing patterns not indicative of polling communications;

the remove engine is to remove at least one of the clusters from the plurality of clusters according to at least one a cluster size, a cluster duration or a chain analysis; and

the identification engine is to identify a remaining cluster as having a polling communication pattern and to output an indication that the remaining clusters have a polling communication pattern within the sequence of communication entities.

9. The non-transitory medium of claim 8, wherein the cluster engine is to group by:

comparing a first communication entity of the plurality of communication entities with a second communication entity of the plurality of entities; and

grouping the first and second communication entities in the same cluster in response to an edit distance between a request of the first communication entity and a request of the second communication entity being within a predetermined threshold.

10. The non-transitory medium of claim 9, wherein the request of the first communication entity and the request of the second communication entity each comprise strings, and wherein the edit distance between the request of the first communication entity and the request of the second communication entity is a number of edits needed to transform the string of the request of the first communication entity into the string of the request of the second communication entity.

11. The non-transitory medium of claim 8, wherein each cluster includes a sequence of communication entities and wherein:

for each cluster, the chain engine is to divide by comparing start and end times for the communication entities of that cluster, and building one or more chains of sequential communication entities that have start and end times that are indicative of polling communications;

the remove engine is to examine the chains of each cluster and to remove a selected cluster based on the examination.

13. The non-transitory medium of claim 8, wherein the identification engine is to output the indication through an update of a graphical user interface that displays details of the plurality of clusters to highlight the communication entities in the remaining clusters.

14. The non-transitory medium of claim 8, wherein the instructions are further to cause the processing resource implement to:

use a determination that the remaining clusters have the polling communication pattern to help ensure that a load testing script is properly emulating desired polling communication patterns.

15. A system for identifying a polling communication pattern, the system comprising a processing resource in communication with a non-transitory computer readable medium, wherein the non-transitory computer readable medium contains a set of instructions and wherein the processing resource is to carry out the set of instructions to:

group the plurality of communication entities that share at least one of an identical request method, identical request domain, or identical number of request key value pairs into respective clusters of a plurality of clusters each of the communication entities being a request and a corresponding response pair exchanged between a client device and a server device;

remove at least one of the clusters from the plurality of clusters according to at least one of a time pattern analysis, a cluster size, or a cluster duration;

identify remaining clusters as having a polling communication pattern; and

output an indication that the remaining clusters have a polling communication pattern within the sequence of communication entities.

16. The system of claim 15, wherein the set of instructions includes instructions to cause the processing resource to group the plurality of communication entities into a plurality of clusters by:

comparing a first communication entity of the plurality of communication entities with a second communication entity of the plurality of entities; and

grouping the first and second communication entities in the same cluster in response to an edit distance between a request of the first communication entity and a request of the second communication entity being within a predetermined threshold.

17. The system of claim 16, wherein the request of the first communication entity and the request of the second communication entity each comprise strings, and wherein the edit distance between the request of the first communication entity and the request of the second communication entity is a number of edits needed to transform the string of the request of the first communication entity into the string of the request of the second communication entity.

18. The system of claim 15, wherein the set of instructions include instructions to cause the processor resource to remove at least one of the clusters from the plurality of clusters by:

dividing each of the plurality of clusters into chains of sequential communication entities according to a time pattern analysis of the communication entities; and

examining the chains of each cluster and removing a selected cluster according to the examination.

19. The system of claim 15, wherein each cluster includes a sequence of communication entities and wherein the set of instructions includes instructions to cause the processing resource to remove clusters by:

for each cluster, comparing start and end times for each communication entity of that cluster and identifying one or more chains of sequential communication entities that have start and end times that are indicative of a polling communication;

examining the chains to select clusters that contain chains of differing polling communication patterns or clusters that contain more than a predetermined threshold percentage of communication entities excluded from a chain; and

removing the selected clusters.

20. The system of claim 15, wherein the identification engine is to output the indication through an update of a graphical user interface that displays details of the plurality of clusters to highlight the communication entities in the remaining clusters.