Monitoring module usage in a data processing system

• US 10,115,081 B2
• Filed: 06/25/2015
• Issued: 10/30/2018
• Est. Priority Date: 06/25/2015
• Status: Active Grant

• Current Assignee: Bank of America Corp.
• Original Assignee: Bank of America Corp.
• Inventors: Smith, Michael Gerald, Beaudry, Joshua Allen, Dryer, Eric, Thompson, Marshall Bright, Gunsolley, Shawn Cart, Wisser, Michael Matthew, Bastnagel, Andrew Patrick, Barrett, II, James F.
• Primary Examiner(s): Rankins, William E
• Application Number:
  US14/750,684
• Publication Number:
  US 20160379180A1
• Time in Patent Office: 1,223 Days
• Field of Search: 705 41, 705 35
• CPC Class Codes: G06Q 20/027 involving a payment switch or gateway
• CPC Class Codes: H04L 43/091 Measuring contribution of individual network components to actual service level

Abstract

Embodiments of the invention monitor node usage in a transaction processing system. Embodiments include accessing a dynamic mapping of transaction flow in the transaction processing system, the dynamic mapping including a plurality of transaction pathways interconnected by transaction nodes, wherein the transaction nodes represent an automated processing step or action taken by a manual station of the transaction processing system on transactions files that are received at the transaction nodes; wherein the transaction processing system processes a transaction file at a first node and stores information corresponding to the first node and the type of processing that occurred at the first node with the transaction file; determining that the transaction file was processed at the first node; accessing the transaction file to determine the type of processing that occurred at the first node; and performing an action related to the type of processing that occurred at the first node.

Claims

1. A monitoring system for automatically re-coding bottleneck nodes in a transaction processing system, the transaction processing system comprising:

a memory device with computer-readable program code stored thereon;

a communication device;

a processing device operatively coupled to the memory device and the communication device, wherein the processing device is configured to execute the computer-readable program code to;

access a dynamic mapping of transaction flow in the transaction processing system, the dynamic mapping including a plurality of transaction pathways interconnected by transaction nodes, wherein the transaction nodes represent an automated processing step or action taken by a manual station of the transaction processing system on transaction files that are received at the transaction nodes, wherein the transaction files are files associated with a specific financial instrument to be processed by the transaction processing system;

process a transaction file at a first node and store information corresponding to the first node and the type of processing that occurred at the first node with the transaction file;

determine that the transaction file was processed at the first node;

determine that the transaction file experienced a bottleneck within the transaction flow at the first node;

store information related to the transaction file experiencing the bottleneck at the first node at a first datastore comprising a plurality of entries comprising information regarding transaction file processing;

retrieve from the datastore the information related to the transaction file experiencing a bottleneck within the transaction flow at the first node;

determine, based at least in part on the retrieved information related to the transaction file experiencing a bottleneck at the first node, that the first node is a bottleneck node;

in response to determining that the first node is a bottleneck node, initiate a re-writing of at least a portion of code associated with the first node in a memory of the transaction processing system;

access the transaction file to determine the type of processing that occurred at the first node;

determine that processing of the transaction file bypassed a second node; and

store information related to the transaction file bypassing the second node at a second datastore comprising a plurality of entries comprising information regarding transaction file processing; and

perform an action related to the type of processing that occurred at the first node.

2. The monitoring system of claim 1, wherein the processing device is further configured to execute the computer-executable program code to:

access the datastore including the information related to the transaction file bypassing the second node; and

determine, based at least in part on the information related to the transaction file bypassing the second node, that the second node is a dead node.

3. The monitoring system of claim 2, wherein the processing device is further configured to execute the computer-executable program code to:

in response to determining that the second node is a dead node, automatically removing code associated with the second node from a memory of the transaction processing system.

4. The monitoring system of claim 1, wherein the processing device is further configured to execute the computer-executable program code to:

in response to determining that the first node is a bottleneck node, initiating re-routing of at least a portion of the transaction flow away from the first node.

5. The monitoring system of claim 1, wherein the processing device is further configured to execute the computer-executable program code to:

optimize transaction node usage comprising;

determining which transaction nodes are operating at a rate below a threshold resulting in slow nodes and which transaction nodes are operating at a rate above the threshold resulting in fast nodes; and

in response, automatically re-routing at least a portion of the transaction flow to the fast nodes and away from the slow nodes.

6. A computer program product for automatically re-coding bottleneck nodes in a transaction processing system, the computer program product comprising at least one non-transitory computer-readable medium having computer-readable program code portions embodied therein, the computer-readable program code portions comprising:

an executable portion configured for accessing a dynamic mapping of transaction flow in the transaction processing system, the dynamic mapping including a plurality of transaction pathways interconnected by transaction nodes, wherein the transaction nodes represent an automated processing step or action taken by a manual station of the transaction processing system on transactions files that are received at the transaction nodes, wherein the transaction files are files associated with a specific financial instrument to be processed by the transaction processing system;

an executable portion configured for processing a transaction file at a first node and storing information corresponding to the first node and the type of processing that occurred at the first node with the transaction file;

an executable portion configured for determining that the transaction file was processed at the first node;

an executable portion configured for determining that the transaction file experienced a bottleneck within the transaction flow at the first node;

an executable portion configured for storing information related to the transaction file experiencing the bottleneck at the first node at a datastore comprising a plurality of entries comprising information regarding transaction file processing;

an executable portion configured for retrieving from the datastore the information related to the transaction file experiencing a bottleneck within the transaction flow at the first node;

an executable portion configured for determining, based at least in part on the retrieved information related to the transaction file experiencing a bottleneck at the first node, that the first node is a bottleneck node;

an executable portion configured for, in response to determining that the first node is a bottleneck node, initiating re-writing of at least a portion of code associated with the first node in a memory of the transaction processing system;

an executable portion configured for accessing the transaction file to determine the type of processing that occurred at the first node;

an executable portion configured for determine that processing of the transaction file bypassed a second node; and

an executable portion configured for storing information related to the transaction file bypassing the second node at a second datastore comprising a plurality of entries comprising information regarding transaction file processing; and

an executable portion configured for performing an action related to the type of processing that occurred at the first node.

7. The computer program product of claim 6, wherein the computer-readable program code portions further comprise:

an executable portion configured for accessing the datastore including the information related to the transaction file bypassing the second node; and

an executable portion configured for determining, based at least in part on the information related to the transaction file bypassing the second node, that the second node is a dead node.

8. The computer program product of claim 7, wherein the computer-readable program code portions further comprise:

an executable portion configured for, in response to determining that the second node is a dead node, automatically removing code associated with the second node from a memory of the transaction processing system.

9. The computer program product of claim 6, wherein the computer-readable program code portions further comprise:

an executable portion configured for in response to determining that the first node is a bottleneck node, initiating re-routing of at least a portion of the transaction flow away from the first node.

10. The computer program product of claim 6, wherein the computer-readable program code portions further comprise:

an executable portion configured for optimizing transaction node usage comprising;

determining which transaction nodes are operating at a rate below a threshold resulting in slow nodes and which transaction nodes are operating at a rate above the threshold resulting in fast nodes;

in response, automatically re-routing at least a portion of the transaction flow to the fast nodes and away from the slow nodes.

11. A computer-implemented method for automatically re-coding bottleneck nodes in a transaction processing system, the method comprising:

providing a computing system comprising a computer processing device and a non-transitory computer readable medium, where the computer readable medium comprises configured computer program instruction code for operation by said computer processing device;

accessing, using the computing system, a dynamic mapping of transaction flow in the transaction processing system, the dynamic mapping including a plurality of transaction pathways interconnected by transaction nodes, wherein the transaction nodes represent an automated processing step or action taken by a manual station of the transaction processing system on transactions files that are received at the transaction nodes, wherein the transaction files are files associated with a specific financial instrument to be processed by the transaction processing system;

processing, using the computing system, a transaction file at a first node and storing information corresponding to the first node and the type of processing that occurred at the first node with the transaction file;

determining, using the computing system, that the transaction file was processed at the first node;

determining, using the computing system, that the transaction file experienced a bottleneck within the transaction flow at the first node;

storing, using the computing system, information related to the transaction file experiencing the bottleneck at the first node at a datastore comprising a plurality of entries comprising information regarding transaction file processing;

retrieving, using the computing system, from the datastore the information related to the transaction file experiencing a bottleneck within the transaction flow at the first node;

determining, using the computing system, based at least in part on the retrieved information related to the transaction file experiencing a bottleneck at the first node, that the first node is a bottleneck node;

in response to determining that the first node is a bottleneck node, initiating, using the computing system, re-writing of at least a portion of code associated with the first node in a memory of the transaction processing system;

accessing, using the computing system, the transaction file to determine the type of processing that occurred at the first node;

determining, using the computing system, that processing of the transaction file bypassed a second node; and

storing, using the computing system, information related to the transaction file bypassing the second node at a second datastore comprising a plurality of entries comprising information regarding transaction file processing; and

performing, using the computing system, an action related to the type of processing that occurred at the first node.

12. The method of claim 11, further comprising:

accessing, using the computing system, the datastore including the information related to the transaction file bypassing the second node; and

determining, using the computing system, based at least in part on the information related to the transaction file bypassing the second node, that the second node is a dead node.

13. The method of claim 12, further comprising:

in response to determining that the second node is a dead node, automatically removing, using the computing system, code associated with the second node from a memory of the transaction processing system.

14. The method of claim 12, further comprising:

in response to determining that the first node is a bottleneck node, initiating, using the computing system, re-routing of at least a portion of the transaction flow away from the first node.

15. The method of claim 12, further comprising:

optimizing, using the computing system, transaction node usage comprising;

determining, using the computing system, which transaction nodes are operating at a rate below a threshold resulting in slow nodes and which transaction nodes are operating at a rate above the threshold resulting in fast nodes; and

in response, automatically re-routing, using the computing system, at least a portion of the transaction flow to the fast nodes and away from the slow nodes.