Proxy transaction request processing method and device, storage medium and electronic equipment

Abstract

The invention discloses a proxy transaction request processing method and device, a storage medium and electronic equipment, and relates to the field of financial science and technology. The method comprises the following steps: acquiring a proxy transaction request submitted by a first object through a first network node in a communication network; obtaining a total bandwidth when the proxy transaction request enters a data link between the first network node and the target network node; determining a target communication path from a plurality of communication paths existing between the first network node and the target network node according to the total bandwidth, the capacity and the initialized ant colony; and sending, by the first network node, the proxy transaction request to the target network node based on the target communication path. According to the method and the device, the technical problem that the proxy transaction request processing success rate is low due to the fact that the proxy transaction request needs to be verified by three parties including an agent, an agent and a financial institution and a data transmission link is long is solved.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of financial technology, in particular to a method and device for processing a proxy transaction request, a storage medium and an electronic device. BACKGROUND

[0002] Currently, online electronic banking services have become an important part of daily financial activities, greatly simplifying the transaction process and improving the convenience of financial services. However, for a class of bank card opening, large amount of money operation, and establishment of enterprise public account, the supervisory authorities insist that the customers must personally go to the bank counter to complete the transaction to strengthen risk management and identity verification and to ensure transaction security. Although this regulation ensures compliance, it constitutes an actual obstacle for customers who are difficult to reach the network due to health conditions, time conflicts, or geographical distances, and there is an urgent need for proxy transaction services.

[0003] Traditional proxy transaction methods rely on paper proxy forms and proxy persons carrying valid identification documents of the proxy person to the bank network, but they cannot effectively prevent the risk of forged proxy forms, and the potential illegal behavior within the bank makes the security and reliability of the entire proxy transaction process seriously questionable. More importantly, the data verification process of proxy transactions needs to go through the exchange of information among the proxy person, the proxy person, and the financial institution, and the data transmission of this long chain not only increases the time delay, resulting in a long transaction response time, but also significantly reduces the success rate of processing proxy transaction requests in unstable or congested network environments.

[0004] At present, there is no effective solution to the above problems. SUMMARY

[0005] The present application provides a method and device for processing a proxy transaction request, a storage medium and an electronic device to at least solve the technical problem that the success rate of processing proxy transaction requests is low due to the long data transmission link caused by the verification request of the proxy person, the proxy person and the financial institution.

[0006] According to an aspect of the present application, a method for processing a proxy transaction request is provided, comprising: obtaining, by a first network node in a communication network, a proxy transaction request submitted by a first subject, wherein the proxy transaction request represents a request of the first subject to proxy a second subject to conduct a target transaction with a financial institution, and wherein the first network node is a network node that communicates with an application server of the financial institution; obtaining a total bandwidth when the proxy transaction request enters a data link between the first network node and a target network node, wherein the target network node is a network node that communicates with a terminal device of the second subject; calculating a ratio of the total bandwidth to a capacity of the data link to obtain an average utilization of the data link in processing the proxy transaction request, wherein the capacity represents a maximum transmission rate of the data link; determining a target communication path from a plurality of communication paths existing between the first network node and the target network node according to the average utilization, the capacity, and an initialized ant colony, wherein the ant colony is a search process of the communication path; and sending, by the first network node, the proxy transaction request to the target network node based on the target communication path.

[0007] Optionally, before obtaining, by the first network node in the communication network, the proxy transaction request submitted by the first subject, the method further comprises: receiving, by the first network node, a reservation request sent by a terminal device of the first subject, wherein the reservation request comprises at least subject information of the first subject, an association relationship between the first subject and the second subject, a business type of the target transaction, and a time at which the first subject plans to conduct the target transaction; sending, by the first network node, the reservation request to an application server of the financial institution; receiving, by the first network node, two-dimensional code information generated by the application server in response to the reservation request, wherein the two-dimensional code information is used as a voucher for the first subject to conduct the target transaction at the financial institution; and sending, by the first network node, the two-dimensional code information to the terminal device of the first subject.

[0008] Optionally, after sending, by the first network node, the proxy transaction request to the target network node based on the target communication path, the method further comprises: receiving, by the first network node, an approval result of the second subject on the proxy transaction request returned by the target network node, wherein the approval result is generated by a terminal device of the second subject, and the approval result comprises at least signature information of the second subject and video information; and sending, by the first network node, the approval result to the application server of the financial institution.

[0009] Optionally, before determining the target communication path from the plurality of communication paths between the first network node and the target network node according to the average utilization rate, the capacity and the initialized ant colony, the method further comprises: detecting an average round trip time of network traffic traversing the data link; detecting an average queue size of the data link at a target time, wherein the average queue size is used to represent an amount of data waiting to be transmitted in the data link; detecting a traffic rate of the data link at a first time, wherein the first time is separated from the target time by a preset time length, and the first time is before the target time, and the target time is a time when the first network node sends the proxy transaction request; determining a target traffic rate of the data link at the target time according to the capacity, the average utilization rate, the average round trip time, the average queue size and the traffic rate of the data link at the first time; and determining the target communication path from the plurality of communication paths between the first network node and the target network node according to the target traffic rate and the initialized ant colony.

[0010] Optionally, before determining the target communication path from the plurality of communication paths between the first network node and the target network node according to the average utilization rate, the capacity and the initialized ant colony, the method further comprises: obtaining a pheromone concentration on an hth communication path from the first network node to the target network node, wherein the pheromone concentration is proportional to a usage frequency of the hth communication path, and the hth communication path is any one of the communication paths between the first network node and the target network node; taking a reciprocal of a path distance of the hth communication path as a heuristic value; determining a probability that the ant colony selects the hth communication path to move from the first network node to the target network node according to the heuristic value and the pheromone concentration; determining a target rule according to the probability, and initializing the ant colony according to the target rule, wherein the target rule is used to dynamically update selection of the communication path according to the pheromone and the path distance.

[0011] Optionally, determining the target communication path from the plurality of communication paths between the first network node and the target network node according to the target traffic rate and the initialized ant colony comprises: updating the pheromone according to the target traffic rate and a path length that has been passed through by the ant colony; and determining the target communication path between the first network node and the target network node at the target time according to the updated pheromone.

[0012] Optionally, determining the target communication path between the first network node and the target network node at the target time according to the updated pheromone includes: detecting a file fragment size, wherein the file fragment size is a size of the proxy transaction request; detecting a time window, wherein the time window represents a time range in which the proxy transaction request reaches the target network node; detecting a load parameter, wherein the load parameter represents a load condition of the data link when the ant colony passes through the first network node at the target time; detecting a time parameter, wherein the time parameter represents a matching degree between a time at which the proxy transaction request reaches the target network node according to the path selected by the ant colony and the time window when the ant colony passes through the first network node at the target time; determining a path distance function according to the file fragment size, the time window, the load parameter, and the time parameter; and determining the target communication path according to the path distance function and the updated pheromone.

[0013] According to another aspect of the present application, a processing apparatus for proxy transaction request is also provided, which includes: a first obtaining unit configured to obtain a proxy transaction request submitted by a first subject through a first network node in a communication network, wherein the proxy transaction request represents a request of the first subject to proxy a second subject to conduct a target transaction with a financial institution, and the first network node is a network node that communicates with an application server of the financial institution; a second obtaining unit configured to obtain a total bandwidth when the proxy transaction request enters a data link between the first network node and a target network node, wherein the target network node is a network node that communicates with a terminal device of the second subject; a first calculating unit configured to calculate a ratio of the total bandwidth to a capacity of the data link to obtain an average utilization of the data link when processing the proxy transaction request, wherein the capacity represents a maximum transmission rate of the data link; a first determining unit configured to determine a target communication path from a plurality of communication paths existing between the first network node and the target network node according to the average utilization, the capacity, and an initialized ant colony, wherein the ant colony is a search process of the communication path; and a first sending unit configured to send the proxy transaction request to the target network node based on the target communication path through the first network node.

[0014] According to another aspect of the present application, a computer readable storage medium is also provided, which includes a stored executable program, wherein the computer readable storage medium controls a device where the computer readable storage medium is located to execute the processing method for proxy transaction request when the executable program is run.

[0015] According to another aspect of the present application, an electronic device is also provided, which includes: a memory storing an executable program; and a processor configured to run the program, wherein the program is executed to perform the processing method for proxy transaction request when the program is run.

[0016] According to another aspect of the present application, a computer program product is also provided, comprising computer instructions which, when executed by a processor, implement the steps of the method for processing a proxy transaction request described above.

[0017] In the present application, first, a proxy transaction request submitted by a first subject is acquired through a first network node in a communication network, wherein the proxy transaction request represents that the first subject requests a second subject to conduct a target transaction with a financial institution, wherein the first network node is a network node in communication with an application server of the financial institution, then the total bandwidth when the proxy transaction request enters a data link between the first network node and a target network node is acquired, wherein the target network node is a network node in communication with a terminal device of the second subject, then a ratio of the total bandwidth to a capacity of the data link is calculated to obtain an average utilization of the data link when processing the proxy transaction request, wherein the capacity represents a maximum transmission rate of the data link, then according to the average utilization, the capacity and an initialized ant colony, a target communication path is determined from a plurality of communication paths existing between the first network node and the target network node, wherein the ant colony is a search process of the communication path, finally the proxy transaction request is sent to the target network node based on the target communication path through the first network node, that is, through a dynamic path optimization manner, the purpose of improving the transmission efficiency of the data link is achieved, thereby realizing the technical effect of improving the success rate and speed of processing the proxy transaction request, and further solving the technical problem in the prior art that the proxy transaction request needs to be verified by the three parties of the agent, the principal and the financial institution, the data transmission link is relatively long, resulting in a large data transmission delay and a low success rate of processing the proxy transaction request. BRIEF DESCRIPTION OF DRAWINGS

[0018] The accompanying drawings, which are included to provide a further understanding of the present application and are incorporated in and constitute a part of this application, illustrate embodiments of the present application and serve to explain the present application. In the drawings:

[0019] Figure 1-1 is a flowchart of an optional method for processing a proxy transaction request according to an embodiment of the present application;

[0020] Figure 1-2 is a structural diagram of an optional three-party proxy transaction data processing according to an embodiment of the present application;

[0021] Figure 2 is a schematic diagram of an optional bank customer intelligent terminal structure according to an embodiment of the present application;

[0022] Figure 3 is a schematic diagram of an optional communication node server structure according to an embodiment of the present application;

[0023] Figure 4 is a flow chart of an optional three-party proxy transaction data processing according to an embodiment of the present application;

[0024] Figure 5 is a schematic diagram of an optional proxy transaction request processing device according to an embodiment of the present application. DETAILED DESCRIPTION

[0025] In order to enable persons skilled in the art to better understand the scheme of the present application, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by persons skilled in the art without creative labor should fall within the scope of protection of the present application.

[0026] It should be noted that the terms "first", "second" and the like in the specification and claims of the present application and the above-described drawings are used to distinguish similar objects, and do not necessarily indicate a specific order or a chronological sequence. It should be understood that the data thus used can be interchanged under appropriate circumstances, so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device that includes a series of steps or units does not have to be limited to only those steps or units clearly listed, but can include other steps or units not clearly listed or inherent to the process, method, product or device.

[0027] It should be noted that the collected information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for display, analyzed data, etc.) involved in the present application are information and data authorized by the user or authorized by all parties, and the collection, storage, use, processing, transmission, provision, disclosure and application of related data comply with relevant laws, regulations and standards, necessary security measures are taken, do not violate public order and good customs, and provide corresponding operation portal for user to choose authorization or refusal. For example, the system and related users or institutions are provided with an interface to provide the user with a corresponding operation portal for the user to choose to agree or refuse the automatic decision result; if the user chooses to refuse, the expert decision process is entered.

[0028] It should be noted that an intelligent processing system can serve as an execution subject of the proxy transaction request processing method of the embodiments of the present application. It can be understood that the proxy transaction request processing method provided by the embodiments of the present application can also be executed by other systems or devices as execution subjects, which are not limited by the embodiments of the present application.

[0029] According to the embodiments of the present application, a method embodiment of a method for processing a proxy transaction request is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although the logical order is shown in the flowchart, in some cases, the steps shown or described herein can be executed in a different order.

[0030] Figure 1-1 is a schematic diagram of an optional method for processing a proxy transaction request according to the embodiments of the present application, as shown in Figure 1-1 The method comprises the following steps:

[0031] In step S101, a first network node in a communication network obtains a proxy transaction request submitted by a first object.

[0032] In step S101, the proxy transaction request represents that the first object requests to proxy a second object to conduct a target transaction with a financial institution.

[0033] In step S101, the first network node is a network node that communicates with an application server of the financial institution.

[0034] Optionally, the first network node is a specific node in the communication network, which serves as a starting point to receive the proxy transaction request from the first object (i.e. a bank customer). In this embodiment, this node can be a bank server or a network node that directly communicates with the bank server.

[0035] Optionally, the proxy transaction request refers to a request initiated by the bank customer, which requires the bank or financial institution to allow a specified second object (proxy) to conduct a specific transaction on behalf of the first object, such as card opening, large amount withdrawal or transfer, etc.

[0036] In step S102, the total bandwidth of the data link between the first network node and the target network node when the proxy transaction request enters the data link is obtained.

[0037] In step S102, the target network node is a network node that communicates with a terminal device of the second object.

[0038] Optionally, the target network node refers to another specific node in the communication network, which is responsible for communicating with the terminal device of the second object (i.e. the proxy).

[0039] Optionally, the data link refers to a physical or logical connection between the first network node and the target network node for data transmission.

[0040] In step S103, the ratio of the total bandwidth to the capacity of the data link is calculated to obtain the average utilization of the data link in processing the proxy transaction request.

[0041] In step S103, the capacity characterizes the maximum transmission rate of the data link.

[0042] Optionally, the capacity refers to the maximum transmission rate of the data link, i.e., the highest transmission speed it can theoretically reach.

[0043] Optionally, the intelligent processing system obtains the average utilization of the data link in processing the agent transaction request by calculating the ratio of the total bandwidth to the capacity of the data link.

[0044] In step S104, the target communication path is determined from the multiple communication paths existing between the first network node and the target network node according to the average utilization, the capacity, and the initialized ant colony.

[0045] In step S104, the ant colony is used for the search process of the communication path.

[0046] Optionally, in the ant colony optimization (ACO), the initial state of the ant colony refers to the initial distribution of pheromone between nodes at the beginning of the algorithm. In this step, the ant colony is used as a tool for searching and optimizing the communication path.

[0047] Optionally, the target communication path refers to the optimal path selected from multiple available communication paths based on certain criteria for transmitting the agent transaction request.

[0048] Optionally, the intelligent processing system can effectively find a path that can avoid network congestion, ensure data transmission safety and timeliness by considering the average utilization, capacity of the link, and exploring different communication paths using the ant colony algorithm. The ant colony algorithm simulates the path selection behavior of ants searching for food and uses pheromone to optimize path selection, so that a relatively optimal communication path can be found even in the case of network environment changes or high load.

[0049] In step S105, the agent transaction request is sent to the target network node based on the target communication path through the first network node.

[0050] Optionally, the intelligent processing system selects the target communication path, so that the data packets of the agent transaction request will be transmitted from the first network node to the target network node along this path, ensuring safe and efficient transmission of data, so that the verification and processing of the agent transaction can be completed in time.

[0051] Optionally, Figure 1-2 is an optional structure diagram of a three-party agent transaction data processing according to an embodiment of the present application, as shown in Figure 1-2As shown, the structure diagram includes a bank point of sale counter, a bank server, a communication source node server, a communication node server, a communication destination node server, a communication network, a bank customer intelligent terminal and an agent intelligent terminal, etc. Among them, the bank customer mobile terminal is connected with the communication destination node server through a wireless network, the bank point of sale counter is connected with the bank server of the bank through a network, the bank server is connected with the communication source node server through a network, and each communication node server is connected with each other through a communication network. Among them, the bank customer intelligent terminal can install a bank online client and can provide an interface for the customer to initiate a reservation transaction and real-time authentication transaction; the agent intelligent terminal can receive the agent business two-dimensional code forwarded by the bank customer; the bank point of sale counter is a traditional bank business counter terminal for customers to handle bank business, which can initiate a three-party agent business according to the request of the agent in the embodiment; the bank server is responsible for processing the reservation business for the bank customer and saving the business processing record, querying the reservation business archive database according to the transaction request of the agent, and initiating the three-party (point of sale counter, agent, agent) authentication authorization data processing; the communication node server is a node participating in the transmission of transaction data, which can be located inside or outside the network address translation node, is responsible for establishing a secure channel with other nodes and performing secure data transmission, and is provided with a data transmission module on the node server, which adopts a low-delay network control strategy training method with load optimization; the structure and function of the communication source node server and the communication destination node server are the same as those of the communication node server, and are also provided with a data transmission module adopting a low-delay network control strategy training method with load optimization. In addition, the communication source node server is connected with the bank server, and after the bank server initiates a third-party agent transaction request, the communication source node server initiates a data communication request to each communication node server of the communication network, and the target address is the address of the communication destination node server.

[0052] It can be known from the contents of steps S101 to S105 that, in the present application, first, the first object submits a proxy transaction request through the first network node in the communication network, wherein the proxy transaction request represents the first object requesting the second object to conduct a target transaction with the financial institution, wherein the first network node is a network node that communicates with the application server of the financial institution, then the total bandwidth of the proxy transaction request entering the data link between the first network node and the target network node is obtained, wherein the target network node is a network node that communicates with the terminal device of the second object, then the ratio of the total bandwidth to the capacity of the data link is calculated to obtain the average utilization of the data link in processing the proxy transaction request, wherein the capacity represents the maximum transmission rate of the data link, then the average utilization, the capacity and the initialized ant colony are used to determine the target communication path from the plurality of communication paths between the first network node and the target network node, wherein the ant colony is a search process of the communication path, finally the first network node sends the proxy transaction request to the target network node based on the target communication path, that is, through the dynamic path optimization, the purpose of improving the transmission efficiency of the data link is achieved, thereby realizing the technical effect of improving the success rate and speed of processing the proxy transaction request, and further solving the technical problem that in the prior art, since the proxy transaction request needs to be verified by the three parties of the agent, the principal and the financial institution, the data transmission link is long, which causes the data transmission delay to be large, and the success rate of processing the proxy transaction request is low.

[0053] In an optional embodiment, the intelligent processing system first receives a reservation request sent by the terminal device of the first object through the first network node, wherein the reservation request at least includes object information of the first object, an association relationship between the first object and the second object, a business type of the target transaction and a time at which the first object plans to handle the target transaction, second, the first network node sends the reservation request to the application server of the financial institution, then the first network node receives the two-dimensional code information generated by the application server for the reservation request, wherein the two-dimensional code information is used as a voucher for the first object to handle the target transaction at the financial institution, and finally the first network node sends the two-dimensional code information to the terminal device of the first object.

[0054] Optionally, the intelligent processing system first receives a reservation request from a terminal device (such as a smartphone, tablet, etc.) of the first object (bank customer) through the first network node, the reservation request containing important information such as the object information of the first object (including but not limited to name, ID number, contact information, etc.), the association between the first object and the second object (agent) (such as a letter of authorization or authorization information), the business type of the target transaction (e.g., opening a bank card, large cash withdrawal or transfer, etc.), and the time the first object plans to have the target transaction handled (reservation time period), and then forwards the received reservation request data to the application server of the financial institution through the first network node. The application server is located inside the bank and is responsible for processing all online requests and transactions of customers. Through this step, the bank can preliminarily review the reservation request, verify the accuracy of the customer information and the compliance of the transaction, and at the same time, store the reservation information in the system for quick calling and verification when the transaction is performed. Then, the application server generates a unique two-dimensional code information after receiving and processing the reservation request. The two-dimensional code contains detailed information of the reservation transaction and a unique code, which can be used as a voucher for the first object to have the target transaction handled by the second object at the financial institution. The generation of the two-dimensional code is based on a secure encryption algorithm to ensure its non-falsifiable and easy-to-verify characteristics. Finally, the intelligent processing system sends the two-dimensional code information back to the terminal device of the first object (bank customer) through the first network node. The customer can forward this two-dimensional code to the second object (agent) as a proxy transaction voucher. The agent only needs to carry the two-dimensional code and necessary identity documents to complete the proxy transaction at the bank during the reserved time.

[0055] As can be seen from the above, the intelligent processing system processes the reservation request through digitization and automation, allowing the bank customer to remotely and securely reserve the transaction and authorize the agent to perform the proxy transaction through the high-security two-dimensional code. This design greatly reduces the use of physical identification documents, avoids the risk of forgery, and improves the efficiency of transactions and customer experience. In addition, the use of two-dimensional codes also facilitates the bank to record and track the transaction process, further enhancing the transparency and compliance of the system.

[0056] In an optional embodiment, the intelligent processing system first receives the approval result of the agent regarding the proxy transaction request returned by the target network node through the first network node, wherein the approval result is generated by the terminal device of the second object, and the approval result at least includes the signature information and video information of the second object, and then sends the approval result to the application server of the financial institution through the first network node.

[0057] Optionally, the intelligent processing system receives the approval result returned by the target network node through the first network node. The target network node is the network node that communicates with the terminal device of the second object (the agent) and is responsible for receiving and processing the approval information of the agent transaction request of the second object. The approval result is generated by the terminal device of the second object and contains rich verification information, the key components of which include the signature information of the second object, which is used to prove that the approval is made by the authorized agent, and the video information, which records all the operations and interactions of the second object during the approval process, ensuring the transparency and traceability of the approval process. Then, after receiving the approval result, the intelligent processing system immediately forwards the approval result data to the application server of the financial institution through the first network node. The application server is the core component of the bank backend and is responsible for processing all transaction-related logic and data storage.

[0058] As can be seen from the above, the intelligent processing system can remotely and in real time obtain the approval result generated by the second object, which contains signature information and video information, proving the legality of the approval and providing a complete record of the approval process. This design greatly reduces the human error and fraud risk in the traditional approval process, while improving the processing speed and providing a better service experience for customers and banks. In addition, the existence of video information ensures the traceability of each transaction, meets the compliance requirements of financial supervision, and enhances the trust of the entire transaction system.

[0059] In an optional embodiment, the intelligent processing system first detects the average round-trip time of network traffic traversing the data link, then detects the average queue size of the data link at the target time, wherein the average queue size is used to represent the amount of data waiting to be sent in the data link, then detects the traffic rate of the data link at the first time, wherein the first time is separated from the target time by a preset time length, and the first time is before the target time, and the target time is the time when the first network node sends the agent transaction request, and then determines the target traffic rate of the data link at the target time according to the capacity, the average utilization rate, the average round-trip time, the average queue size, and the traffic rate of the data link at the first time, and finally determines the target communication path from the multiple communication paths between the first network node and the target network node according to the target traffic rate and the initialized ant colony.

[0060] Optionally, the intelligent processing system first detects the average round-trip time of network traffic traversing the data link through the first network node, which is a measure of the average time for a data packet to be sent and received, and has a direct impact on network latency. Next, the system detects the average queue size of the data link at the target time, which reflects the amount of data waiting to be sent in the data link and is an important indicator of network congestion. A larger average queue size means that the data link may be in a high-load state, which will affect the timeliness and efficiency of data transmission. Then, the system detects the traffic rate of the data link at the first time (i.e., the amount of data transmitted per unit time), where the first time is separated from the target time (the time when the first network node sends the proxy transaction request) by a predetermined time length, and the first time is before the target time. The detection of traffic rate helps the system understand the bandwidth usage of the data link before the target transaction request is sent, providing a basis for subsequent adjustment of the target traffic rate.

[0061] Optionally, based on the detected capacity, average utilization, average round-trip time, average queue size, and traffic rate of the data link at the first time, the intelligent processing system determines the target traffic rate of the target data link at the target time through a specific algorithm. The determination of the target traffic rate is the key to optimizing the data transmission strategy, aiming to ensure that the proxy transaction request can be transmitted at the best speed when sent, while avoiding network congestion. Finally, the intelligent processing system determines the target traffic rate and the initialized ant colony algorithm to calculate and select the optimal target communication path from the multiple communication paths between the first network node and the target network node. The ant colony algorithm simulates the behavior of ants finding the shortest path and dynamically adjusts path selection using pheromone updates. In this step, the system optimizes the traffic rate control strategy, combines the actual state of the data link, and uses the dynamic characteristics of the ant colony algorithm to automatically select a stable, high-speed, and secure communication path for the transmission of the proxy transaction request.

[0062] From the above, the intelligent processing system can dynamically adjust the target traffic rate by real-time monitoring and analyzing key network traffic indicators, ensuring efficient and secure data transmission. Combined with the path selection mechanism of the ant colony algorithm, the intelligent processing system can automatically optimize the communication path, ensuring timely and accurate transmission of the proxy transaction request even in the case of network environment changes or high load. This intelligent optimization strategy greatly improves the stability and timeliness of the system, reduces delays and errors in transaction processing, and enhances the security of transactions, ensuring the smooth progress of financial transactions and meeting regulatory requirements.

[0063] In an alternative embodiment, the intelligent processing system first acquires the pheromone concentration on the hth communication path from the first network node to the target network node, where the pheromone concentration is proportional to the usage frequency of the hth communication path, which is any one of the communication paths between the first network node and the target network node, then takes the reciprocal of the path distance of the hth communication path as the heuristic value, thereafter determines the probability of the ant colony selecting the hth communication path from the first network node to the target network node according to the heuristic value and the pheromone concentration, and finally determines the target rule according to the probability and initializes the ant colony according to the target rule, where the target rule is used to dynamically update the selection of the communication path according to the pheromone and the path distance.

[0064] Alternatively, the intelligent processing system first acquires the pheromone concentration on the hth communication path, where the pheromone is a virtual index used to simulate the "trace" left by ants in the process of finding food, guiding subsequent ants to select paths, and the pheromone concentration is proportional to the usage frequency of the path, i.e. the more a path is used, the higher its pheromone concentration, which indicates that this path is likely to be more stable and faster, then the system takes the reciprocal of the path distance of the hth communication path as the heuristic value, which can be understood as the attractiveness of the path, and the shorter the path distance (i.e. the larger the reciprocal), the more beneficial it is theoretically for fast transmission, but the actual situation needs to be considered comprehensively in combination with the current state of the path (such as capacity, traffic, etc.), the calculation of the heuristic value provides an intuitive reference for path selection in the ant colony algorithm, enabling the algorithm to give priority to paths with shorter distances, but also taking into account the real-time performance of the path, thereafter, the intelligent processing system calculates the probability of the ant colony selecting the hth communication path from the first network node to the target network node according to the heuristic value and the pheromone concentration of the hth communication path. The calculation of the path selection probability is a core link in the ant colony algorithm, which determines the decision direction of the ant colony in searching for the optimal path, usually, the probability calculation considers both the heuristic value (the reciprocal of the path distance) and the pheromone concentration to dynamically balance the attractiveness of the path and its historical performance, finally, the system determines the target rule according to the path selection probability and initializes the ant colony according to the rule, the target rule is a criterion used to guide the update of the pheromone and the selection of the path in the ant colony algorithm, which ensures that the algorithm follows a certain logic in the search process rather than being completely random, and the initialization of the ant colony means preparing the initial state for the operation of the algorithm, including the number of ant colonies, the starting position, etc. Through the guidance of the target rule, the intelligent processing system can ensure that the ant colony algorithm considers both the historical performance (pheromone concentration) and the real-time conditions (heuristic value) in the process of dynamically updating the selection of the communication path, thereby realizing intelligent selection and optimization of the path.

[0065] From the above, the intelligent processing system can intelligently analyze and evaluate the real-time performance and historical stability of different communication paths by obtaining pheromone concentration and calculating heuristic values, combined with the ant colony algorithm. The system can dynamically determine the path selection probability and ultimately select the best communication path. This process not only improves the efficiency and stability of data transmission, but also enhances the adaptability and security of the entire system. Even in complex situations such as network traffic fluctuations and network congestion, it can ensure the rapid and secure transmission of proxy transaction requests, thereby improving the user experience of financial services and the business processing capacity of financial institutions. At the same time, the dynamic updating mechanism based on pheromone and path distance ensures that the system can continuously optimize the path selection strategy, further improving the efficiency and reliability of data processing.

[0066] In an alternative embodiment, the intelligent processing system updates the pheromone based on the target traffic rate and the length of the path that the ant colony has passed through, and determines the target communication path between the first network node and the target network node at the target time based on the updated pheromone.

[0067] Optionally, the intelligent processing system updates the pheromone based on the target traffic rate and the length of the path that the ant colony has passed through. The update of the pheromone is a key step in the ant colony algorithm, which reflects the usage and performance of the path. The target traffic rate serves as the goal of network optimization, guiding the direction of pheromone adjustment. The consideration of path length reflects the evaluation of path efficiency. The shorter the path, the faster the concentration of pheromone will theoretically increase, but at the same time, the system also needs to consider the real-time traffic conditions and network bandwidth of the path. After updating the pheromone, the intelligent processing system determines the target communication path between the first network node and the target network node at the target time based on the updated pheromone concentration and the current network environment information (such as bandwidth, delay, etc.). The selection of the target communication path is based on the comparison of the pheromone concentration of all possible paths. The higher the concentration, the greater the probability of path selection. This process ensures that path selection considers both historical usage and real-time network status, thereby selecting the best communication path in the current network environment for the transmission of proxy transaction requests.

[0068] From the above, the intelligent processing system realizes path optimization in complex network environments by dynamically updating pheromones and combining target traffic rates. The pheromone update mechanism can quickly adapt to changes in network traffic, guiding the ant colony algorithm to intelligently select efficient communication paths that have appropriate traffic rates and shorter path lengths at the target time. This strategy not only improves the transmission speed and stability of proxy transaction requests, but also significantly reduces network congestion and delay, ensuring the real-time and reliability of financial services. At the same time, through continuous pheromone updating, the system can respond to network changes in a timely manner, continuously optimize communication paths, and further improve data processing efficiency.

[0069] In an alternative embodiment, the intelligent processing system first detects the file fragment size, where the file fragment size is the size of the proxy transaction request, then detects the time window, where the time window represents the time range for the proxy transaction request to arrive at the target network node, then detects the load parameter, where the load parameter represents the load of the data link when the ant colony passes through the first network node at the target time, then detects the time parameter, where the time parameter represents the matching degree of the time for the proxy transaction request to arrive at the target network node according to the path selected by the ant colony and the time window when the ant colony passes through the first network node at the target time, then determines the path distance function according to the file fragment size, the time window, the load parameter and the time parameter, and finally determines the target communication path according to the path distance function and the updated pheromones.

[0070] Optionally, the intelligent processing system first detects the size of the proxy transaction request, i.e. the file fragment size, which is to evaluate the resource occupation of the transaction request in network transmission, and different sizes of file fragments will affect the transmission efficiency and required bandwidth of the network; then, the system detects the time window, i.e. the expected time range for the proxy transaction request to arrive at the target network node, considering the urgency of the transaction and the delay characteristics of the network to ensure that the transaction request can be processed within a reasonable time and avoid transaction delays due to network delay; then, the intelligent processing system detects the data link load when the ant colony k passes through the first network node at the target time, i.e. the load parameter, which reflects the carrying capacity of the network in processing the current transaction request, and high load may mean network congestion, affecting the efficiency of transaction processing; the system continues to detect the time parameter, which measures the matching degree of the time for the proxy transaction request to arrive at the target network node according to the path selected by the ant colony and the time window when the ant colony passes through the first network node at the target time, which helps the system optimize path selection and ensure that the transaction request can arrive at the target node within the expected time window, improving the real-time and reliability of the transaction.

[0071] Optionally, after collecting the file fragment size, time window, load parameter and time parameter, the intelligent processing system adjusts the path distance function according to these parameters. The adjustment of the path distance function is to solve the dynamic network problems that the traditional static routing may encounter. Finally, the intelligent processing system determines the target communication path according to the adjusted path distance function and the updated pheromone concentration. The concentration of pheromones is related to the historical usage frequency and performance of the path, while the path distance function reflects the actual cost of the path under the current network environment. By combining the two, the system can intelligently evaluate and select a path that best meets the current network conditions and transaction demands for efficient transmission of proxy transaction requests.

[0072] Optionally, the path distance function μ is shown in formula (1):

[0073]

[0074] where size represents the file fragment size, w represents the time window, δ j (k, t) represents the load parameter (the load condition of the link when the ant group k passes through the path j at time t), ε j (k, t) represents the time parameter (the degree of coincidence of path selection with the time window when the ant group k passes through the path j at time t).

[0075] From the above, the intelligent processing system detects and analyzes key information such as file fragment size, time window, load parameter, time parameter, dynamically adjusts the path distance function, and improves the intelligent level of path selection. The intelligent processing system can determine a target communication path that meets the size and time requirements of transaction requests and adapts to network load conditions according to real-time network status through the dynamic optimization mechanism of the ant colony algorithm. This strategy significantly improves the efficiency and security of proxy transaction requests in network transmission, effectively avoids network congestion and delay problems, and ensures the real-time performance of financial services and the optimization of user experience.

[0076] In an optional embodiment, the intelligent processing system issues a communication encryption protocol to the user terminal device of the first object through the first network node, wherein the communication encryption protocol is used to generate a registered account, key information bound to the user, and a personal digital certificate for the user according to user-provided user information. After generating the registered account, a master key, a user key, and a public key corresponding to the registered account are generated. The intelligent processing system receives a proxy transaction request encrypted by the user terminal device based on the communication encryption protocol through the first network node.

[0077] Optionally, the intelligent processing system issues a communication encryption protocol to the user terminal device of the first object through the first network node, the communication encryption protocol is a rule set for protecting the security of network communication, which specifies the encryption algorithm, the key generation and use mode, and the format and process of data transmission. On the user terminal device, according to the communication encryption protocol, the system will generate a registered account, key information bound to the account, and a personal digital certificate. The registered account is the unique identifier of the user in the system, which is used to record the personal information and transaction history of the user. The key information includes the master key, the user key, and the public key, which are the keys to perform encryption and decryption operations, ensuring the security of data in the transmission process. The personal digital certificate is an electronic certificate used to verify the identity of the user, which contains the public key and identity information of the user, and is signed and authenticated by a trusted third-party institution, ensuring the non-tamperability of the identity information and the traceability of the transaction. After the registered account is generated, the intelligent processing system continues to generate the master key, the user key, and the public key corresponding to the account. The master key is the core key of the system, which is used to generate other keys or manage keys. The user key is the key assigned to the user, which is used for data encryption and decryption operations on the user terminal device. The public key is the key paired with the user key, which is used to decrypt data encrypted by the user key, ensuring the security of data transmission in both directions. After the user completes information registration and key generation, the intelligent processing system receives the encrypted proxy transaction request of the user terminal device based on the communication encryption protocol through the first network node. The proxy transaction request contains the transaction operation information that the user wants to perform, such as the transfer amount and the payee information. These information are encrypted by the user key before sending, ensuring the security of transaction data in the transmission process and preventing third-party interception or tampering.

[0078] From the above, the intelligent processing system improves the security and reliability of financial services through the above-mentioned way, protects the privacy and transaction data of users, and also meets the strict requirements of financial supervision for data transmission security. Through the double protection of encryption and identity verification, the intelligent processing system can effectively prevent network fraud and data leakage, and provide a more secure and reliable proxy transaction service for users.

[0079] In an optional embodiment, the intelligent processing system first obtains the generator and order of the bijective group, wherein the generator represents the element set of generating the entire bijective group, and the order represents the total number of elements in the bijective group. The first value, the second value, and the third value are randomly selected, wherein the first value, the second value, and the third value are different values. Then, the master key is generated according to the first value, the second value, and the generator, the user key is generated according to the generator, the third value, and the first value, and the public key is generated according to the generator, the order, the first value, and the second value.

[0080] Optionally, the intelligent processing system first defines a bijective group in mathematics, and obtains the generator and order of the group, the bijective group is a mathematical structure in which elements can be mapped to each other, and each element has a unique inverse element, the generator refers to a specific element set that can generate all elements in the entire group, and the order refers to the total number of elements in the group, then the system randomly selects a first value, a second value and a third value, the three values play a key role in the key generation process. The first value and the second value are used to generate the master key, and the third value is used to generate the user key together with the first value and the generator. According to the randomly selected first value, second value and generator, the master key is generated, which is the core of the entire encryption system and is used to generate all other keys, including user keys and session keys. According to the generator, the third value and the first value, the system generates a user key, which is assigned to the user and is used to encrypt and decrypt data. It is related to the master key but has independence, which ensures the privacy of user data and the independence of transactions. Finally, the intelligent processing system generates a public key according to the generator, the order, the first value and the second value. The public key corresponds to the user key and is used to decrypt data encrypted by the user key. In the public key encryption system, the public key can be publicly distributed, and the user key needs to be strictly confidential. Through the mathematical properties of the bijective group, the public key and the user key form a key pair, which ensures the two-way security of data transmission.

[0081] Optionally, Figure 2 is a schematic diagram of an optional bank customer intelligent terminal structure according to an embodiment of the present application, as Figure 2 shown, the bank customer intelligent terminal can be a user's smart phone, tablet computer, notebook computer and other terminal devices, and the device can include: a user registration module 21, a key generation module 22, an agent business reservation module 23, an agent business progress query module 24, an agent business real-time authentication module 25, a location information collection module 26, and an identity information collection module 27. Among them, the user registration module 21 is responsible for providing an interface and an interface for the bank customer to register on the system to obtain a bank user identity. When registering, it is necessary to submit personal related identity information. After successful registration, download the relevant key and personal digital certificate to ensure data security during the transaction; the key generation module 22 is responsible for generating the master key M k and the user key S k for the customer after the customer's successful registration, and the specific generation method is as follows:

[0082] Step 1: After the customer's successful registration, the system submits an initialization security parameter request;

[0083] Step 2: After receiving the request, the client calls the key initialization module setup to generate the master key, and then calls the key generation module to generate the key S kThe specific steps are as follows:

[0084] (1) Initialization (Setup): The setup module selects a bijective group G0, whose generator is g, and the order is a prime number p. In Z p , two random numbers a, b e Z p are selected as the exponent, and the master key M k is obtained according to the random numbers a, b and the generator g, and the calculation method is shown in formula (2). The public key PK is represented as a tuple as shown in formula (3):

[0085] M k = (b, g α ) (2)

[0086]

[0087] Where DID H e DID represents the DID (representing digital identity) of the digital file owner, and e(g, g) is a value calculated on the generator (g) using a bilinear mapping (e).

[0088] (2) Generate key S k : Supplementary input parameters, represented as keyGen (M k , S), where M k is the master key, and S is the attribute set (including all attributes or services that the key holder has the right to access or operate), and the value generated by this function is the key S k , and the representation of the key is shown in formula (4):

[0089]

[0090] Where r e Z p is a random number, and for each attribute j e S, r j e Z p is a random number, is a hash function that converts attribute j into a fixed-length numerical value, and r j is a random number related to attribute j, used to generate attribute-related key parts.

[0091] Step 3: Call the encryption algorithm to initialize the security parameters.

[0092] Step 4: Perform the evidence storage process to store the user public key and the master key.

[0093] Step 5: Store the digital identity DID, master key M k , and user public key PK, and perform the following encryption function to encrypt the symmetric key, generating the ciphertext of the symmetric key pk b ​ And return to the user, the representation of the ciphertext is shown as formula (5):

[0094]

[0095] Wherein, Encry is an encryption function, used to encrypt plaintext data into ciphertext, sk b Indicates the private key of the user.

[0096] Step 6: return the security parameters to the client, store the symmetric private key to the local custody, and return the initialization security parameter success message.

[0097] The agent business reservation module 23 is responsible for providing interfaces and interfaces for bank customers to submit agent business reservation applications on the system, fill in the pre-filled single information of the agency business, and cooperate with other modules to collect and encrypt the client agent business reservation transaction data when submitting the application. The client agent business reservation information data includes but is not limited to: customer name, identity card information, address, mobile phone number, reservation terminal physical address data, reservation terminal physical positioning data, customer biological feature data, agent business type, agent business reservation time, agent name and identity card number, etc. Identity data, agent business pre-filled single data, etc. The agent business reservation module generates a unique reservation two-dimensional code after a successful reservation, and the bank customer can forward the two-dimensional code to the agent, and the agent holds the two-dimensional code and the personal identity card to the reservation site to handle the agency business within the reservation time period; The agent business progress query module 24 is responsible for providing a query interface and interface to the user to query the progress of the agent business; The agent business real-time authentication module 25 is responsible for providing a transaction interface to respond to the real-time authentication application initiated by the bank site when the agent handles business at the bank site, and performs remote real-time three-party (bank site clerk, agent, agent) verification authorization; The location information collection module 26 is responsible for collecting the physical positioning data information of the remote opening customer terminal; The identity information collection module 27 is responsible for collecting the face, fingerprint, voiceprint and other biological features of the opening customer through the camera, microphone and fingerprint device of the client terminal, and collecting the identity card information of the client through the camera and NFC module of the client terminal. The identity card information includes the image data of the front and back of the identity card and the identity card chip data information.

[0098] From the above content, it can be seen that the intelligent processing system significantly improves the information security level of agent transaction data processing through the above method, protects the privacy and transaction data of the user, and also meets the requirements of financial supervision for data transmission security, providing a solid technical guarantee for financial services. Through the key generation strategy combining mathematical rigor and randomness, the intelligent processing system builds a secure data transmission channel between the user and the bank, ensures the smooth progress of financial services, and also enhances the user's trust in the security of the system.

[0099] In an alternative embodiment, the intelligent processing system obtains a first parameter, wherein the first parameter is used to balance the degree of dependence on the heuristic value and the pheromone concentration when selecting a communication path, then detects a set of communication servers that the ant colony can select from the first network node to the target network node, and finally determines the probability of the ant colony selecting the hth communication path from the first network node to the target network node according to the first parameter, the set, the heuristic value and the pheromone concentration.

[0100] Optionally, the intelligent processing system obtains a first parameter, which plays a key role in balancing the degree of dependence on the heuristic value and the pheromone concentration in the ant colony algorithm, then detects a set of communication servers that the ant colony can select from the first network node to the target network node, which aims to clarify all available communication path options, and the set contains all possible data transmission nodes, which constitute the possible paths connecting the first network node and the target network node, and finally the intelligent processing system determines the probability of the ant colony selecting the hth communication path from the first network node to the target network node according to the first parameter, the set, the heuristic value and the pheromone concentration.

[0101] Optionally, the above-mentioned probability p k The calculation method of (a, b) is shown in formula (6):

[0102]

[0103] Wherein, p k (a, b) represents the probability of the ant colony selecting the hth communication path (path a to b), J k (r) is the set of data transmission nodes (the set of communication servers that the ant colony can select from the first network node to the target network node) available to the ant colony k (from a to b), β is the first parameter, τ is the pheromone concentration, τ(a, b) represents the pheromone concentration on path a to b, μ(a, b) represents the heuristic value of path a to b (μ = 1 / δ(a, b) represents the reciprocal of the path distance δ(a, b) between a and b), a and b represent the first node and the second node respectively, and under normal circumstances β > 0, s represents the next node that the ant colony k can select from the current node a, which represents the weighted sum of the pheromone heuristic value from node a to all possible next nodes b.

[0104] Optionally, the set J k (r) contains all candidate nodes that the ant colony k can move to from node a in the current iteration. In the ant colony algorithm, each ant colony can only select from its current candidate node set when selecting the next node. Therefore, the condition judgment (if s ∈ J kThe purpose of (r) is to ensure that only the nodes in the candidate node set will have their probabilities calculated, i.e. only the probability values of the legal next-hop nodes will be calculated. If s does exist in the set, i.e. it means that node b is a legal choice for ant group k to move from node a, then the probability p k (a, b) will be calculated according to the formula, if s is not in the set, it means that node b is not a legal choice for ant group k to move from node a, therefore, the probability value of node b will be set to 0, i.e. ant group k will not choose to move to node b.

[0105] From the above, it can be seen that the intelligent processing system can dynamically balance the role of heuristic value and pheromone concentration in the path selection process by introducing the first parameter, which makes the system more flexible in adjusting the path selection strategy when facing complex environments such as network traffic fluctuations and network congestion, and improves the efficiency and security of data transmission. Detecting the communication server set N ensures that the system can comprehensively evaluate all possible communication paths and avoid the limitations of path selection. Finally, by accurately calculating the path selection probability, the system can guide the ant group to intelligently select paths that have both historical stability and conform to the current network conditions, effectively avoiding network congestion and delay problems and ensuring the fast and secure transmission of proxy transaction requests.

[0106] In an optional embodiment, the intelligent processing system detects that the ant group has passed through the hth communication path, determines the incremental update value corresponding to the pheromone concentration according to the target traffic rate and the length of the path passed through by the ant group, detects that the ant group has not passed through the hth communication path, determines that the incremental update value corresponding to the pheromone concentration is 0, and finally updates the pheromone according to the incremental update value, the number of ant groups and the pheromone decay factor, wherein the pheromone decay factor is used to simulate the speed at which the pheromone disappears over time.

[0107] Optionally, after detecting that the ant colony has passed through the hth communication path, the intelligent processing system calculates an increment update value corresponding to the pheromone concentration according to the target traffic rate and the length of the path that the ant colony has passed through. The purpose of this calculation step is to adjust the pheromone concentration so that it can reflect the actual performance of the path. Specifically, the target traffic rate, as the goal of network optimization, guides the positive adjustment of the pheromone increment, that is, the path with a high target traffic rate should have a higher pheromone increment update value to encourage more ant colonies to select these high-performance paths; at the same time, the consideration of the path length introduces a proportional relationship, that is, the shorter the path, the higher the pheromone increment update value, which encourages the selection of more direct and efficient communication paths. The intelligent processing system determines the pheromone increment update value of the unpassed path: if it is detected that the ant colony has not passed through the hth communication path, the intelligent processing system will determine the increment update value corresponding to the pheromone concentration as 0, and the purpose of this step is to avoid unnecessary interference to the pheromone distribution caused by the path that has not been actually used. Finally, the intelligent processing system updates the pheromone according to the calculated increment update value, the number of ant colonies, and the pheromone decay factor. The pheromone decay factor simulates the natural phenomenon that the pheromone gradually disappears over time, which ensures the dynamic updating of the pheromone and avoids the influence of outdated path information on new path selection.

[0108] Optionally, the calculation method of the target traffic rate R(t+T) is shown in formula (7):

[0109]

[0110] wherein t represents the current time, T represents the time interval of flow rate updating, C is the capacity, y(t) is the average utilization rate of the entering link, d is the average round-trip time of the flow (historical agent transaction request) crossing the link, q(t) is the average queue size, and γ and δ are configurable parameters (used to adjust the influence degree of y(t) and q(t) on the fair sharing rate R(t), which are the configurable weight parameters in the RCP algorithm (Rate Control Protocol, rate-based congestion control algorithm), and the values of γ and δ determine the relative importance of the average utilization rate and the queue size when calculating the new sharing traffic rate).

[0111] Optionally, the increment update value Δτ corresponding to the pheromone concentration is calculated according to the target traffic rate R(t+T) and the length of the path that the ant colony has passed through, and the calculation method is shown in formula (9): k The calculation method of (a, b) is shown in formula (8):

[0112]

[0113] wherein R(t) is the fair sharing rate, L kthe path length walked by the ant group k, the formula (8) represents that if (a, b) e Routes for every k, that is, the ant group k has indeed passed the path from the node a to the node b in the current search process, then k (a, b) will be set to If the condition if (a, b) e Routes for every k is not established, that is, the ant group k has not used the path from the node a to the node b, then k (a, b) will be set to 0.

[0114] Optionally, the pheromone updating rule τ(a, b) is as shown in the formula (9):

[0115]

[0116] Wherein, 0 < a < 1 represents a pheromone decay factor, and m represents the number of ant groups.

[0117] Optionally, the formula (9) represents that the updating of the pheromone concentration includes both the decay of the pheromone (achieved through the (1-a).τ(a, b) part) and the incremental updating of the pheromone concentration according to the path selection of all the ant groups k passing through the path (achieved through the part).

[0118] As can be seen from the above, the intelligent processing system can effectively optimize the data transmission path and improve the efficiency and security of the proxy transaction data processing by dynamically adjusting the pheromone concentration. The pheromone incremental updating value determined according to the target flow rate and the path length already passed by the ant group ensures that the pheromone distribution can quickly adapt to the changes in the network condition, guiding the ant group to intelligently select the efficient communication path with moderate flow rate and short path length. For the path that has not been actually used, the pheromone incremental updating value is set to 0, avoiding the interference of the invalid path to the pheromone distribution, improving the accuracy of path selection. The introduction of the pheromone decay factor further simulates the natural disappearance process of the pheromone over time, ensuring the dynamic updating of the pheromone distribution, avoiding the influence of the outdated path information on the new path selection, and enhancing the adaptability and flexibility of the system.

[0119] In an optional embodiment, the intelligent processing system determines the target communication path from the first network node to the target network node at a target time according to a random number value, a preset constant parameter, a target random variable, an updated pheromone, and a path distance function, wherein the random number value is a value randomly determined in a data interval from 0 to 1, the preset constant parameter is a constant greater than or equal to 0 and less than or equal to 1, and the target random variable is a variable randomly selected according to a target rule.

[0120] Optionally, the intelligent processing system determines the target communication path from the first network node to the target network node at the target time according to the generated random value, the preset constant parameter, the target random variable, the updated pheromone, and the path distance function. This process comprehensively considers the historical performance of the path, the current network state, the path cost, and the random exploration factor, and intelligently evaluates and selects a path that best meets the current network conditions and data transmission requirements through probability calculation and state transition rules.

[0121] Optionally, the target communication path s is calculated as shown in formula (10):

[0122]

[0123] wherein q is a random value distributed in [0...1], q0 (0≤q0≤1) is a constant parameter (preset constant parameter), S is a randomly selected variable (target random variable) that follows a state transition rule, and τ(a, u) is the updated pheromone.

[0124] Optionally, in formula (10) is to find which node has the highest comprehensive evaluation value from all possible next nodes b in node set J k (a) in formula (10), the comprehensive evaluation value is composed of two parts: the pheromone concentration (τ(a, u)) and the βth power of the path heuristic value (μ(a, u)). The pheromone concentration reflects the frequency of past data packets or ant colonies using the path, and the heuristic value is usually related to the inverse of the path distance, representing the relative attractiveness of the path. β is a parameter that controls the relative importance of pheromone and heuristic value. When β is large, the heuristic value plays a more important role, and when β is small, the pheromone concentration has a more significant impact. If the random number q is less than the preset threshold q0, the ant colony k will select the node b with the highest comprehensive evaluation value as the next node to move. If the condition (q k <) is not met, i.e., q is greater than or equal to q0, then the ant colony k will randomly select a node from all possible next nodes (J

[0125] As can be seen from the above, the intelligent processing system realizes intelligent path selection from the first network node to the target network node at the target time by introducing random values, preset constant parameters, target random variables, and combining updated pheromones and path distance functions. This strategy significantly improves the efficiency and stability of data transmission, ensuring the real-time performance of financial services and optimizing user experience.

[0126] In an optional embodiment, Figure 3 is a schematic diagram of an optional communication node server structure according to an embodiment of the present application, as shown inFigure 3 As shown, the communication node server includes: a communication module 31, a traffic collection module 32, a security calculation module 33, a message processing module 34, and a routing management module 35. Among them, the communication module 31: as the entrance of the communication node server, realizes the data message transceiving of the recommendation system; the traffic collection module 32: responsible for collecting traffic data for the communication node server, managing network traffic, realizing tracking, collecting and recording of data transmission traffic, etc.; the security calculation module 33: responsible for using cryptographic algorithms to encrypt and decrypt the generated data messages; the message processing module 34: responsible for executing parsing and splitting of user data, forming data vectors and assembling user data messages. Table 1 is an example of an optional message format according to an embodiment of the present application, as shown in Table 1, IP header represents the data message header, Next hop represents the next hop routing information; type represents the message type, TYPE = 0X1 represents sending message; TYPE = 0x2 represents receiving message, etc.; reserved represents the receiver public key; sender represents the sender public key; SwitchID represents the ID of the switch; QueueSize represents the length of the queue; ephemeral represents the temporary credential; timestamp represents the sending timestamp; mac1 represents the physical address 1; mac2 represents the physical address 2; static represents the static information. In this table, bytes refers to the basic unit of data storage or transmission, i.e. byte. For example, in the given table, mac1 (16 bytes) and mac2 (16 bytes) represent the physical address (MAC address) field, each MAC address occupies 16 bytes of storage space. And in order to ensure the integrity and security of the data packet in the network transmission process, the intelligent processing system generates the header information of the data packet in the form of hash through the hash algorithm, and the generation method of the header information in the form of hash is as shown in formula (11):

[0127] H i = Hash(Hash(Construct) || PK(i)) (11)

[0128] Among them, Hash represents the hash algorithm SHA-256 (Secure Hash Algorithm 256-bit, secure hash algorithm 256-bit), Construct represents the content information of the structure body, PK(i) represents the public key of the data transmission node i, and || represents the byte sequence concatenation operator symbol.

[0129] Table 1

[0130]

[0131] Routing Management Module 35: Responsible for managing the routing of data transmission packets, including saving, deleting, and adding routing information. The routing management module's execution includes two phases: initialization and dynamic pheromone updating. This module's operating principle involves two algorithms (Congestion Control Program (RCP) and Ant Colony Algorithm), as detailed below:

[0132] Phase 1: Initialization

[0133] Step 1: Assume there are m concurrent processes, and divide the n data packets of the data asset into m equal parts;

[0134] Step 2: Let the value of the pheromone τ(a, b) be a constant c, and initialize it as τ(a, b) = c, where a and b represent the source node and the destination node, respectively;

[0135] Step 3: Initialize the pheromone gain Δτ(a, b) k =0.

[0136] Step 4: Initialize C as the link capacity, α, β, γ and δ as constants, and d0 (representing the average flow velocity), calculated as shown in formula (12):

[0137]

[0138] Where, d i (t) represents the instantaneous flow rate of link i at time t, d0 represents the average flow rate (average transmission rate), and C represents the capacity of the data link.

[0139] Phase Two: Low-Latency Network Control Routing Strategy Algorithm

[0140] Input: Number of concurrent processes M, number of data asset partitions N;

[0141] Output: Shortest low-latency network control routing policy;

[0142] The algorithm steps are as follows:

[0143] Step 1: Collect traffic data. The traffic collection module periodically collects information such as switch ID, queue size, link utilization, and average shared link rate, calculates d0, and updates the corresponding variables in local memory. For example, (PUSH[SwitchID]; PUSH[QueueSize]; PUSH[LinkUtilization]; PUSH[Average Shared Rate]).

[0144] Step 2: Initialize the dynamic update routing algorithm parameters. Construct the 1-MTSP parameter set, initialize the pheromone matrix PM, and initialize the solution s. kShortest = Shortest + 1

[0145] Step 3: Initialize ant colony routing information, calculate the heuristic information of each node;

[0146] Step 4: If the number of iterations is less than N max , the following loop processing is performed:

[0147] Step 5: For each process k≤m, the following steps are performed:

[0148] Step 5.1: For each node i≤n, the following steps are performed:

[0149] Step 5.1.1: Perform the following flow control protocol calculation steps to calculate the fair share rate of each link (as formula (7));

[0150] Step 5.1.2: Perform the following state transition function to calculate the pheromone of the ant colony to each node (as formula (6));

[0151] Step 5.1.2.1: Update the pheromone τ(a, b), update the pheromone parameter in a loop, the basic idea is that the concentration of pheromone is proportional to the fair share rate. The specific method of updating the pheromone is: according to the path distance μ and the fair share rate R(t) of the link as the clue, calculate the pheromone concentration, and constantly update the pheromone τ, the pheromone update rule is as formula (8) - formula (9);

[0152] Step 5.1.2.2: If the node meets the constraint condition, add the node to the solution s k ;

[0153] Step 5.1.2.3: Get the file fragment size size (assuming the file fragment size is the same), the time window w, set w as a time range [e i , l i ], e i represents the earliest arrival time, and l i represents the latest arrival time (the residence time is ignored). Then optimize the path distance function μ of the pheromone transition matrix, adjust it to Formally represented as formula (1);

[0154] Step 5.1.3: If the node does not meet the constraint condition, start searching for the next node;

[0155] Step 6: For each process k≤m, the following steps are performed:

[0156] Step 6.1: Calculate the length of each path, update the shortest path shortest;

[0157] Step 6.1.1: For each node i≤n, perform the following steps to update the pheromone function:

[0158] Step 6.1.1.2: Update the pheromone matrix PM;

[0159] Step 6.1.1.3: Set the un-updated path to the worst value;

[0160] Step 7: Output the best routing information. The optimal routing, i.e., the best path s, is selected according to the concentration of pheromones, as formula (10).

[0161] In an alternative embodiment, Figure 4 is a flowchart of an optional three-party proxy transaction data processing according to an embodiment of the present application, as Figure 4 shown, the specific steps are as follows:

[0162] Step S401: The bank customer remotely registers a user through a customer intelligent terminal, generates a master key and a user key, and after successful registration, the master key and the user key are downloaded and saved on the customer intelligent terminal;

[0163] Step S402: The bank customer makes an appointment for a proxy service through a proxy service appointment module, selects an appointment site and an appointment time, fills in information related to the information of the appointed service and the identity information of the proxy person;

[0164] Step S403: After the appointment is successful, the system generates a unique appointment two-dimensional code and returns it to the customer intelligent terminal. The bank customer forwards the two-dimensional code to the customer-authorized proxy person intelligent terminal. Through the appointment two-dimensional code, the security problem of counterfeit certificates in the traditional paper certificate mode for proxying bank services can be avoided;

[0165] Step S404: The proxy person holds the two-dimensional code and goes to the appointed bank site to handle the proxy service during the appointed appointment period. The bank site clerk scans the code and verifies the identity of the proxy person, initiates a three-party real-time data connection, and makes a three-party real-time identity verification request;

[0166] Step S405: After the communication source node server receives the identity authentication request transaction request, the routing management module on the node server is initialized, and the routing management module executes the GenKey() function. For each data transmission node i (i∈[1, n]), the public key and the private key of the data transmission node i are generated in a loop. For all nodes i (i∈[1, n]), if i is not the target node, the following calculation steps of the flow control protocol are executed, the fair share rate of each link is calculated as formula (7), the path search process is initialized, the state transition rule is added as shown in formula (6), the routing management module updates the pheromone τ(a, b) according to the instantaneous flow rate, and the pheromone parameter is updated in a loop. The specific method of updating the pheromone is: according to the path distance μ and the fair share rate R(t) of the link as a clue, the pheromone “concentration” is calculated, and the pheromone τ is constantly updated. The pheromone update rule is shown in formula (8)-(9). If the current access communication server node does not exist in the visited node library, the routing management module adds the current access node in the visited node library. Update the information such as pheromone according to time slicing and load condition. Obtain the file fragment size size (assuming that the file fragment size is the same), the time window w, and set w as a time range [e i , l i ]e i represents the earliest arrival time, and l i represents the latest arrival time (the residence time is ignored). Then, the path distance function μ of the optimized pheromone transition matrix is adjusted to which is formally represented as formula (1);

[0167] Step S406: The routing management module updates the dynamic routing table and executes the optimized path selection function to select the optimal path and transmit the data packet to the next communication node server. The operation is performed as follows: according to the “concentration” of the pheromone, the best path s is selected as formula (10);

[0168] Step S407: After the next communication node server receives the communication packet, the fair share rate of each link is calculated according to the communication destination node server address of the communication message packet, the optimized path selection function is executed to select the optimal path, the data packet is transmitted to the next communication node server, and the communication node server along the way repeatedly executes this step until the data packet is transmitted to the communication destination node server.

[0169] Step S408: The communication destination node server transmits the proxy transaction request to the client intelligent terminal, and the proxy business real-time authentication module responds to the real-time authentication application to perform remote real-time three-party verification authorization transaction. The authentication data is returned to the communication source node server according to the same method.

[0170] Step S409: After verifying the authorization success, the verification process video is saved in the form of a file on the bank server. The bank server handles the agency business, updates the relevant transaction register, prints the paper transaction certificate for the agent, and pushes the transaction result to the remote bank customer. The transaction is over.

[0171] The embodiment of the present application further provides a processing device for proxy transaction request, and it should be noted that the processing device for proxy transaction request can be used to execute the processing method for proxy transaction request provided by the embodiment of the present application. The processing device for proxy transaction request provided by the embodiment of the present application is introduced as follows.

[0172] According to the embodiment of the present application, a processing device for proxy transaction request is further provided, Figure 5 is a schematic diagram of an optional processing device for proxy transaction request according to the embodiment of the present application, as shown in the figure, the device comprises: a first acquisition unit 501, a second acquisition unit 502, a first calculation unit 503, a first determination unit 504, and a first sending unit 505. Figure 5

[0173] Optionally, the first acquisition unit 501 is configured to acquire the proxy transaction request submitted by a first object through a first network node in a communication network, wherein the proxy transaction request represents that the first object requests to proxy a second object to perform a target transaction with a financial institution, and the first network node is a network node that communicates with an application server of the financial institution; the second acquisition unit 502 is configured to acquire a total bandwidth when the proxy transaction request enters a data link between the first network node and a target network node, wherein the target network node is a network node that communicates with a terminal device of the second object; the first calculation unit 503 is configured to calculate a ratio of the total bandwidth to a capacity of the data link to obtain an average utilization rate of the data link when processing the proxy transaction request, wherein the capacity represents a maximum transmission rate of the data link; the first determination unit 504 is configured to determine a target communication path from a plurality of communication paths existing between the first network node and the target network node according to the average utilization rate, the capacity, and an initialized ant colony, wherein the ant colony is a search process of the communication path; and the first sending unit 505 is configured to send the proxy transaction request to the target network node based on the target communication path through the first network node.

[0174] ​Optionally, the processing device of the proxy transaction request further comprises: a first receiving unit, a second sending unit, a second receiving unit and a third sending unit. The first receiving unit is configured to receive a reservation request sent by a terminal device of the first object through the first network node, wherein the reservation request comprises at least object information of the first object, an association relationship between the first object and the second object, a business type of the target transaction and a time at which the first object plans to handle the target transaction; the second sending unit is configured to send the reservation request to an application server of the financial institution through the first network node; the second receiving unit is configured to receive two-dimensional code information generated by the application server for the reservation request through the first network node, wherein the two-dimensional code information is used as a voucher for the first object to handle the target transaction at the financial institution; and the third sending unit is configured to send the two-dimensional code information to the terminal device of the first object through the first network node.

[0175] Optionally, the processing device of the proxy transaction request further comprises: a third receiving unit and a fourth sending unit. The third receiving unit is configured to receive an approval result of the second object on the proxy transaction request returned by the target network node through the first network node, wherein the approval result is generated by a terminal device of the second object, and the approval result comprises at least signature information of the second object and video information; and the fourth sending unit is configured to send the approval result to the application server of the financial institution through the first network node.

[0176] Optionally, the first determining unit 504 comprises: a first detecting subunit, a second detecting subunit, a third detecting subunit, a first determining subunit and a second determining subunit. The first detecting subunit is configured to detect an average round-trip time of network traffic traversing the data link; the second detecting subunit is configured to detect an average queue size of the data link at a target time, wherein the average queue size is used to represent an amount of data waiting to be sent in the data link; the third detecting subunit is configured to detect a traffic rate of the data link at a first time, wherein the first time is separated from the target time by a preset time length, and the first time is before the target time, and the target time is a time at which the first network node sends the proxy transaction request; the first determining subunit is configured to determine a target traffic rate of the data link at the target time according to the capacity, the average utilization rate, the average round-trip time, the average queue size and the traffic rate of the data link at the first time; and the second determining subunit is configured to determine the target communication path from a plurality of communication paths existing between the first network node and the target network node according to the target traffic rate and the initialized ant colony.

[0177] Optionally, the processing device of the proxy transaction request further comprises a third acquisition unit, a second determination unit, a third determination unit and a first processing unit. The third acquisition unit is configured to acquire the pheromone concentration on the hth communication path from the first network node to the target network node, wherein the pheromone concentration is proportional to the usage frequency of the hth communication path, and the hth communication path is any one of the communication paths between the first network node and the target network node; the second determination unit is configured to take the reciprocal of the path distance of the hth communication path as a heuristic value; the third determination unit is configured to determine the probability of the ant colony selecting the hth communication path to move from the first network node to the target network node according to the heuristic value and the pheromone concentration; and the first processing unit is configured to determine a target rule according to the probability, and initialize the ant colony according to the target rule, wherein the target rule is used to dynamically update the selection of the communication path according to the pheromone and the path distance.

[0178] Optionally, the second determination subunit comprises a first updating module and a first determination module. The first updating module is configured to update the pheromone according to the target traffic rate and the path length that has been passed through by the ant colony; and the first determination module is configured to determine the target communication path between the first network node and the target network node at the target time according to the updated pheromone.

[0179] Optionally, the first determination module comprises a first detection sub-module, a second detection sub-module, a third detection sub-module, a fourth detection sub-module, a first determination sub-module and a second determination sub-module. The first detection sub-module is configured to detect the file fragment size, wherein the file fragment size is the size of the proxy transaction request; the second detection sub-module is configured to detect the time window, wherein the time window represents the time range of the proxy transaction request reaching the target network node; the third detection sub-module is configured to detect the load parameter, wherein the load parameter represents the load condition of the data link when the ant colony passes through the first network node at the target time; the fourth detection sub-module is configured to detect the time parameter, wherein the time parameter represents the matching degree of the time at which the proxy transaction request reaches the target network node according to the path selected by the ant colony and the time window when the ant colony passes through the first network node at the target time; the first determination sub-module is configured to determine the path distance function according to the file fragment size, the time window, the load parameter and the time parameter; and the second determination sub-module is configured to determine the target communication path according to the path distance function and the updated pheromone.

[0180] According to another aspect of the present application, a computer readable storage medium is also provided, which comprises a stored executable program, wherein the executable program controls the device where the computer readable storage medium is located to perform the above-mentioned processing method of the proxy transaction request when the executable program is running.

[0181] According to another aspect of the present application, an electronic device is also provided, comprising: a memory storing an executable program; and a processor configured to execute the program, wherein the program, when executed, performs the method for processing a proxy transaction request.

[0182] According to another aspect of the present application, a computer program product is also provided, comprising computer instructions, which, when executed by a processor, implement the steps of the method for processing a proxy transaction request.

[0183] The above-mentioned sequence numbers of the embodiments of the present application are only for description, and do not represent advantages or disadvantages of the embodiments.

[0184] In the above-mentioned embodiments of the present application, the description of each embodiment has its own focus, and the parts not described in detail in a certain embodiment can be referred to the relevant description of other embodiments.

[0185] In the several embodiments provided by the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described device embodiments are only illustrative, for example, the division of the units can be a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be omitted or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interface, unit or module, and can be electrical or other forms.

[0186] The units described as separate components can or can not be physically separate, and the components shown as units can or can not be physical units, that is, they can be located in one place, or can be distributed on multiple units. Part or all of the units can be selected according to actual needs to achieve the purpose of the present embodiment scheme.

[0187] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The above integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0188] The integrated unit, if implemented in the form of a software function unit and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application essentially or say the part that contributes to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server or a network device, etc.) to execute all or part of the steps of the method described in the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a mobile hard disk, a magnetic disk or an optical disk and various program code storage media.

[0189] The above is only the preferred embodiment of the present application, and it should be pointed out that for those skilled in the art, without departing from the principles of the present application, a number of improvements and refinements can be made, which should be considered as the protection scope of the present application.

Claims

1. A method for processing proxy transaction requests, characterized in that, The method comprises the following steps: obtaining a proxy transaction request submitted by a first object through a first network node in a communication network, wherein the proxy transaction request represents that the first object requests a second object to conduct a target transaction with a financial institution, and the first network node is a network node in communication with an application server of the financial institution; obtaining a total bandwidth when the proxy transaction request enters a data link between the first network node and a target network node, wherein the target network node is a network node in communication with a terminal device of the second object; calculating a ratio of the total bandwidth to a capacity of the data link to obtain an average utilization of the data link in processing the proxy transaction request, wherein the capacity represents a maximum transmission rate of the data link; determining a target communication path from a plurality of communication paths existing between the first network node and the target network node according to the average utilization, the capacity, and an initialized ant colony, wherein the ant colony is a search process of the communication path; sending the proxy transaction request to the target network node based on the target communication path through the first network node.

2. The method of claim 1, wherein, Before obtaining the proxy transaction request submitted by the first object through the first network node in the communication network, the processing method of the proxy transaction request further comprises the following steps: receiving a reservation request sent by a terminal device of the first object through the first network node, wherein the reservation request at least includes object information of the first object, an association relationship between the first object and the second object, a business type of the target transaction, and a time at which the first object plans to conduct the target transaction on behalf of the second object; sending the reservation request to an application server of the financial institution through the first network node; receiving two-dimensional code information generated by the application server for the reservation request through the first network node, wherein the two-dimensional code information is used as a voucher for the first object to conduct the target transaction on behalf of the second object at the financial institution; sending the two-dimensional code information to the terminal device of the first object through the first network node.

3. The method of claim 1, wherein, After sending the proxy transaction request to the target network node based on the target communication path through the first network node, the processing method of the proxy transaction request further comprises the following steps: receiving an approval result of the second object on the proxy transaction request returned by the target network node through the first network node, wherein the approval result is generated by a terminal device of the second object, and the approval result at least includes signature information and video information of the second object; sending the approval result to the application server of the financial institution through the first network node.

4. The method of claim 1, wherein, Determining a target communication path from a plurality of communication paths existing between the first network node and the target network node according to the average utilization, the capacity, and an initialized ant colony, comprises the following steps: detecting an average round-trip time of network traffic traversing the data link; detecting an average queue size of the data link at a target time, wherein the average queue size is used to represent an amount of data waiting to be transmitted in the data link; detecting a traffic rate of the data link at a first time, wherein the first time is spaced apart from the target time by a preset time length, and the first time is before the target time, and the target time is a time when the first network node transmits the proxy transaction request; determining a target traffic rate of the data link at the target time according to the capacity, the average utilization rate, the average round-trip time, the average queue size, and the traffic rate of the data link at the first time; determining a target communication path from the first network node to the target network node according to the target traffic rate and the initialized ant colony from a plurality of communication paths existing between the first network node and the target network node.

5. The method of claim 4, wherein, Before determining a target communication path from the first network node to the target network node according to the average utilization rate, the capacity, and the initialized ant colony from a plurality of communication paths existing between the first network node and the target network node, the processing method of the proxy transaction request further comprises: obtaining a pheromone concentration on an hth communication path from the first network node to the target network node, wherein the pheromone concentration is proportional to a usage frequency of the hth communication path, and the hth communication path is any one of the communication paths between the first network node and the target network node; taking a reciprocal of a path distance of the hth communication path as a heuristic value; determining a probability that the ant colony selects the hth communication path to move from the first network node to the target network node according to the heuristic value and the pheromone concentration; determining a target rule according to the probability, and initializing the ant colony according to the target rule, wherein the target rule is used to dynamically update selection of the communication path according to pheromone and path distance.

6. The method of claim 5, wherein, Determining a target communication path from the first network node to the target network node according to the target traffic rate and the initialized ant colony from a plurality of communication paths existing between the first network node and the target network node, comprises: updating the pheromone according to the target traffic rate and a path length that the ant colony has passed through; determining a target communication path between the first network node and the target network node at the target time according to the updated pheromone.

7. The method of claim 6, wherein, Determining a target communication path between the first network node and the target network node at the target time according to the updated pheromone, comprises: detecting a file fragment size, wherein the file fragment size is a size of the proxy transaction request; detecting a time window, wherein the time window represents a time range in which the proxy transaction request arrives at the target network node; detecting a load parameter, wherein the load parameter represents a load condition of the data link when the ant colony passes through the first network node at the target time; detect a time parameter, wherein the time parameter represents a matching degree between a time at which the agent transaction request reaches the target network node according to a path selected by the ant colony and the time window when the ant colony passes through the first network node at the target time; determine a path distance function according to the file fragment size, the time window, the load parameter, and the time parameter; determine the target communication path according to the path distance function and the updated pheromone.

8. A processing apparatus for proxy transaction requests, characterized in that, comprising: a first obtaining unit configured to obtain an agent transaction request submitted by a first object through a first network node in a communication network, wherein the agent transaction request represents that the first object requests to proxy a second object to perform a target transaction with a financial institution, and the first network node is a network node that communicates with an application server of the financial institution; a second obtaining unit configured to obtain a total bandwidth when the agent transaction request enters a data link between the first network node and a target network node, wherein the target network node is a network node that communicates with a terminal device of the second object; a first calculating unit configured to calculate a ratio of the total bandwidth to a capacity of the data link to obtain an average utilization of the data link when processing the agent transaction request, wherein the capacity represents a maximum transmission rate of the data link; a first determining unit configured to determine a target communication path from a plurality of communication paths between the first network node and the target network node according to the average utilization, the capacity, and an initialized ant colony, wherein the ant colony is a search process of the communication path; a first sending unit configured to send the agent transaction request to the target network node based on the target communication path through the first network node.

9. A computer-readable storage medium, characterized in that, The computer readable storage medium comprises a stored executable program, wherein the executable program controls a device where the computer readable storage medium is located to execute the processing method of the agent transaction request in any one of claims 1 to 7 when the executable program is run.

10. An electronic device, comprising: comprising: a memory that stores an executable program; a processor configured to run the program, wherein the program performs the processing method of the agent transaction request in any one of claims 1 to 7 when the program is run.

11. A computer program product comprising computer instructions, characterized in that, The computer instructions are executed by the processor to implement the steps of the processing method of the agent transaction request in any one of claims 1 to 7.

Images