Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

BIO-MESH NETWORK LEVERAGING NATURAL SELECTION OPTIMIZATION FOR INTELLIGENT AUTO-HEALING

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Publication Date:
    August 17, 2023
  • Additional Information
    • Document Number:
      20230259917
    • Appl. No:
      17/669493
    • Application Filed:
      February 11, 2022
    • Abstract:
      Apparatus and methods for accelerating the remediation of broken transactions using parallel machine learning processing and optimization is provided. The methods may include a network access point receiving, from an application programming interface, a broken transaction. The methods may also include a network access point selecting a bionic element within a bio-mesh network for processing the broken transaction and routing the broken transaction to the bionic element. The bio-mesh network may include a plurality of bionic elements. The methods may further include the bionic element receiving the broken transaction and extracting, from the broken transaction, a set of features, transmitting the set of features to a policy bank, and, in response to the policy bank failing to identify a stored routine associated with the set of features for fixing the broken transaction, running in parallel two machine-learning algorithms to identify an optimal routine for fixing the broken transaction.
    • Claim:
      1. A method for accelerating the remediation of broken transactions using parallel machine learning processing and optimization, the method comprising: a network access point receiving, from an application programming interface (“API”), a broken transaction; the network access point for selecting a bionic element within a bio-mesh network for processing the broken transaction and routing the broken transaction to the bionic element; the bionic element for: receiving the broken transaction and extracting, from the broken transaction, a set of features; transmitting the set of features to a policy bank; in response to the policy bank failing to identify a stored routine associated with the set of features for fixing the broken transaction: identifying, from a header of the broken transaction, each instance of the transaction being processed by a processing entity; assigning to each instance, in chronological order, a step number, to represent the transaction as a sum of nx steps from x=0 to x=n; for each step, comparing information stored in the header associated with the step to compliance protocols; identifying a subset of the steps that fail to satisfy one or more of the compliance protocols; feed the sequence of steps, the subset of the steps, and, for each step in the subset, information detailing the one or more failures to meet the compliance protocols, to both a firefly algorithm (“FI”) and a genetic algorithm (“GA”); run the FI and GA, in parallel, and receive from the FI and GA outputs including, for each step in the subset, one or more solutions; using an optimization algorithm set to optimize speed only, selecting from the outputs of the FI and GA, for each step, a first optimized solution; combining each first optimized solution to create a first policy; transmit the first policy to a policy application pipeline; the policy application pipeline for implementing the first policy to the broken transaction to convert the broken transaction to a first fixed transaction and transmit the first fixed transaction to the network access point; the network access point for: transmitting the first fixed transaction to the API; in response to the transmission, receiving a response from the API indicating that the first fixed transaction has been rejected; transmitting a command to the bionic element to output a second policy to fix the broken transaction; the bionic element for: adjusting the optimization algorithm to optimize both speed and accuracy; using the adjusted optimization algorithm, selecting from the outputs of the FI and GA, for each step, a second optimized solution; combining each second optimized solution to create a second policy; and transmitting the second policy to the policy application pipeline; and the policy application pipeline for implementing the second policy to the broken transaction to convert the broken transaction to a second fixed transaction and transmit the second fixed transaction to the network access point.
    • Claim:
      2. The method of claim 1 further comprising the network access point performing the method steps of: transmitting the second fixed transaction to the API; and in response to the transmission, receiving a response from the API indicating that the second fixed transaction has been accepted.
    • Claim:
      3. The method of claim 2 further comprising the network access point, in response to the receipt of the response from the API indicating that the second fixed transaction has been accepted, transmitting an instruction to the bionic element to upload to the policy bank the set of features and the second policy.
    • Claim:
      4. The method of claim 3 further comprising the bionic element uploading to the policy bank the set of features and the second policy.
    • Claim:
      5. The method of claim 1 wherein the set of features includes an account time stamp, a transaction type, a transaction amount, a transaction time stamp, an origin account and a destination account.
    • Claim:
      6. The method of claim 1 wherein the compliance protocols include a match between a debit entry and a corresponding credit entry, an incorrect value date, and the requirement of each step being associated with a key generated during the step by the processing entity.
    • Claim:
      7. The method of claim 1 wherein the network access point, prior to transmitting the first fixed transaction to the API, searches a log file stored in a gateway cache to retrieve a communication protocol associated with the API.
    • Claim:
      8. The method of claim 1 wherein: the bio-mesh network includes a plurality of bionic elements; and the bio-mesh network selects the bionic element from the plurality of bionic elements for the processing of the broken transaction.
    • Claim:
      9. The method of claim 1, when the bio-mesh network includes a plurality of bionic elements, further comprising a gateway cache that performs the method steps of: storing a log recording the routing of broken transactions from the network access point to the plurality of bionic elements; and maintaining a prioritization algorithm used by the network access point to determine which bionic element in the plurality of bionic elements should receive an incoming broken transaction.
    • Claim:
      10. The method of claim 1, when the bionic element is a first bionic element and the broken transaction is a first broken transaction, further comprising the first bionic element performing the method steps of: searching a gateway cache to determine if a second bionic element included in the bio-mesh network is currently processing a second broken transaction having features similar to features of the first broken transaction, the similarity being set to a pre-stored percentage similarity; putting on hold the processing of the first broken transaction and beginning to process a third broken transaction received from the network access point when the gateway cache stores data identifying a second broken transaction currently being processed that has a similarity equal to or greater than the pre-stored percentage similarity; and proceeding to execute the identifying of each instance of the first transaction being processed by a processing entity when the gateway cache does not store data identifying a second broken transaction being currently processed with at least the pre-stored percentage similarity; wherein: the searching the gateway cache is performed after the policy bank fails to identify a stored routine associated with the set of features and prior to the first bionic element executing the identifying of each instance of the transaction being processed by a processing entity.
    • Claim:
      11. A method for accelerating the remediation of broken transactions using parallel machine learning processing and optimization, the method comprising: a network access point receiving, from an application programming interface (“API”), a broken transaction; the network access point for selecting a bionic element within a bio-mesh network for processing the broken transaction and routing the broken transaction to the bionic element; the bionic element for: receiving the broken transaction and extracting, from the broken transaction, a set of features; transmitting the set of features to a policy bank; in response to the policy bank failing to identify a stored routine associated with the set of features for fixing the broken transaction: identifying, from a header of the broken transaction, each instance of the transaction being processed by a processing entity; assigning to each instance, in chronological order, a step number, to represent the transaction as a sum of nx steps from x=0 to x=n; identifying, based on the information stored in the header, one or more errors in a subset of the n steps, each error including one or more of a mismatch between a debit entry and a corresponding credit entry, an incorrect value date, and failure to be associated with a key; feed the sequence of steps, the subset of the steps, and, for each step in the subset, the errors identified, to both a firefly algorithm (“FI”) and a genetic algorithm (“GA”); run the FI and GA, in parallel, and receive from the FI and GA outputs including, for each step in the subset, one or more solutions; using an optimization algorithm set to optimize speed only, selecting from the outputs of the FI and GA, for each step, a first optimized solution; combining each first optimized solution to create a first policy; transmit the first policy to a policy application pipeline; the policy application pipeline for implementing the first policy to the broken transaction to convert the broken transaction to a first fixed transaction and transmit the first fixed transaction to the network access point; the network access point for: transmitting the first fixed transaction to the API; in response to the transmission, receiving a response from the API indicating that the first fixed transaction has been rejected; transmitting a command to the bionic element to output a second policy to fix the broken transaction; the bionic element for: adjusting the optimization algorithm to optimize both speed and accuracy; using the adjusted optimization algorithm, selecting from the outputs of the FI and GA, for each step, a second optimized solution; combining each second optimized solution to create a second policy; and transmitting the second policy to the policy application pipeline; the policy application pipeline for implementing the second policy to the broken transaction to convert the broken transaction to a second fixed transaction and transmit the second fixed transaction to the network access point; the network access point for: transmitting the second fixed transaction to the API; in response to the transmission, receiving a response from the API indicating that the second fixed transaction has been accepted; transmitting an instruction to the bionic element to upload to the policy bank the set of features and the second policy.
    • Claim:
      12. The method of claim 11 wherein the set of features includes an account time stamp, a transaction type, a transaction amount, a transaction time stamp, an origin account and a destination account.
    • Claim:
      13. The method of claim 11, when the bio-mesh network includes a plurality of bionic elements, further comprising a gateway cache that performs the method steps of: storing a log recording the routing of broken transactions from the network access point to the plurality of bionic elements; and maintaining a prioritization algorithm used by the network access point to determine which bionic element in the plurality of bionic elements should receive an incoming broken transaction.
    • Claim:
      14. The method of claim 11, when the bionic element is a first bionic element and the broken transaction is a first broken transaction, further comprising the first bionic element performing the method steps of: searching a gateway cache to determine if a second bionic element included in the bio-mesh network is currently processing a second broken transaction having features similar to features of the first broken transaction, the similarity being set to a pre-stored percentage similarity; putting on hold the processing of the first broken transaction and beginning to process a third broken transaction received from the network access point when the gateway cache stores data identifying a second broken transaction currently being processed that has a similarity equal to or greater than the pre-stored percentage similarity; and proceeding to execute the identifying of each instance of the first transaction being processed by a processing entity when the gateway cache does not store data identifying a second broken transaction being currently processed with at least the pre-stored percentage similarity; wherein: the searching the gateway cache is performed after the policy bank fails to identify a stored routine associated with the set of features and prior to the first bionic element executing the identifying of each instance of the transaction being processed by a processing entity.
    • Claim:
      15. A method for accelerating the remediation of broken transactions using parallel machine learning processing and optimization, the method comprising: a network access point receiving, from an application programming interface (“API”), a broken transaction; the network access point for selecting a bionic element within a bio-mesh network for processing the broken transaction and routing the broken transaction to the bionic element; the bionic element for: receiving the broken transaction and extracting, from the broken transaction, a set of features; transmitting the set of features to a policy bank; in response to the policy bank failing to identify a stored routine associated with the set of features for fixing the broken transaction: identifying, from a header of the broken transaction, each instance of the transaction being processed by a processing entity; assigning to each instance, in chronological order, a step number, to represent the transaction as a sum of nx steps from x=0 to x=n; for each step, comparing information stored in the header associated with the step to compliance protocols; identifying a subset of the steps that fail to satisfy one or more of the compliance protocols; feed the sequence of steps, the subset of the steps, and, for each step in the subset, information detailing the one or more failures to meet the compliance protocols, to both a firefly algorithm (“FI”) and a genetic algorithm (“GA”); run the FI and GA, in parallel, and receive from the FI and GA outputs including, for each step in the subset, one or more solutions; combining the outputs of the FI and GA to create all possible solution sets, each solution set including one of the output solutions for each step in the subset; using an optimization algorithm, selecting from the solution sets the most optimal solution set, the second-most optimal solution set, and the third-most optimal solution step; transmit to a policy application pipeline the most optimal solution set, the second-most optimal solution set, and the third-most optimal solution step; the policy application pipeline for implementing the most optimal solution set to the broken transaction to convert the broken transaction to a first fixed transaction and transmit the first fixed transaction to the network access point; the network access point for: transmitting the first fixed transaction to the API; in response to the transmission, receiving a response from the API indicating that the first fixed transaction has been rejected; transmitting a command to policy application pipeline to fix the broken transaction; the policy application pipeline for implementing the second-most optimal solution set to the broken transaction to convert the broken transaction to a second fixed transaction and transmit the second fixed transaction to the network access point; the network access point for: transmitting the second fixed transaction to the API; in response to the transmission, receiving a response from the API indicating that the second fixed transaction has been accepted; transmitting an instruction to the policy application pipeline to upload to the policy bank the set of features and the second-most optimal solution set.
    • Claim:
      16. The method of claim 15 wherein the optimization algorithm is set to optimize speed only.
    • Claim:
      17. The method of claim 15 wherein the set of features includes an account time stamp, a transaction type, a transaction amount, a transaction time stamp, an origin account and a destination account.
    • Claim:
      18. The method of claim 15 wherein the network access point, prior to transmitting the first fixed transaction to the API, searches a log file stored in a gateway cache to retrieve a communication protocol associated with the API.
    • Claim:
      19. The method of claim 15 wherein: the bio-mesh network includes a plurality of bionic elements; and the bio-mesh network selects the bionic element from the plurality of bionic elements for the processing of the broken transaction.
    • Claim:
      20. The method of claim 15, when the bio-mesh network includes a plurality of bionic elements, further comprising a gateway cache that performs the method steps of: storing a log recording the routing of broken transactions from the network access point to the plurality of bionic elements; and maintaining a prioritization algorithm used by the network access point to determine which bionic element in the plurality of bionic elements should receive an incoming broken transaction.
    • Current International Class:
      06; 06
    • Accession Number:
      edspap.20230259917