US10924354B2ActiveUtilityA1

Detection of a bottleneck in a message flow between associated servers

50
Assignee: IBMPriority: Jul 17, 2019Filed: Jul 17, 2019Granted: Feb 16, 2021
Est. expiryJul 17, 2039(~13 yrs left)· nominal 20-yr term from priority
H04L 41/0893H04L 43/0876H04L 67/75H04L 67/34H04L 43/50H04L 43/045H04L 41/22H04L 41/0816H04L 67/10H04L 41/14
50
PatentIndex Score
0
Cited by
9
References
20
Claims

Abstract

Provided are techniques for identifying a server from a plurality of servers causing a bottleneck in a system. Message processing information about message processing performed by one of the plurality of servers is provided. An input is received indicating an adjustment to a number of messages input to the one of the plurality of servers. A message is sent causing the one of the plurality of servers to adjust a number of input messages based on the adjusted number of messages. Updated message processing information is received for the number of messages in the adjusted number of input messages that indicates a number of messages processed per unit time. In response to determining that the number of messages processed does not change in response to the adjustment to the amount of messages input, the one of the plurality of servers is identified as causing the bottleneck in the system.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
       1. A computer-implemented method for identifying a server from a plurality of servers causing a bottleneck in a system comprising:
 providing, on a display, message processing information about message processing performed by one of the plurality of servers, wherein the plurality of servers in the system relay messages in an ordered manner from a first server to a last server; 
 receiving an input via an input device from a user indicating an adjustment amount to a number of messages input to the one of the plurality of servers; 
 sending a message causing the one of the plurality of servers to adjust a number of input messages in a processing queue based on the adjustment amount of the number of messages; 
 receiving updated message processing information for the number of messages in the adjusted number of input messages, wherein the updated message processing information indicates a number of messages processed per unit time; and 
 in response to determining that the number of messages processed does not change in response to the adjustment to an amount of messages input, identifying, on the display, that the one of the plurality of servers as causing the bottleneck in the system. 
 
     
     
       2. The computer-implemented method of  claim 1  further comprising:
 determining the number of input messages to the one of the plurality of servers is to increase based on the adjustment amount; and 
 wherein the message causes a plurality of dummy messages to be added to the processing queue to increase the number of input messages. 
 
     
     
       3. The computer-implemented method of  claim 2 , wherein the message instructs the one of the plurality of servers to generate the plurality of dummy messages. 
     
     
       4. The computer-implemented method of  claim 2 , wherein the plurality of dummy messages are generated by a remote system and transmitted to the one of the plurality of servers. 
     
     
       5. The computer-implemented method of  claim 1 , further comprising:
 determining the number of input messages to the one of the plurality of servers is to decrease based on the adjustment amount; and 
 wherein the message causes the one of the plurality of servers to discard a plurality of input messages from the processing queue to decrease the number of input messages. 
 
     
     
       6. The computer-implemented method of  claim 5 , wherein the message instructs the one of the plurality of servers to change a configuration file to discard input messages in the processing queue. 
     
     
       7. The computer-implemented method of  claim 1 , wherein updated message processing information for each of the plurality of servers is obtained to allow the updated message processing information for each of the plurality of servers to be used to determine the server causing the bottleneck. 
     
     
       8. The computer-implemented method of  claim 7 , wherein the one of the plurality of servers is identified as the server causing the bottleneck in response to a determination that a number of messages processed in the updated processing information does not increase as the adjustment amount of input messages increases. 
     
     
       9. The computer-implemented method of  claim 7 , wherein the one of the plurality of servers is identified as the server causing the bottleneck in response to a determination that an increase in an amount of input messages causes an error in the one of the plurality of servers. 
     
     
       10. The computer-implemented method of  claim 7 , wherein the updated message processing information for the plurality of servers is determined in a specified order to aid in identifying the server causing the bottleneck. 
     
     
       11. A computer system for identifying a server from a plurality of servers causing a bottleneck in a system, the system comprising one or more processors, one or more computer-readable memories and one or more computer-readable, tangible storage devices; and
 program instructions, stored on at least one of the one or more computer-readable, tangible storage devices for execution by at least one of the one or more processors via at least one of the one or more computer-implemented memories, to perform operations comprising: 
 providing, on a display, message processing information about message processing performed by one of the plurality of servers, wherein the plurality of servers in the system relay messages in an ordered manner from a first server to a last server; 
 receiving an input via an input device from a user indicating an adjustment amount to a number of messages input to the one of the plurality of servers; 
 sending a message causing the one of the plurality of servers to adjust a number of input messages in a processing queue based on the adjustment amount to the number of messages; 
 receiving updated message processing information for the number of messages in the adjusted number of input messages wherein the updated message processing information indicates a number of messages processed per unit time; and 
 in response to determining that the number of messages processed does not change in response to the adjustment to the amount of messages input, identifying, on the display, that the one of the plurality of servers as causing the bottleneck in the system. 
 
     
     
       12. The computer system of  claim 11 , wherein the operations further comprise:
 determining the number of input messages to the one of the plurality of servers is to increase based on the adjustment amount; and 
 wherein the message causes a plurality of dummy messages to be added to the processing queue to increase the number of input messages. 
 
     
     
       13. The computer system of  claim 12 , wherein the message instructs the one of the plurality of servers to generate the plurality of dummy messages. 
     
     
       14. The computer system of  claim 13 , wherein the plurality of dummy messages are generated by a remote system and transmitted to the one of the plurality of servers. 
     
     
       15. The computer system of  claim 11 , wherein the operations further comprise:
 determining the number of input messages to the one of the plurality of servers is to decrease based on the adjustment amount; and 
 wherein the message causes the one of the plurality of servers to discard a plurality of input messages from the processing queue to decrease the number of input messages. 
 
     
     
       16. The computer system of  claim 11 , wherein updated message processing information for each of the plurality of servers is obtained to allow the updated message processing information for each of the plurality of servers to be used to determine the server causing the bottleneck. 
     
     
       17. A computer program product for identifying a server from a plurality of servers causing a bottleneck in a system, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by at least one processor to perform operations, the operations comprising:
 providing, on a display, message processing information about message processing performed by one of the plurality of servers, wherein the plurality of servers in the system relay messages in an ordered manner from a first server to a last server; 
 receiving an input via an input device from a user indicating an adjustment amount to a number of messages input to the one of the plurality of servers; 
 sending a message causing the one of the plurality of servers to adjust a number of input messages in a processing queue based on the adjustment amount to the number of messages; 
 receiving updated message processing information for the number of messages in the adjusted number of input messages wherein the updated message processing information indicates a number of messages processed per unit time; and 
 in response to determining that the number of messages processed does not change in response to the adjustment to the amount of messages input, identifying, on the display, that the one of the plurality of servers as causing the bottleneck in the system. 
 
     
     
       18. The computer program product of  claim 17 , wherein the operations further comprise:
 determining the number of input messages to the one of the plurality of servers is to increase based on the adjustment amount; and 
 wherein the message causes a plurality of dummy messages to be added to the processing queue to increase the number of input messages. 
 
     
     
       19. The computer program product of  claim 18 , wherein the message instructs the one of the plurality of servers to generate the plurality of dummy messages. 
     
     
       20. The computer program product of  claim 17  wherein the operations further comprise:
 determining the number of input messages to the one of the plurality of servers is to decrease based on the adjustment amount; and 
 wherein the message causes the one of the plurality of servers to discard a plurality of input messages from the processing queue to decrease the number of input messages.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.