SYSTEMS AND METHODS FOR AUTOMATICALLY GENERATING MESSAGE PROTOTYPES FOR ACCURATE AND EFFICIENT OPAQUE SERVICE EMULATION

• US 20150363215A1
• Filed: 11/07/2014
• Published: 12/17/2015
• Est. Priority Date: 06/16/2014
• Status: Active Grant

• Current Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Original Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Inventors: Versteeg, Steven Cornelis, Du, Miao, Schneider, Jean-Guy, Grundy, John Collis, Han, Jun
• Granted Patent: US 10,031,836 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/3664 Environments for testing or debugging software
• CPC Class Codes: G06F 11/3684 for test design, e.g. generating new test cases

Abstract

In a method of service emulation, a plurality of messages communicated between a system under test and a target system for emulation are recorded in a computer-readable memory. Ones of the messages are clustered to define a plurality of message clusters, and respective cluster prototypes are generated for the message clusters. The respective cluster prototypes include a commonality among the ones of the messages of the corresponding message clusters. One of the message clusters is identified as corresponding to a request from the system under test based on a comparison of the request with the respective cluster prototypes, and a response to the request for transmission to the system under test is generated based on the one of the message clusters that was identified. Related computer systems and computer program products are also discussed.

Claims

1. A method of service emulation, the method comprising:

recording a plurality of messages communicated between a system under test and a target system for emulation in a computer-readable memory;

clustering ones of the messages to define a plurality of message clusters;

generating respective cluster prototypes for the message clusters, the respective cluster prototypes comprising a commonality among the ones of the messages of the corresponding message clusters;

identifying one of the message clusters as corresponding to a request from the system under test based on a comparison of the request with the respective cluster prototypes; and

generating a response to the request for transmission to the system under test based on the one of the message clusters that was identified,

wherein the recording, the clustering, the generating the respective cluster prototypes, the identifying, and the generating the response comprise operations performed by a processor coupled to the memory.

2. The method of claim 1, wherein, for the respective cluster prototypes, the commonality comprises common characters that are selected based on a frequency of occurrence at respective positions of the ones of the messages of the corresponding message clusters.

3. The method of claim 2, wherein the generating the respective cluster prototypes comprises:

aligning the ones of the messages of the corresponding message clusters according to the respective positions; and

identifying the common characters based on the frequency of occurrence at the respective positions indicated by the aligning.

4. The method of claim 3, wherein:

the aligning further comprises inserting gap characters among the ones of the messages of the corresponding message clusters to align the common characters at the respective positions; and

the generating the respective cluster prototypes comprises extracting a sequence comprising the common characters from the ones of the messages of the corresponding message clusters responsive to the aligning.

5. The method of claim 4, wherein for the respective cluster prototypes, the extracting the sequence comprises:

determining a lack of consensus based on the frequency of occurrence at the respective positions; and

inserting wildcard characters into the sequence responsive to determining the lack of consensus.

6. The method of claim 5, wherein for the respective cluster prototypes, the extracting the sequence further comprises:

inserting the common characters into the sequence based on the frequency of occurrence at the respective positions being above a threshold; and

inserting the wildcard characters into the sequence based on the frequency of occurrence at the respective positions being below the threshold.

7. The method of claim 6, wherein the sequence comprising the common characters further comprises ones of the gap characters, and wherein for the respective cluster prototypes, the extracting the sequence further comprises:

deleting the ones of the gap characters from the sequence.

8. The method of claim 5, further comprising:

identifying respective positions of the respective cluster prototypes as corresponding to respective information types based on a relative variability of the respective positions of the ones of the messages of the corresponding message clusters; and

assigning different weightings to the respective positions of the respective cluster prototypes according to the respective information types.

9. The method of claim 8, wherein ones of the respective positions of the respective cluster prototypes having a lower relative variability are assigned higher ones of the different weightings.

10. The method of claim 8, wherein the identifying the one of the message clusters as corresponding to the request from the system under test comprises:

calculating a similarity of the request to the respective cluster prototypes based on the different weightings assigned to the respective positions thereof and a runtime distance measure that is independent of a message structure of the request; and

identifying the one of the message clusters as corresponding to the request based on the similarity of the request to a corresponding one of the cluster prototypes.

11. The method of claim 9, wherein the runtime distance measure is normalized to account for alignment of respective positions of the request with the wildcard characters in the respective cluster prototypes.

12. The method of claim 9, wherein the ones of the messages of the message clusters comprise respective requests and responses associated therewith communicated between the system under test and the target system, and wherein generating the response comprises:

selecting one of the requests of the one of the message clusters that was identified;

identifying respective fields in the one of the requests and in one of the responses associated therewith as comprising a common subsequence; and

populating a field in the one of the responses with a subsequence from the request from the system under test based on the respective fields that were identified.

19. The computer system of claim 6, wherein the sequence comprising the common characters further comprises ones of the gap characters, and wherein, to extract the sequence for the respective cluster prototypes, the computer readable program code, when executed by the processor, further causes the processor to:

delete the ones of the gap characters from the sequence.

13. A computer system, comprising:

a processor; and

a memory coupled to the processor, the memory comprising computer readable program code embodied therein that, when executed by the processor, causes the processor to;

record a plurality of messages communicated between a system under test and a target system for emulation in a computer-readable memory;

cluster ones of the messages to define a plurality of message clusters;

generate respective cluster prototypes for the message clusters, the respective cluster prototypes comprising a commonality among the ones of the messages of the corresponding message clusters;

identify one of the message clusters as corresponding to a request from the system under test based on a comparison of the request with the respective cluster prototypes; and

generate a response to the request for transmission to the system under test based on the one of the message clusters that was identified.

14. The computer system of claim 13, wherein, for the respective cluster prototypes, the commonality comprises common characters that are selected based on a frequency of occurrence at respective positions of the ones of the messages of the corresponding message clusters.

15. The computer system of claim 14, wherein, to generate the respective cluster prototypes, the computer readable program code, when executed by the processor, further causes the processor to:

align the ones of the messages of the corresponding message clusters according to the respective positions; and

identify the common characters based on the frequency of occurrence at the respective positions indicated by alignment thereof.

16. The computer system of claim 15, wherein:

to align the ones of the messages, the computer readable program code, when executed by the processor, further causes the processor to insert gap characters among the ones of the messages of the corresponding message clusters to align the common characters at the respective positions; and

to generate the respective cluster prototypes, the computer readable program code, when executed by the processor, further causes the processor to extract a sequence comprising the common characters from the ones of the messages of the corresponding message clusters responsive to the alignment thereof.

17. The computer system of claim 16, wherein, to extract the sequence for the respective cluster prototypes, the computer readable program code, when executed by the processor, further causes the processor to:

determine a lack of consensus based on the frequency of occurrence at the respective positions; and

insert wildcard characters into the sequence responsive to determining the lack of consensus.

18. The computer system of claim 17, wherein, to extract the sequence for the respective cluster prototypes, the computer readable program code, when executed by the processor, further causes the processor to:

insert the common characters into the sequence based on the frequency of occurrence at the respective positions being above a threshold; and

insert the wildcard characters into the sequence based on the frequency of occurrence at the respective positions being below the threshold.

20. A computer program product comprising:

a computer readable storage medium having computer readable program code embodied in the medium, the computer readable program code comprising;

computer readable code to record a plurality of messages communicated between a system under test and a target system for emulation in a computer-readable memory;

computer readable code to cluster ones of the messages to define a plurality of message clusters;

computer readable code to generate respective cluster prototypes for the message clusters, the respective cluster prototypes comprising a commonality among the ones of the messages of the corresponding message clusters;

computer readable code to identify one of the message clusters as corresponding to a request from the system under test based on a comparison of the request with the respective cluster prototypes; and

computer readable code to generate a response to the request for transmission to the system under test based on the one of the message clusters that was identified.