Concurrency reduction service

Patent metadata

Field	Value
Publication number	US-9973573-B2
Application number	US-201615176671-A
Country	US
Kind code	B2
Filing date	Jun 8, 2016
Priority date	Jun 8, 2016
Publication date	May 15, 2018
Grant date	May 15, 2018

Abstract

Reducing concurrency in a system comprising a plurality of services sending a plurality of concurrent requests to a back-end service through a concurrency reduction service. The concurrency reduction service maps each concurrent incoming request to a key; and determines if the key to which the concurrent incoming request is mapped matches a key mapped from another concurrent incoming request from the plurality of concurrent requests. If the key to which the concurrent incoming request is mapped matches a key mapped from at least one other concurrent incoming request from the plurality of concurrent requests, then the service groups the concurrent incoming request with the at least one other concurrent incoming request to be sent to the back-end service. The concurrency reduction service sends one outgoing request to the back-end service for each of the keys to which the plurality of concurrent incoming requests were mapped.

First claim

What is claimed is:

1. A method of reducing concurrency in a system comprising a plurality of services sending a plurality of concurrent requests to a back-end service through a concurrency reduction service, the method comprising the steps of:
a) the concurrency reduction service receiving a plurality of concurrent incoming requests from the plurality of services;
b) the concurrency reduction service mapping each concurrent incoming request to a respective key of a plurality of keys;
c) the concurrency reduction service determining that a plurality of common key incoming requests of the plurality of requests each have been mapped to a first key of the plurality of keys;
d) the concurrency reduction service sending a single common key outgoing request, corresponding to the first key, to the back-end service;
e) the concurrency reduction service receiving a common key response to the common key outgoing request from the back-end service;
f) the concurrency reduction service sending the common key response received to all of the services from which the concurrency reduction service received a common key incoming request.

2. The method of claim 1 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, the key is assigned based, at least in part, upon information being requested.

3. The method of claim 2 , in which the information being requested is an identity of a resource.

4. The method of claim 1 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, the key is assigned based, at least in part, upon information in a header of the request.

5. The method of claim 1 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, the key is assigned by calculating the key from the request.

6. The method of claim 1 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, different key-calculation functions are used to map keys for concurrent incoming requests sent by different services.

7. The method of claim 1 , further comprising the step of the concurrency reduction service storing the keys.

8. The method of claim 4 , in which the keys are stored in a look-up table.

9. A computer program product for reducing concurrency in a system comprising a plurality of services sending a plurality of concurrent requests to a back-end service through a concurrency reduction service comprising a computer comprising at least one processor, one or more memories, one or more computer readable storage media, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by the computer to perform a method comprising:
a) receiving, by the concurrency reduction service, a plurality of concurrent incoming requests from the plurality of services;
b) mapping, by the concurrency reduction service, each concurrent incoming request to a respective key of a plurality of keys;
c) determining, by the concurrency reduction service, that a plurality of common key incoming requests of the plurality of requests each have been mapped to a first key of the plurality of keys;
d) sending, by the concurrency reduction service, a single common key outgoing request, corresponding to the first key, to the back-end service;
e) receiving, by the concurrency reduction service, a common key response to the common key outgoing request from the back-end service; and
f) sending, by the concurrency reduction service, the common key response to all of the services from which the concurrency reduction service received a common key incoming request.

10. The computer program product of claim 9 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, the key is assigned based, at least in part, upon information being requested.

11. The computer program product of claim 10 , in which the information being requested is an identity of a resource.

12. The computer program product of claim 9 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, the key is assigned based, at least in part, upon information in a header of the request.

13. The computer program product of claim 9 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, the key is assigned by calculating the key from the request.

14. The computer program product of claim 9 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, different key-calculation functions are used to map keys for concurrent incoming requests sent by different services.

15. The computer program product of claim 9 , further comprising the step of the concurrency reduction service storing the keys.

16. A computer system for reducing concurrency in a system comprising a plurality of services sending a plurality of concurrent requests to a back-end service through a concurrency reduction service comprising a computer comprising at least one processor, one or more memories, one or more computer readable storage media having program instructions executable by the computer to perform the program instructions comprising:
a) receiving, by the concurrency reduction service, a plurality of concurrent incoming requests from the plurality of services;
b) mapping, by the concurrency reduction service, each concurrent incoming request to a respective key of a plurality of keys;
c) determining, by the concurrency reduction service, that a plurality of common key incoming requests of the plurality of requests each have been mapped to a first key of the plurality of keys;
d) sending, by the concurrency reduction service, a single common key outgoing request, corresponding to the first key, to the back-end service;
e) receiving, by the concurrency reduction service, a common key response to the common key outgoing request from the back-end service; and
f) sending, by the concurrency reduction service, the common key response to all of the services from which the concurrency reduction service received a common key incoming request.

17. The computer system of claim 16 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, the key is assigned based, at least in part, upon information being requested.

18. The computer system of claim 16 , in which the information being requested is an identity of a resource.

19. The computer system of claim 16 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, the key is assigned based, at least in part, upon information in a header of the request.

20. The computer system of claim 16 , in which in step b) of mapping each concurrent incoming request to a respective key of a plurality of keys, the key is assigned by calculating the key from the request.

Assignees

• IBM

Inventors

• Burns Timothy M
• Graham Ryan M
• Huffman Mark A
• Kaplinger Todd E

Classifications

• H04L43/08

  Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters · CPC title

• H04L9/08

  Key distribution {or management, e.g. generation, sharing or updating, of cryptographic keys or passwords (network architectures or network communication protocols for supporting key management in a packet data network H04L63/06)} · CPC title

• H04L67/1002 Primary

  Electricity · mapped topic

• H04L67/141

  Setup of application sessions (admission control or resource allocation in data switching networks H04L47/70) · CPC title

• H04L67/1001

  for accessing one among a plurality of replicated servers · CPC title