Run-time fabric reconfiguration
US-9436623-B2 · Sep 6, 2016 · US
US2016379180A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2016379180-A1 |
| Application number | US-201514750684-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 25, 2015 |
| Priority date | Jun 25, 2015 |
| Publication date | Dec 29, 2016 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
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.
Opening claim text (preview).
What is claimed is: 1 . A monitoring system for monitoring node usage 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 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; determine that the transaction file was processed at the first node; access the transaction file to determine the type of processing that occurred at the first node; 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-readable program code to: determine that the transaction file was not processed at a second node as it was processed; and store information related to the transaction file bypassing the second node at a datastore comprising a plurality of entries comprising information regarding transaction file processing. 3 . The monitoring system of claim 2 , 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. 4 . The monitoring system of claim 3 , 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. 5 . The monitoring system of claim 1 , wherein the processing device is further configured to execute the computer-executable program code to: determine that the transaction file experienced a bottleneck within the transaction flow at the first node; and store information related to the transaction file experiencing the bottleneck at the second node at a datastore comprising a plurality of entries comprising information regarding transaction file processing. 6 . The monitoring system of claim 5 , 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 experiencing a bottleneck within the transaction flow at the first node; and determine, based at least in part on the information related to the transaction file experiencing a bottleneck at the first node, that the first node is a bottleneck node. 7 . The monitoring system of claim 6 , 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. 8 . The monitoring system of claim 6 , 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-writing of at least a portion of code associated with the first node in a memory of the transaction processing system. 9 . 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. 10 . A computer program product for monitoring node usage 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 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; an executable portion configured for determining that the transaction file was processed at the first node; an executable portion configured for accessing the transaction file to determine the type of processing that occurred at the first node; and an executable portion configured for performing an action related to the type of processing that occurred at the first node. 11 . The computer program product of claim 10 , wherein the computer-readable program code portions further comprise: an executable portion configured for determine that the transaction file was not processed at a second node as it was processed; and an executable portion configured for storing information related to the transaction file bypassing the second node at a datastore comprising a plurality of entries comprising information regarding transaction file processing. 12 . The computer program product of claim 11 , 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. 13 . The computer program product of claim 12 , 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. 14 . The computer program product of claim 10 , wherein the computer-readable program code portions further comprise: an executable portion configured for determining that the transaction file experienced a bottleneck within the transaction flow at the first node; and an executable portion configured for storing information related to the transaction file experiencing the bottleneck at the second node at a datastore comprising a plurali
involving a payment switch or gateway · CPC title
Measuring contribution of individual network components to actual service level · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.