RESPONSE PROTOTYPES WITH ROBUST SUBSTITUTION RULES FOR SERVICE VIRTUALIZATION

• US 20160277510A1
• Filed: 03/18/2015
• Published: 09/22/2016
• Est. Priority Date: 03/18/2015
• Status: Abandoned Application

• Current Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Original Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Inventors: Du, Miao, Versteeg, Steven Cornelis
• Application Number:
  US14/661,514
• Publication Number:
  US 20160277510A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 43/20 the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV
• CPC Class Codes: H04L 43/50 Testing arrangements
• CPC Class Codes: H04L 67/34 involving the movement of software or configuration parameters network booting or remote initial program loading [RIPL] G06F9/4416
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 67/60 Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources admission control or resource allocation H04L47/70

Abstract

In a method of service emulation, a transaction subset including ones of a plurality of message transactions previously communicated between a system under test and a target system for emulation is defined. The message transactions include requests and responses thereto that are stored in a computer-readable memory. Variable sections of the requests and variable sections of the responses of the transaction subset are identified, for example, based on respective message structures thereof. Substitution rules, which indicate a correspondence between respective ones of the variable sections of the requests and respective ones of the variable sections of the responses, are determined for the transaction subset based on commonalities therebetween. Responsive to receiving an incoming request from the system under test, a response to the incoming request is generated according to the substitution rules. Related computer systems and computer program products are also discussed.

Claims

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

defining a transaction subset comprising ones of a plurality of message transactions previously communicated between a system under test and a target system for emulation, the message transactions comprising requests and responses thereto that are stored in a computer-readable memory;

identifying variable sections of the requests and variable sections of the responses of the transaction subset;

determining substitution rules for the transaction subset indicating a correspondence between respective ones of the variable sections of the requests and respective ones of the variable sections of the responses based on commonalities therebetween; and

responsive to receiving an incoming request from the system under test, generating a response thereto according to the substitution rules;

wherein the defining, the identifying, the determining, and the generating comprise operations performed by a processor.

2. The method of claim 1, wherein the commonalities comprise common substrings, and wherein determining the substitution rules comprises:

identifying, for respective pairs comprising one of the requests and one of the responses thereto, the common substrings included in the respective ones of the variable sections thereof;

defining, for the respective pairs comprising one of the requests and one of the responses thereto, symmetric field rules correlating the respective ones of the variable sections thereof having the common substrings; and

merging the symmetric field rules for the respective pairs to define the substitution rules for the transaction subset.

3. The method of claim 2, wherein the merging is based on a frequency of occurrence of the symmetric field rules for the respective pairs.

4. The method of claim 2, wherein the merging comprises:

clustering ones of the symmetric field rules into respective groups based on similarities therebetween calculated using a distance function; and

selecting one of the symmetric field rules from the respective groups as one of the substitution rules.

5. The method of claim 1, wherein identifying the variable sections of the requests and the variable sections of the responses of the transaction subset comprises:

decoding the requests and the responses using a message parser based on predetermined information indicative of respective message structures thereof.

6. The method of claim 1, wherein identifying the variable sections of the requests and the variable sections of the responses of the transaction subset comprises:

generating, for the transaction subset, a request prototype comprising common characters that are present at respective positions of ones of the requests thereof and a response prototype comprising common characters that are present at respective positions of ones of the responses thereof; and

determining the variable sections of the requests of the transaction subset based on an absence of the common characters at corresponding positions of the request prototype; and

determining the variable sections of the responses of the transaction subset based on an absence of the common characters at corresponding positions of the response prototype.

7. The method of claim 6, wherein generating the request prototype and the response prototype comprises:

aligning the requests of the transaction subset according to the respective positions thereof;

selecting the common characters for the request prototype based on a frequency of occurrence thereof at the respective positions of the requests of the transaction subset as indicated by the aligning of the requests;

aligning the responses of the transaction subset according to the respective positions thereof; and

selecting the common characters for the response prototype based on a frequency of occurrence thereof at the respective positions of the responses of the transaction subset as indicated by the aligning of the responses.

8. The method of claim 6, wherein generating the response to the incoming request comprises:

identifying variable sections of the incoming request based on a comparison of the incoming request with the corresponding positions of the request prototype; and

populating ones of the corresponding positions of the response prototype with data from ones of the variable sections of the incoming request as specified by the substitution rules to generate the response thereto.

9. The method of claim 8, wherein generating the response to the incoming request further comprises:

identifying the transaction subset, among a plurality of transaction subsets respectively comprising different ones of the message transactions, as corresponding to the incoming request based on a comparison of the incoming request with the request prototype of the transaction subset, wherein the ones of the message transactions included in the transaction subset are of a same operation type.

10. 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;

define a transaction subset comprising ones of a plurality of message transactions previously communicated between a system under test and a target system for emulation, the message transactions comprising requests and responses thereto that are stored in a computer-readable memory;

identify variable sections of the requests and variable sections of the responses of the transaction subset;

determine substitution rules for the transaction subset indicating a correspondence between respective ones of the variable sections of the requests and respective ones of the variable sections of the responses based on commonalities therebetween; and

responsive to receiving an incoming request from the system under test, generate a response thereto according to the substitution rules.

11. The computer system of claim 10, wherein the commonalities comprise common substrings, and wherein, to determine the substitution rules, the computer readable program code, when executed by the processor, further causes the processor to:

identify, for respective pairs comprising one of the requests and one of the responses thereto, the common substrings included in the respective ones of the variable sections thereof;

define, for the respective pairs comprising one of the requests and one of the responses thereto, symmetric field rules correlating the respective ones of the variable sections thereof having the common substrings; and

merge the symmetric field rules for the respective pairs to define the substitution rules for the transaction subset.

12. The computer system of claim 10, wherein, to merge the symmetric field rules, the computer readable program code, when executed by the processor, further causes the processor to:

cluster ones of the symmetric field rules into respective groups based on similarities therebetween calculated using a distance function; and

select one of the symmetric field rules from the respective groups as one of the substitution rules.

13. The computer system of claim 10, wherein, to identify the variable sections of the requests and the variable sections of the responses of the transaction subset, the computer readable program code, when executed by the processor, further causes the processor to:

generate, for the transaction subset, a request prototype comprising common characters that are present at respective positions of ones of the requests thereof and a response prototype comprising common characters that are present at respective positions of ones of the responses thereof; and

determine the variable sections of the requests of the transaction subset based on an absence of the common characters at corresponding positions of the request prototype; and

determine the variable sections of the responses of the transaction subset based on an absence of the common characters at corresponding positions of the response prototype.

14. The computer system of claim 13, wherein, to generate the request prototype and the response prototype, the computer readable program code, when executed by the processor, further causes the processor to:

align the requests of the transaction subset according to the respective positions thereof;

select the common characters for the request prototype based on a frequency of occurrence thereof at the respective positions of the requests of the transaction subset as indicated by alignment of the requests;

align the responses of the transaction subset according to the respective positions thereof; and

select the common characters for the response prototype based on a frequency of occurrence thereof at the respective positions of the responses of the transaction subset as indicated by alignment of the responses.

15. The computer system of claim 13, wherein, to generate the response to the incoming request, the computer readable program code, when executed by the processor, further causes the processor to:

identify variable sections of the incoming request based on a comparison of the incoming request with the corresponding positions of the request prototype; and

populate ones of the corresponding positions of the response prototype with data from ones of the variable sections of the incoming request as specified by the substitution rules to generate the response.

16. 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 define a transaction subset comprising ones of a plurality of message transactions previously communicated between a system under test and a target system for emulation, the message transactions comprising requests and responses thereto that are stored in a computer-readable memory;

computer readable code to identify variable sections of the requests and variable sections of the responses of the transaction subset;

computer readable code to determine substitution rules for the transaction subset indicating a correspondence between respective ones of the variable sections of the requests and respective ones of the variable sections of the responses based on commonalities therebetween; and

computer readable code to generate a response to an incoming request from the system under test according to the substitution rules.

17. The computer program product of claim 16, wherein the commonalities comprise common substrings, and wherein the computer readable program code to determine the substitution rules comprises:

computer readable program code to identify, for respective pairs comprising one of the requests and one of the responses thereto, the common substrings included in the respective ones of the variable sections thereof;

computer readable program code to define, for the respective pairs comprising one of the requests and one of the responses thereto, symmetric field rules correlating the respective ones of the variable sections thereof having the common substrings; and

computer readable program code to merge the symmetric field rules for the respective pairs to define the substitution rules for the transaction subset.

18. The computer program product of claim 16, wherein, the computer readable program code to identify the variable sections of the requests and the variable sections of the responses of the transaction subset comprises:

computer readable program code to generate, for the transaction subset, a request prototype comprising common characters that are present at respective positions of ones of the requests thereof and a response prototype comprising common characters that are present at respective positions of ones of the responses thereof; and

computer readable program code to determine the variable sections of the requests of the transaction subset based on an absence of the common characters at corresponding positions of the request prototype; and

computer readable program code to determine the variable sections of the responses of the transaction subset based on an absence of the common characters at corresponding positions of the response prototype.

19. The computer program product of claim 18, wherein the computer readable program code to generate the request prototype and the response prototype comprises:

computer readable program code to align the requests of the transaction subset according to the respective positions thereof;

computer readable program code to select the common characters for the request prototype based on a frequency of occurrence thereof at the respective positions of the requests of the transaction subset as indicated by alignment of the requests;

computer readable program code to align the responses of the transaction subset according to the respective positions thereof; and

computer readable program code to select the common characters for the response prototype based on a frequency of occurrence thereof at the respective positions of the responses of the transaction subset as indicated by alignment of the responses.

20. The computer program product of claim 18, wherein the computer readable program code to generate the response to the incoming request comprises:

computer readable program code to identify variable sections of the incoming request based on a comparison of the incoming request with the corresponding positions of the request prototype; and

computer readable program code to populate ones of the corresponding positions of the response prototype with data from ones of the variable sections of the incoming request as specified by the substitution rules to generate the response.