Financial product transaction data processing method and device

Abstract

The invention discloses a transaction data processing method and device for financial products, and relates to the field of financial science and technology. The method comprises the following steps: receiving transaction parameters sent by a second server of an issuing mechanism of a target financial product through a first server of a selling mechanism of the target financial product; acquiring a transaction request which is uploaded by user terminal equipment and meets the transaction parameters; determining a target transmission path according to the shared flow rate of the data link between the first server and the second server; and sending the transaction request to the second server based on the target transmission path. In the prior art, because the purchase time of the hot financial product is limited, a large amount of transaction data needs to be transmitted among a sales institution, an issuing institution and a user terminal device of the financial product in a short time, so that the transaction data transmission time delay of the hot financial product is high; the problem of data transmission extrusion easily occurs, and the transaction success rate of the hot financial product is affected.

Description

Technical Field

[0001] The present application relates to the field of financial technology, and specifically, to a method and device for processing transaction data of financial products. Background Art

[0002] With the acceleration of the digital transformation of the financial market, the rapid trading of high-yield hot financial products has become a key means for many financial institutions to compete and attract customers. Such products are often available in limited time and quantity, attracting a large number of users to snap up in a very short time window, which not only tests the instantaneous high-concurrency processing capabilities of the banking system, but also poses unprecedented challenges to the timeliness and security of data transmission.

[0003] In the existing technical framework, traditional data transmission mechanisms, especially those that rely on public networks, often fail to meet the special needs of hot financial product transactions. Transaction data needs to be efficiently transferred between user terminals, bank branch servers, communication servers, and product issuers, but the uncertainty, high latency, and potential security threats of public networks lead to delays in the transmission of transaction data, and even data transmission runs during peak trading periods, which seriously affect the success rate of transactions.

[0004] To address the above-mentioned problems, no effective solution has been proposed yet. Summary of the invention

[0005] The present application provides a method and device for processing transaction data of financial products, so as to at least solve the technical problem in the prior art that due to the limited purchase time of hot financial products, a large amount of transaction data needs to be transmitted between the sales institutions, issuing institutions and user terminal devices of the financial products in a short period of time, resulting in high latency in the transmission of transaction data of hot financial products, prone to data transmission runs, and thus affecting the transaction success rate of hot financial products.

[0006] According to one aspect of the present application, a method for processing transaction data of a financial product is provided, comprising: receiving, through a first server of a sales institution of the target financial product, transaction parameters sent by a second server of an issuing institution of the target financial product, wherein the transaction parameters are used to characterize restriction conditions for purchasing the target financial product, and the target financial product is a financial product designated to be sold within a preset time period; obtaining, through the first server, a transaction request that meets the transaction parameters and is uploaded by a user terminal device; determining, through the first server, a target transmission path from a plurality of data transmission paths between the first server and the second server according to a shared traffic rate of a data link between the first server and the second server; and sending the transaction request to the second server through the first server based on the target transmission path.

[0007] According to another aspect of the present application, a transaction data processing device for a financial product is also provided, including: a receiving unit, which receives transaction parameters sent by a second server of an issuing institution of the target financial product through a first server of a sales institution of the target financial product, wherein the transaction parameters are used to characterize restriction conditions for purchasing the target financial product, and the target financial product is a financial product designated to be sold within a preset time period; an uploading unit, which obtains a transaction request that meets the transaction parameters uploaded by a user terminal device through the first server; a determining unit, which determines a target transmission path from a plurality of data transmission paths between the first server and the second server based on a shared traffic rate of a data link between the first server and the second server through the first server; and a sending unit, which sends the transaction request to the second server through the first server based on the target transmission path.

[0008] According to another aspect of the present application, a computer-readable storage medium is also provided, the computer-readable storage medium including a stored executable program, wherein when the executable program is running, the device where the computer-readable storage medium is located is controlled to execute the above-mentioned financial product transaction data processing method.

[0009] According to another aspect of the present application, an electronic device is provided, comprising: a memory storing an executable program; and a processor for running the program, wherein the above-mentioned method for processing transaction data of financial products is executed when the program is running.

[0010] According to another aspect of the present application, a computer program product is also provided, comprising computer instructions, which implement the steps of the above-mentioned method for processing transaction data of financial products when executed by a processor.

[0011] In the present application, firstly, the transaction parameters sent by the second server of the issuing institution of the target financial product are received through the first server of the sales institution of the target financial product, wherein the transaction parameters are used to characterize the restriction conditions for purchasing the target financial product, and the target financial product is a financial product designated to be sold within a preset time period. Secondly, the transaction request that meets the transaction parameters uploaded by the user terminal device is obtained through the first server. Then, the target transmission path is determined from multiple data transmission paths between the first server and the second server through the first server according to the shared traffic rate of the data link between the first server and the second server. Then, based on the target transmission path, the transaction request is sent to the second server through the first server, that is, by intelligently selecting the most suitable transmission path, the purpose of reducing the transaction data transmission delay and avoiding data runs is achieved, thereby achieving the technical effect of improving the transaction success rate of hot financial products. This solves the problem that in the prior art, due to the limited purchase time of hot financial products, a large amount of transaction data needs to be transmitted between the sales institution, the issuing institution and the user terminal device of the financial product in a short time, resulting in high transaction data transmission delay of hot financial products and easy occurrence of data transmission runs, thereby affecting the transaction success rate of hot financial products. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0013] Figure 1-1 is a flowchart of an optional method for processing transaction data of a financial product according to an embodiment of the present application;

[0014] Figure 1-2 is a connection diagram of a transaction data processing system for an optional financial product according to an embodiment of the present application;

[0015] Figure 2 is a schematic diagram of an optional branch application server according to an embodiment of the present application;

[0016] Figure 3 is a schematic diagram of an optional customer transaction terminal structure according to an embodiment of the present application;

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

[0018] Figure 5 is a flow chart of an optional routing management module processing data according to an embodiment of the present application;

[0019] Figure 6is a flow chart of an optional hot financial product transaction data processing according to an embodiment of the present application;

[0020] Figure 7 It is a schematic diagram of an optional transaction data processing device for a financial product according to an embodiment of the present application. DETAILED DESCRIPTION

[0021] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0022] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0023] 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, data for analysis, etc.) involved in this application are information and data authorized by the user or fully authorized by all parties, and the collection, storage, use, processing, transmission, provision, disclosure and application of relevant data are in compliance with relevant laws, regulations and standards, necessary confidentiality measures are taken, and public order and good customs are not violated, and corresponding operation entrances are provided for users to choose to authorize or refuse. For example, an interface is set up between this system and relevant users or institutions to provide users with corresponding operation entrances for users to choose to agree or refuse the results of automated decision-making; if the user chooses to refuse, the expert decision-making process will be entered.

[0024] According to an embodiment of the present application, a method embodiment of a method for processing transaction data of a financial product 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 a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0025] Figure 1-1 is a flowchart of an optional method for processing transaction data of a financial product according to an embodiment of the present application, such as Figure 1-1 As shown, the method comprises the following steps:

[0026] Step S101: receiving transaction parameters sent by a second server of an issuing institution of a target financial product through a first server of a selling institution of the target financial product.

[0027] In step S101, the transaction parameters are used to characterize the restriction conditions for purchasing a target financial product, where the target financial product is a financial product designated to be sold within a preset time period.

[0028] It should be noted that the first server of the sales organization of the target financial product can be used as the execution subject of the transaction data processing method of the financial product in the embodiment of the present application. It is understandable that the transaction data processing method of the financial product provided in the embodiment of the present application can also be executed by other systems or devices, and the embodiment of the present application does not specifically limit this.

[0029] Optionally, the target financial product (hot financial product) refers to a financial product launched within a specific time period and having high appeal (such as high yield), which requires customers to snap up within a preset sales period.

[0030] Optionally, the first server of the sales organization refers to the application server of the sales organization, that is, the application servers of each branch, which are responsible for receiving customer transaction requests and exchanging data with the product issuing organization; the second server of the issuing organization refers to the server of the product issuer.

[0031] Optionally, transaction parameters are used to describe specific conditions for purchasing financial products, including but not limited to the start and end time of transaction activities, the total inventory quota of financial products, the quota of financial products allocated to each branch, etc. These parameters constitute restrictive conditions for transactions to ensure that transactions are conducted in a fair and orderly manner.

[0032] Step S102: obtaining, through the first server, a transaction request satisfying the transaction parameters uploaded by the user terminal device.

[0033] Optionally, the first server obtains a request for purchasing or snapping up a financial product sent by the customer to the bank server, including customer information, product type, quantity, price, etc.

[0034] Step S103 : determining, by the first server, a target transmission path from a plurality of data transmission paths between the first server and the second server according to a shared flow rate of a data link between the first server and the second server.

[0035] Optionally, since there may be multiple transmission lines or paths from the first server to the second server, and each path has different transmission conditions and efficiencies, the first server is used to determine the optimal data transmission path from among multiple data transmission paths between the first server and the second server based on the shared traffic rate of the data link between the first server and the second server.

[0036] Step S104: sending the transaction request to the second server through the first server based on the target transmission path.

[0037] Optionally, the transaction request is sent to the second server through the first server based on the target transmission path.

[0038] Optionally, Figure 1-2 is a connection diagram of a transaction data processing system for an optional financial product according to an embodiment of the present application, such as Figure 1-2As shown, the system includes customer transaction terminals, multiple bank branch application servers (A, B, C, D, E branch application servers), multiple bank branch communication servers (A, B, C, D, E branch communication servers), product issuing agency communication servers, and product issuing agency application servers. Among them, the customer transaction terminals of each bank are connected to the branch application servers of the bank through a wired or wireless network; the branch application servers of each bank are connected to the communication servers of the bank branches through the bank's optical fiber network; the communication servers of each branch are connected in pairs through the bank's internal dedicated optical fiber lines to form a financial service network. Among them, the customer transaction terminal is responsible for providing users with services such as financial product promotion information query, financial product purchase, and financial product transaction, and performs group signing, encryption, and decryption processing on transaction request data; the bank branch application server is responsible for filtering each of the hot financial product transaction requests according to the configuration of hot financial product transaction parameters, retaining valid transaction requests that meet the preset hot financial product transaction conditions and limiting the transaction request flow; the bank branch communication server is responsible for data interaction with other branch communication servers and product issuer communication servers. The server establishes a secure channel with other communication servers for secure data transmission. A data routing module is deployed on the communication server. The data transmission module adopts load-optimized low-latency network control to calculate the impact of traffic rate, load and time window on route selection. On the basis of the ant colony algorithm, a penalty function is added to optimize the congestion control of the traffic rate, overload, and the volatilization state of pheromones under the time window transmission conditions, effectively improving the stability, timeliness and security of the system; the product issuer can be a branch within the bank or a third-party institution outside the bank. The product issuer application server processes the transaction requests of each branch communication server and returns the transaction processing results to the transaction initiator through the communication server.

[0039] Optionally, Figure 2 is a schematic diagram of an optional branch application server according to an embodiment of the present application, such as Figure 2 As shown, it includes: a parameter configuration module 21, a transaction filtering module 22, an inventory control module 23, a hot financial product transaction matching module 24, a qualification generation module 25, and a settlement module 26.

[0040] Among them, the parameter configuration module 21 is responsible for configuring the concurrency parameters of the branch application server so that the branch application server limits the number of hot financial product transaction requests issued based on the concurrency parameters; the concurrency parameters include: configuration process data, maximum number of connections and timeout time, etc.

[0041] The transaction filtering module 22 is responsible for controlling the request information corresponding to each of the hot financial product transaction requests, and limiting the access traffic according to the token algorithm, so as to filter each of the hot financial product transaction requests and retain valid hot financial product transaction requests that meet the preset hot financial product transaction conditions. If the request interface corresponding to any URL address receives multiple hot financial product transaction requests corresponding to the same source IP, only one hot financial product transaction request is retained as a valid hot financial product transaction request among the multiple hot financial product transaction requests corresponding to the same source IP.

[0042] The inventory control module 23 is responsible for storing the quota of hot financial product trading activities and setting a counter, which corresponds to the token. When the total number of hot financial product transaction requests is greater than the inventory quota, the hot financial product transaction requests will be isolated, thereby preventing the number of hot financial product transaction requests from being too large, causing the communication server to be impacted by a huge amount of hot financial product transaction request data.

[0043] The hot financial product transaction matching module 24 is responsible for matching each of the hot financial product transaction requests with each inventory quota in the inventory control module. The module uses a list monitoring instruction to monitor in real time whether there is an inventory quota to be matched in the product inventory queue. When the list monitoring instruction monitors that there is an inventory quota to be matched in the product inventory queue, each transaction request is matched with each inventory quota in the product inventory queue.

[0044] The qualification generation module 25 is responsible for binding the customer corresponding to any valid hot financial product transaction request with the inventory quota matching the hot financial product transaction request when any valid hot financial product transaction request successfully matches any inventory quota, and generating an order qualification certificate corresponding to the customer.

[0045] The settlement module 26 is responsible for settling the customer transaction after receiving the confirmation of the successful transaction result from the product issuer application server, generating the corresponding settlement order according to the order submission request, and returning the transaction result to the corresponding customer transaction terminal. The reserved order contains the name, price, type, transaction time of the financial product, and the product reservation number. The settlement order contains the name, price, type, transaction time, settlement time, and order number of the financial product.

[0046] It can be seen from the contents of steps S101 to S104 that in the present application, firstly, the transaction parameters sent by the second server of the issuing institution of the target financial product are received through the first server of the sales institution of the target financial product, wherein the transaction parameters are used to characterize the restriction conditions for purchasing the target financial product, and the target financial product is a financial product designated to be sold within a preset time period. Secondly, the transaction request satisfying the transaction parameters uploaded by the user terminal device is obtained through the first server, and then the target transmission path is determined from multiple data transmission paths between the first server and the second server through the first server according to the shared traffic rate of the data link between the first server and the second server. Then, based on the target transmission path, the transaction request is sent to the second server through the first server, that is, by intelligently selecting the most suitable transmission path, the purpose of reducing the transaction data transmission delay and avoiding data runs is achieved, thereby achieving the technical effect of improving the transaction success rate of hot financial products, and further solving the problem that in the prior art, due to the limited purchase time of hot financial products, a large amount of transaction data needs to be transmitted between the sales institution, the issuing institution and the user terminal device of the financial product in a short time, thereby causing the transaction data transmission delay of the hot financial product to be high and data transmission runs to occur easily, thereby affecting the transaction success rate of the hot financial product.

[0047] In an optional embodiment, the transaction parameters include at least one of the following parameters: a first parameter for limiting the transaction time of the target financial product; a second parameter for limiting the total quantity of the target financial products; a third parameter for limiting the maximum sales quantity of the target financial products by each sales institution; a fourth parameter for limiting the purchasing population of the target financial products; and a fifth parameter for limiting the maximum number of communication connections between the first server and the second server.

[0048] Optionally, the first parameter is set as the start time and end time of the activity, so that all customers can submit transaction requests within the specified time window; the second parameter is used to control the total quantity of the target financial product. For example, for a limited-edition financial product, the second parameter may be set to 1,000 units. When the total quota is reached or exceeded, the system will automatically stop accepting new transaction requests; the third parameter limits the maximum sales quantity of the target financial product for each branch. For example, if the total quota of a product is 1,000 units, the third parameter may be set to no more than 100 units per branch. In this way, even if some branches have a large number of users, It cannot monopolize all quotas, ensuring the reasonable distribution of products among different branches; the fourth parameter is used to limit the qualifications of the purchasing population of the target financial products, such as limiting certain financial products to member customers or customers in a specific area. Through the qualification parameters, the system can verify the identity and qualifications of the customers to ensure that only qualified customers can participate in trading activities; the fifth parameter is used to limit the maximum number of communication connections between the first server and the second server. For example, setting the maximum number of connections to 1000 can prevent the communication server from being overwhelmed by a large number of connection requests in a short period of time, thereby reducing system processing delays and improving the transmission efficiency of transaction data.

[0049] From the above content, it can be seen that by implementing the above transaction parameter restrictions, the first server can effectively manage high-concurrency transaction activities, ensure the secure transmission of transaction data, and improve the response speed and processing efficiency of the system. In addition, the setting of these parameters can also protect the fair distribution of financial products among different branches, avoid the problem of overselling or exclusive use by a specific group of people, improve the user experience, and enhance the stability and reliability of the system during peak trading periods.

[0050] In an optional embodiment, transaction parameters and traffic restriction conditions are sent to the sales organization's application server through the first server, wherein the traffic restriction conditions are used to limit the access traffic between the application server and the user terminal device through a token bucket algorithm, and the application server is an intermediate server between the user terminal device and the first server, and the application server is used to screen transaction requests based on the transaction parameters and traffic restriction conditions.

[0051] Optionally, the first server pre-sets the transaction parameters of hot financial products, including but not limited to the start and end time of financial product transaction activities, the total inventory quota of financial products, the quota of financial products allocated to each branch, the qualification parameters of financial product participants, etc. At the same time, the first server configures the flow restriction conditions, which are based on the token bucket algorithm and are used to control the access flow between the application server and the user terminal device. The flow restriction conditions include the maximum number of connections and the timeout period, which will be sent to each bank branch application server as an intermediate server through a secure communication channel.

[0052] It should be noted that the token bucket algorithm is a flow control mechanism used to smooth the sending rate of data packets, prevent network congestion, and implement bandwidth speed limits and burst traffic management. It can be likened to a bucket that can store a certain number of tokens. The sending of data packets requires obtaining tokens from this bucket. If there are no tokens, the sending will be delayed or rejected.

[0053] From the above content, it can be seen that the introduction of flow restriction conditions, especially the application of token bucket algorithm, ensures that the banking system can operate stably in a high-concurrency transaction environment and effectively avoids system overload and data congestion.

[0054] In an optional embodiment, a request information packet is obtained from an application server of a sales organization through a first server, wherein the request information packet includes at least the following information: multiple transaction requests that meet transaction parameters; a network identifier of a user terminal device that initiates each transaction request; and user information of a user that initiates each transaction request.

[0055] Optionally, when the activity starts, the customer's transaction request is submitted to the application server of the sales organization, that is, the application server of the product issuing organization. These requests are pre-processed, for example, the qualified transaction requests are screened out according to the transaction parameters, and then packaged into a request information package by the application server and sent to the first server. The request information package includes at least the following key information: multiple transaction requests that meet the transaction parameters, which ensures that the request received by the first server is valid and qualified, and provides a basis for subsequent data processing and routing selection; the network identification of the user terminal device that initiates each transaction request, such as the IP (Internet Protocol) address, which is used to track and verify the source of the transaction request and improve the traceability of the transaction data; the user information of the initiator of each transaction request, such as the user ID (Identification) and account information, which is used to confirm the user's identity and ensure the legitimacy of the transaction.

[0056] From the above content, it can be seen that the purpose of obtaining request information packets is to ensure that the first server can receive all valid transaction requests from customers, and these request information packets contain all the necessary information required to process transactions, thereby laying the foundation for subsequent data transmission path optimization and transaction processing.

[0057] In an optional embodiment, the first server determines an ant colony based on a target rule, wherein the ant colony represents a search process for a data transmission path, and the target rule is used to dynamically update the selection of a data transmission path based on pheromones and path distance, and then the pheromones are updated based on the shared traffic rate at the target time and the length of the path that the ant colony has passed through, and then the target transmission path is determined from multiple data transmission paths between the first server and the second server based on the updated pheromones.

[0058] Optionally, before the activity starts, the first server initializes the ant colony algorithm according to the target rule. Ant Colony Optimization (ACO) is used here to characterize the search process of the data transmission path, which simulates the behavior of ants in nature in finding food paths. The target rule defines how to dynamically update the selection of the data transmission path based on pheromones (representing path preference) and path distance (another factor affecting path selection). This rule ensures that the algorithm can adjust the routing strategy in real time according to changes in network conditions, thereby improving the efficiency and security of data transmission.

[0059] Optionally, after the ant colony is determined, the first server will update the pheromone according to the shared traffic rate at the target time and the length of the path that the ant colony has passed. The shared traffic rate reflects the data transmission rate on the current network link and is an important real-time parameter that affects path selection. The path length represents the number of nodes or link distance that the data packet has passed from the source to the destination. The purpose of updating the pheromone is to reflect the usage and performance changes of the path. For example, the pheromone concentration will increase for a path with a high traffic rate and a short path length, and decrease otherwise. This dynamic mechanism enables the system to automatically identify and prioritize the current optimal transmission path. Based on the updated pheromone concentration, the first server determines the target transmission path from multiple data transmission paths between the first server and the second server.

[0060] From the above content, it can be seen that the first server has realized the dynamic optimization of the data transmission path between the first server and the second server by applying the optimized ant colony algorithm. Specifically, by dynamically updating pheromones to reflect the network status in real time, it is ensured that the optimal path can be selected during the data transmission process. This mechanism not only significantly reduces data transmission delays and improves the efficiency of processing transaction data of hot financial products, but also enhances the security of data transmission, especially when processing high-concurrency requests, it can effectively avoid network congestion and improve user experience. In addition, the dynamic path selection mechanism can also continuously optimize the network transmission strategy, so that the system can respond quickly according to real-time changes in the network, ensure the fast and reliable transmission of financial transaction data, and enhance the overall performance and stability of the bank's transaction system.

[0061] In an optional embodiment, the first server detects the capacity of the data link, wherein the capacity represents the maximum transmission rate of the data link, detects the average utilization of transaction requests entering the data link, wherein the average utilization represents the ratio of the total bandwidth to the capacity when the transaction requests enter the data link, detects the average round-trip time for the transaction requests to traverse the data link, 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, and then determines the shared traffic rate of the data link at the target time based on the capacity, average utilization, average round-trip time and average queue size.

[0062] Optionally, the first server periodically monitors the capacity of the data link. The capacity refers to the maximum transmission rate of the data link at a certain point in time, usually expressed in bits per second (bps). This detection helps to understand the currently available bandwidth resources and provide a basis for subsequent flow control and path selection. The capacity of the data link directly affects the efficiency and speed of data transmission. The average utilization rate of transaction requests entering the data link is detected. The average utilization rate refers to the ratio of the total bandwidth to the link capacity when the transaction request enters the data link at the target time. The first server can calculate the average utilization rate by analyzing the flow rate of the data link over a period of time. This parameter reflects the usage of the data link and helps the first server determine whether there is bandwidth waste or Link overload situation; detect the average round-trip time of transaction requests across the data link. The average round-trip time is a measure of the average time it takes for a data packet to be sent from the source to the target and back to the source. At the target time, the first server will detect the average round-trip time of transaction requests across the data link, which helps to evaluate the efficiency of data transmission and network latency. A lower average round-trip time means faster data transmission and better network performance; detect the average queue size of the data link. The average queue size refers to the amount of data waiting to be sent in the data link at the target time. By monitoring the queue status, the first server can understand the congestion on the current link. A larger queue size means that the link may be close to saturation and measures need to be taken to prevent data packet loss or delays.

[0063] Optionally, based on the above-detected capacity, average utilization, average round-trip time and average queue size, the first server calculates a fair sharing traffic rate (shared traffic rate) of the data link at the target time.

[0064] From the above content, it can be seen that the first server detects the capacity, average utilization, average round-trip time and average queue size of the data link, and effectively determines the fair sharing traffic rate of the data link at the target time. This mechanism not only ensures the rapid transmission of hot financial product transaction requests, but also avoids network congestion and resource waste through real-time monitoring of network status, ensuring the stability and security of data transmission. In addition, by dynamically adjusting the shared traffic rate, this embodiment can adapt to changes in network traffic, providing the banking system with an efficient solution for processing instantaneous high-concurrency transaction requests, significantly improving the efficiency of transaction processing and user experience.

[0065] In an optional embodiment, the first server first detects the data size of the transaction request, then determines the time range for the transaction request to arrive at the second server, and then detects the load parameter, wherein the load parameter represents the load condition of the data link when the ant colony passes through the first server at the target time, and then detects the time parameter, wherein the time parameter represents the degree of match between the time when the transaction request arrives at the second server according to the path selected by the ant colony when the ant colony passes through the first server at the target time and the time range, and then determines the path distance function according to the data size of the transaction request, the time range for the transaction request to arrive at the second server, the load parameter and the time parameter, and finally determines the target transmission path from multiple data transmission paths between the first server and the second server according to the path distance function and the updated pheromone.

[0066] Optionally, when receiving a transaction request, the first server detects and records the data size of each transaction request. The purpose of this step is to evaluate the potential impact of each request on the data link. The detection of data size helps in subsequent path selection and flow control, ensuring the reasonable allocation of network resources. Then, according to the nature and requirements of the transaction activity, the first server determines the time range for the transaction request to depart from the first server and arrive at the second server. This time range may be based on the start and end time of the activity and the priority of the transaction processing. Determining the time range helps to optimize the transmission order of the transaction request and ensure that the transaction is completed within the effective time. Then the first server detects the load of the data link. The load parameter reflects the link's load. The first server further detects the time parameter, which reflects the degree of match between the time when the transaction request arrives at the second server according to the current path selection and the predetermined time range. Then, based on the data size, arrival time range, load parameters of the data link and time parameters of the transaction request, the first server calculates the path distance function. The path distance function is a quantitative indicator used to evaluate the advantages and disadvantages of different paths. It comprehensively considers the physical distance, network delay, bandwidth occupancy and time window matching of the path, and provides data support for the subsequent selection of the optimal path. Finally, the first server determines the optimal target transmission path from multiple data transmission paths based on the path distance function and the updated pheromone concentration.

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

[0068]

[0069] Among them, size represents the data size, w represents the time range, δ j (k, t) represents the load parameter (the load of the link when ant colony k passes through path j at time t), ε j (k, t) represents the time parameter (at time t, when ant colony k passes through path j, the degree of conformity of path selection with the time window).

[0070] From the above content, it can be seen that the intelligent optimization of the data transmission path is achieved through the above method. First, by detecting the data size, time range, data link load and time parameters of the transaction request, the impact of the transaction request on the network can be comprehensively evaluated to provide a basis for path selection. Secondly, the determination of the path distance function enables the first server to quantitatively compare the advantages and disadvantages of different paths to ensure the selection of the most appropriate transmission path. Finally, the ant colony algorithm and pheromone update mechanism are combined to dynamically select the optimal path, avoiding network congestion and improving the timeliness and stability of data transmission.

[0071] In an optional embodiment, the first server detects the shared traffic rate of the data link at time tT, where T is the shared traffic rate update period preset for the data link, and then determines the shared traffic rate of the data link at time t based on the capacity, average utilization, average round-trip time, average queue size, and the shared traffic rate of the data link at time tT.

[0072] Optionally, the first server periodically detects the shared traffic rate of the data link at time tT. At the same time, the first server collects multiple real-time network parameters, including the capacity of the data link (i.e., the maximum transmission rate), the average utilization rate of transaction requests entering the data link, the average round-trip time of transaction requests crossing the data link, and the average queue size of the data link at time t. These parameters reflect the current status and performance of the link, including the utilization of bandwidth resources, data transmission delay, and network congestion status. The first server calculates the shared traffic rate of the data link at time t based on the shared traffic rate at time tT and the currently collected network parameters (capacity, average utilization rate, average round-trip time, and average queue size). This calculation process comprehensively considers the real-time status and historical performance of the link, ensuring that the setting of the traffic rate can fully utilize the bandwidth resources of the link, avoid network congestion and delay, and maintain the stability and efficiency of data transmission.

[0073] Optionally, the shared traffic rate R(t) is calculated as shown in formula (2):

[0074]

[0075] Where t is the current time, T is the time interval for flow rate updates, C is the capacity, y(t) is the average utilization of the incoming link, d is the average round-trip time of traffic (historical transaction requests) crossing the link, q(t) is the average queue size, γ and δ are configurable parameters (used to adjust the influence of y(t) and q(t) on the shared traffic rate R(t), which are configurable weight parameters in the RCP algorithm (Rate Control Protocol, a rate-based congestion control algorithm). The values ​​of γ and δ determine the relative importance of average utilization and queue size when calculating the new shared traffic rate).

[0076] From the above content, it can be seen that the first server provides a mechanism for dynamically updating the shared traffic rate, which effectively improves the ability of the banking system to process hot financial product transaction data. First, by regularly detecting the shared traffic rate at time tT and combining it with real-time network parameters, the first server can accurately calculate the shared traffic rate at time t. This process avoids excessive use of data links or waste of resources. Secondly, the updated traffic rate can guide the reasonable scheduling of transaction requests, ensure that data packets arrive at the destination safely in the shortest time, and improve the response speed and success rate of transactions. Finally, the strategy of dynamically adjusting the traffic rate enhances the adaptability and flexibility of the system, and can maintain the stability of data transmission even when the network environment changes, providing a reliable solution for high-concurrency transaction processing for the banking system, significantly improving user experience and transaction security.

[0077] In an optional embodiment, the first server obtains the pheromone concentration on the hth data transmission path from the first server to the second server, wherein the pheromone concentration is proportional to the usage frequency of the hth data transmission path, and the hth data transmission path is any data transmission path between the first server and the second server. Then, the inverse of the path distance of the hth data transmission path is used as an inspiration value, and then the probability of the ant colony selecting the hth data transmission path to move from the first server to the second server is determined based on the inspiration value and the pheromone concentration. Finally, the target rule is determined based on the probability, and the ant colony is initialized based on the target rule.

[0078] Optionally, the first server first obtains the pheromone concentration on the hth data transmission path from the first server to the second server. Through this mechanism, the first server can identify which paths are relatively busy or reliable in the current environment. After obtaining the pheromone concentration, the first server uses the reciprocal of the path distance of the hth data transmission path as the heuristic value. The reciprocal of the path distance reflects the shortness of the path. The shorter the path, the greater the heuristic value, which indicates that the path has a greater advantage in distance. The heuristic value is an important parameter in the ant colony algorithm to guide the ant colony to select the path. It and the pheromone concentration jointly affect the probability of path selection. Then, according to the heuristic value and pheromone of the hth data transmission path, the first server selects the path from the first server to the second server. Concentration, the first server calculates the probability that the ant colony chooses the path to move from the first server to the second server. This probability calculation is the core of the ant colony algorithm. It comprehensively considers the distance advantage and historical usage of the path, making the ant colony more inclined to choose a path with a short path, high usage frequency and good current status, thereby improving the efficiency and timeliness of data transmission. Finally, the first server determines the target rule based on the calculated path selection probability and initializes the ant colony according to the target rule. The target rule defines how the ant colony considers the relative importance of pheromone concentration and heuristic value in path selection. Initializing the ant colony is to set the initial state of the ant colony, including the number of ants, the location of the ant colony, etc. This step prepares for the start of the path search process and ensures that the data transmission path can be dynamically optimized based on the latest network conditions and historical data.

[0079] From the above content, it can be seen that through the above method, the first server can continuously optimize path selection when processing instantaneous high-concurrency transaction requests, avoid network congestion, and ensure the stability and security of data transmission.

[0080] In an optional embodiment, the first server 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 data transmission path, and then detects a set of data transmission nodes that the ant colony can choose to move from the first server to the second server, and then determines the probability of the ant colony selecting the hth data transmission path to move from the first server to the second server based on the first parameter, the set, the heuristic value and the pheromone concentration.

[0081] Optionally, the first server first obtains a first parameter, which is used to balance the importance of the heuristic value and the pheromone concentration when selecting a data transmission path. Next, the first server detects a set of data transmission nodes that the ant colony can choose from the first server to the second server. This set includes all possible data transmission nodes, including communication servers of various bank branches and network switches within the bank. The purpose of detecting the set is to determine the currently available transmission path to facilitate subsequent path probability calculations. Then, based on the obtained first parameter, the data transmission node set, the heuristic value, and the pheromone concentration, the probability of the ant colony selecting the hth data transmission path to move from the first server to the second server is determined.

[0082] Optionally, the above probability p k The calculation method of (a, b) is shown in formula (3):

[0083]

[0084] Among them, p k (a, b) represents the probability of the ant colony selecting the hth data transmission path (path a to b), J k (r) is the set of data transmission nodes that can be selected by ant colony k (from a to b) (the set of data transmission nodes that the ant colony can select from the first server to the second server), β is the first parameter, τ is the pheromone concentration, τ(a,b) represents the pheromone concentration on the path from a to b, μ(a,b) represents the heuristic value of the path from a to b (μ=1 / δ(a,b) represents the inverse of the path distance δ(a,b) between a and b), a and b represent the first node and the second node respectively, usually β>0, and the variable s represents the next node that the ant colony k may select at the current node a. Represents the weighted sum of the pheromone heuristic values ​​from node a to all possible next nodes b.

[0085] From the above content, it can be seen that the first server significantly improves the path selection efficiency and reliability of the hot financial product transaction data processing system in a high concurrency environment by setting the first parameter, detecting the data transmission node set, and calculating the path selection probability.

[0086] In an optional embodiment, the first server determines the target transmission path from the first server to the second server at the target time based on the random value, the preset constant parameter, the target random variable, the updated pheromone and the path distance function, wherein the random value is a value randomly determined from a data interval of 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 following the target rule.

[0087] Optionally, the first server determines the target transmission path according to a random value, a preset constant parameter, a target random variable, the updated pheromone, and a path distance function. This path is the optimal path selected by the intelligent algorithm from all possible paths from the first server to the second server at the target moment, taking into account factors such as randomness, pheromone concentration, and physical distance.

[0088] Optionally, the calculation method of the target communication path s is shown in formula (4):

[0089]

[0090] where 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 the state transition rule, and τ(a,u) is the updated pheromone.

[0091] Optionally, in formula (4) is to find which of all possible next nodes b from node a to node set J k (a) has the highest comprehensive evaluation value. The comprehensive evaluation value consists of two parts: the pheromone concentration (τ(a,u)) and the β power of the path heuristic value (μ(a,u)). The pheromone concentration reflects the frequency of past data packets or ant colonies using this path, and the heuristic value is usually related to the reciprocal of the path distance, indicating the relative attractiveness of the path. β is a parameter that controls the relative importance of the pheromone and the heuristic value. When β is larger, the heuristic value plays a more important role, and when β is smaller, the influence of the pheromone concentration is more significant. If the random number q is less than the preset threshold q0, then ant colony k will select the node b with the highest comprehensive evaluation value as the next node to move to. If the condition (q < q0) does not hold, that is, q is greater than or equal to q0, then ant colony k will randomly select a node from all possible next nodes (J k (a)) as the target node S.

[0092] As can be seen from the above, the first server realizes the intelligent path selection from the first server to the second server at the target moment, ensuring that the transaction data can be transmitted through the optimal path. By dynamically adjusting the pheromone concentration and optimizing the path distance function, this embodiment effectively improves the ability to process instantaneous high-concurrency transaction requests, reduces network latency, improves the stability and security of transaction data transmission, provides an optimized solution for transaction processing in a high-concurrency environment for the banking system, and significantly enhances the user experience and the overall performance of the banking system.

[0093] In an optional embodiment, a communication encryption protocol is sent to a user terminal device through a first server, wherein the communication encryption protocol is used to generate a registration account, key information bound to the user, and a personal digital certificate for the user based on user information provided by the user; after the registration account is generated, a master key, a user key, and a public key corresponding to the registration account are generated, and a transaction request that meets the transaction parameters and is encrypted by the user terminal device based on the communication encryption protocol is received through the first server.

[0094] Optionally, the first server sends a communication encryption protocol to the user terminal device, which includes rules for key generation and data encryption, and is used to generate a registered account, key information bound to the account (including a master key and a user key), and a personal digital certificate based on the information provided by the user. The user submits personal related information for registration on the terminal device through the interface provided by the communication encryption protocol. After receiving this information, the first server generates a registered account for the user, and at the same time generates a master key and a user key corresponding to the account. The master key is used to encrypt and decrypt transaction data, while the user key is used to protect the security of the user's personal data. After generating the registered account and key information, the first server generates a personal digital certificate for the user. The digital certificate includes the user's registration information and public key, which is used to prove the legitimacy of the user's identity and the integrity of the transaction data. After completing the registration and obtaining the key information and digital certificate, the user terminal device can use the communication encryption protocol to encrypt the transaction request. The encrypted transaction request will be transmitted to the bank system through the first server for processing. The first server receives these encrypted transaction requests, ensuring the security of the transaction data during transmission. Even if it encounters an attack in the network environment, the transaction information can be protected.

[0095] It can be seen from the above content that the first server ensures the secure processing of transaction data through the above method, providing users with a safe and convenient financial product trading environment.

[0096] In an optional embodiment, the first server obtains a generator and an order of a bijective group, wherein the generator represents a set of elements that generate the entire bijective group, and the order represents the total number of elements in the bijective group, and then randomly selects a first value, a second value, and a third value, wherein the first value, the second value, and the third value are different values, and then generates a master key based on the first value, the second value, and the generator, and then generates a user key based on the generator, the third value, and the first value, and finally generates a public key based on the generator, the order, the first value, and the second value.

[0097] Optionally, the first server first obtains a generator and order of a bijective group, where the generator is an element that can generate the entire bijective group (a finite set of elements with certain specific properties), and the order represents the total number of elements in the bijective group. By clearly defining the generator and order of the bijective group, the first server can ensure the determinism and security of the key generation process. Next, the first server randomly selects three numerical values, which are different from each other. These random numerical values ​​are the key to key generation. Their selection must follow the security principles of cryptography to ensure that the generated keys have sufficient randomness and complexity to resist potential cryptographic attacks. Then, the first server generates a master key based on the first numerical value, the second numerical value and the generator. Next, the first server generates a user key based on the generator, the third numerical value and the first numerical value. Finally, the first server generates a public key based on the generator, the order of the bijective group, the first numerical value and the second numerical value.

[0098] Optionally, Figure 3 is a schematic diagram of an optional client transaction terminal structure according to an embodiment of the present application, such as Figure 3 As shown, the customer transaction terminal can be a user's smart phone, tablet computer, laptop computer and other terminal devices, and the device may include: user registration module 31, key generation module 32, transaction query module 33, and transaction request module 34. Among them, the user registration module 31 is responsible for providing an interface and interface for bank customers to register on the system to obtain a bank user identity. When registering, it is necessary to submit personal identity information. After successful registration, relevant keys and personal digital certificates are downloaded to ensure data security during the transaction process; the key generation module 32 is responsible for generating a master key M for the customer after the application for customer registration is successful. k and user key S k , the specific generation method is as follows:

[0099] Step 1: After the application customer successfully registers, the system submits a request to initialize security parameters;

[0100] Step 2: After receiving the request, the client calls the key initialization module setup to generate the master key; then calls the key generation module to generate the key S k The specific steps are as follows:

[0101] (1) Initialization (Setup): The setup module selects a bijective group G0, whose generator is g and whose order is a prime number p. p Randomly select two random numbers α, β∈Z p As the exponent, the master key M is obtained based on the random numbers α, β and the generator g. k , the calculation method is shown in formula (5), and the public key PK is expressed as a tuple as shown in formula (6):

[0102] M k =(β,g α ) (5)

[0103]

[0104] Among them, DID H ∈DID represents the DID (digital identity) of the owner of the digital file, and e(g,g) is a value calculated on the generator (g) using a bilinear map (e).

[0105] (2) Generate key S k : Supplementary input parameters, expressed as keyGen(M k ,S), where M k is the master key, 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 , the key is expressed as shown in formula (7):

[0106]

[0107] Among them, r∈Z p is a random number. For each attribute j∈S, r j ∈Z p is a random number, is a hash function used to convert attribute j into a fixed-length value, r j is a random number associated with attribute j and used to generate the attribute-related key part.

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

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

[0110] Step 5: Digital identity DID, master key M k , the user's public key PK is stored, and the following encryption function is executed to encrypt the symmetric key to generate the symmetric key pk b The ciphertext And return to the user, the ciphertext is represented as shown in formula (8):

[0111]

[0112] Among them, Encry is an encryption function used to encrypt plaintext data into ciphertext, sk b Represents the user's private key.

[0113] Step 6: Send the security parameters back to the client, store the symmetric private key locally, and return a message indicating that the security parameters have been successfully initialized.

[0114] The transaction query module 33 is responsible for providing interfaces and interfaces to customers, through which customers can query tradable financial products and query historical transaction records; the transaction request module 34 is responsible for providing interfaces and interfaces to customers, through which customers can submit buy and sell transaction requests to the bank application server, and the request data includes at least the type, quantity, price, etc. of the financial products purchased or sold.

[0115] From the above content, it can be seen that the first server defines the generator and order of the bijective group, combines randomly selected numerical values ​​to generate the master key, user key and public key, and constructs a key generation mechanism based on the bijective group, which significantly improves the security of hot financial product transaction data.

[0116] In an optional embodiment, when the first server detects that the ant colony has passed through the hth data transmission path, it determines the incremental update value corresponding to the pheromone concentration based on the shared traffic rate and the length of the path that the ant colony has passed through. When it detects that the ant colony has not passed through the hth data transmission path, it determines that the incremental update value corresponding to the pheromone concentration is 0. Finally, the pheromone is updated based on the incremental update value, the number of ant colonies, and the pheromone decay factor, wherein the pheromone decay factor is used to simulate the speed at which the pheromone disappears over time.

[0117] Optionally, during the process of transmitting the transaction request, the first server continuously monitors the movement path of the ant colony to detect whether the ant colony has passed through the hth data transmission path. When it is detected that the ant colony has passed through the hth data transmission path, the first server calculates the incremental update value corresponding to the pheromone concentration based on the shared traffic rate and the length of the path that the ant colony has passed. If the first server detects that the ant colony has not passed through the hth data transmission path, it determines that the incremental update value corresponding to the pheromone concentration is 0, which means that the unused path will not obtain additional concentration improvement in the current round of pheromone updates. The purpose of this is to avoid excessive preference for unverified paths and maintain fairness and diversity in path selection. Finally, the first server updates the pheromone concentration based on the incremental update value determined above, the number of ant colonies, and the pheromone decay factor. The pheromone decay factor is used to simulate the speed at which pheromones disappear over time to ensure that the pheromone concentration can reflect the latest usage of the path.

[0118] Optionally, the incremental update value Δτ corresponding to the pheromone concentration k The calculation method of (a, b) is shown in formula (9):

[0119]

[0120] Where R(t) is the shared traffic rate, L k is the length of the path traversed by ant colony k. Formula (9) indicates that if (a, b) ∈ Routes for every k holds, that is, ant colony k has indeed passed through the path from node a to node b in the current search process, then Δτ k (a,b) will be set to If the condition if(a,b)∈Routes for every k does not hold, that is, ant colony k has not used the path from node a to node b, then Δτ k (a,b) will be set to 0.

[0121] Optionally, the pheromone update rule τ(a,b) is as shown in formula (10):

[0122]

[0123] Among them, 0<α<1 represents the pheromone attenuation factor, and m represents the number of ant colonies.

[0124] Optionally, formula (10) indicates that the update of pheromone concentration includes both the attenuation of pheromone (implemented by the ((1-α).τ(a,b) part) and the incremental update of pheromone concentration for all ant colonies k passing through the path according to their path selection (implemented by Partially implemented).

[0125] From the above content, it can be seen that the first server provides a pheromone dynamic update mechanism based on the ant colony algorithm to optimize the transmission path of hot financial product transaction data. First, by detecting the paths passed by the ant colony, the utilization efficiency and traffic conditions of each path can be accurately evaluated. Then, according to the target traffic rate and the length of the path, the pheromone concentration is dynamically adjusted to realize the reward mechanism for efficient paths. Finally, through the use of the pheromone attenuation factor, the dynamic balance of path selection is maintained.

[0126] In an optional embodiment, Figure 4 is a schematic diagram of an optional communication server structure according to an embodiment of the present application, such as Figure 4As shown, the communication server includes a communication module 41 , a traffic collection module 42 , a security calculation module 43 , a message processing module 44 , and a routing management module 45 . Among them, the communication module 41: as the entrance of the data transmission node, it interacts with other communication servers to realize data message sending and receiving; the traffic collection module 42: is responsible for collecting traffic data for the data transmission node, managing the network traffic, and realizing the tracking, collection and recording of the data transmission traffic; the security calculation module 43: is responsible for using the cryptographic algorithm to encrypt and decrypt the generated data message; the message processing module 44: is responsible for executing the parsing and splitting of the user data, forming a data vector and assembling the user data message. Table 1 is an example of an optional message format according to an embodiment of the present application. As shown in Table 1, the IP header represents the data message header, Next hop represents the next hop routing information; type represents the message type, TYPE=0X1 represents sending a message; TYPE=0x2 represents receiving a message, etc.; reserved represents the receiver's public key; sender represents the sender's public key; SwitchID represents the ID of the switch; QueueSize represents the length of the queue; ephemeral represents a temporary credential; timestamp represents the sending timestamp; mac1 represents physical address 1; mac2 represents physical address 2; static represents static information. In this table, bytes refers to the basic unit of data storage or transmission, i.e., bytes. For example, in the given table, mac1 (16 bytes) and mac2 (16 bytes) represent the physical address (MAC address) field, and each MAC address occupies 16 bytes of storage space. In order to ensure the integrity and security of the data packet during network transmission, the intelligent processing system generates the hash form header information corresponding to the data packet through the hash algorithm. The generation method of the hash form header information is 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), Construct represents the content information of the structure, PK(i) represents the public key of the data transmission node i, and || represents the byte sequence cascade operation symbol.

[0129] Table 1

[0130]

[0131] Routing management module 45: responsible for managing the routing of data transmission messages, saving, deleting and adding routing information, etc. The routing management module includes two stages in the execution process: initialization and dynamic update of pheromones. The operation principle of this module involves two algorithms (congestion control algorithm RCP and ant colony algorithm), as follows:

[0132] Phase 1: Initialization:

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

[0134] Step 2: Assume that the value of pheromone τ(a,b) is a constant c, and the initialization is expressed as τ(a,b)=c, where a and b represent the source node and the destination node;

[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 (average flow rate), and calculate it as shown in formula (12):

[0137]

[0138] Among them, 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 2: Low-latency network control routing strategy algorithm:

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

[0141] Output: Shortest, a low-latency network control routing strategy;

[0142] The algorithm steps are as follows:

[0143] Step 1: Collect traffic data. The traffic collection module will periodically collect information such as switch ID, queue size, link utilization, average link sharing rate, etc., calculate d0, and update the corresponding variables in the local memory. For example (PUSH [switch ID: SwitchID]; PUSH [queue size: QueueSize]; PUSH [link utilization: RX-Utility]; PUSH [average sharing rate: RCP-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 k, let Shortest be the optimal path for each iteration;

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

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

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

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

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

[0150] Step 5.1.2: Execute the following state transfer function to calculate the pheromone from the ant colony to each node (such as formula (3));

[0151] Step 5.1.2.1: Update pheromone τ(a, b), and cyclically update pheromone parameters. The basic idea is that the concentration of pheromone is proportional to the fair sharing rate. The specific method of updating pheromone is: based on the path distance μ and the fair sharing rate R(t) of the link, calculate the pheromone concentration and continuously update the pheromone τ. The pheromone update rules are as shown in formula (9)-formula (10);

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

[0153] Step 5.1.2.3: Get the file segment size (assuming the file segments have the same size) and the time window w, assuming w is a time range [e i ,l i ],e i represents the earliest arrival time, l i represents the latest arrival time (the stay time is negligible). Then the path distance function μ of the pheromone transfer matrix is ​​optimized and adjusted to It is formally expressed as formula (1);

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

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

[0156] Step 6.1: Calculate the length of each path and 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 unupdated path as the worst value;

[0160] Step 7: Output the optimal routing information. The optimal routing selection is to select the optimal path s according to the concentration of pheromone, as shown in formula (4).

[0161] In an optional embodiment, Figure 5 is a flow chart of an optional routing management module processing data according to an embodiment of the present application, such as Figure 5 As shown, the following steps are included: Step S501: Initialize security parameters, ant colony parameters, generate public and private keys, etc., such as the initialization parameters of the elliptic curve algorithm X25519 used in this example; execute the GenKey() function, for each data transmission node i (i∈[1,n]), cyclically generate the public key pk(i) and private key sk(i) of the data transmission node i, and at the same time, upload pk(i) to the blockchain for evidence storage; in form, as shown in formula (13):

[0162] (pk(i),sk(i))=genkey(1 k ) (13)

[0163] Among them, 1 k represents a binary number of length k, where all bits are 1.

[0164] Step S502: for each process or ant colony k (k∈[1,n]), the following processing is performed cyclically;

[0165] Step S503: For all nodes i (i∈[1,n]), if i is not the target node, execute the following loop;

[0166] Step S504: Execute the following flow rate control protocol calculation steps to calculate the fair sharing rate R(t) of each link (Formula (2));

[0167] Step S505: Initialize the path search process (ant colony) and calculate the state transition rule. The state transition rule is defined as shown in formula (3);

[0168] Step S506: Update pheromone τ(a, b) according to the instantaneous flow rate, and cyclically update pheromone parameters. The specific method of updating pheromone is: based on the path distance μ and the fair sharing rate R(t) of the link as clues, calculate the pheromone concentration and continuously update the pheromone τ. The pheromone update rules are shown in formulas (9)-(10);

[0169] Step S507: If the currently visited node does not exist in the visited node set, perform the following steps;

[0170] Step S508: adding the currently visited node I to the visited node set;

[0171] Step S509: Update pheromone parameters and other information according to the time window and load conditions. Get the file segment size size (assuming the file segment sizes are the same), the time window w, and assume w is a time range [e i ,l i ],e i represents the earliest arrival time, l i represents the latest arrival time (the stay time is negligible). Then the path distance function μ of the pheromone transfer matrix is ​​optimized and adjusted to As shown in formula (1);

[0172] Step S510: For each ant colony process k (k∈[1,n]), perform the following processing;

[0173] Step S511: Update pheromone τ(a,b) according to the instantaneous flow rate, and cyclically update pheromone parameters. The specific method of updating pheromone is: calculate the pheromone concentration according to the path distance μ and the fair sharing rate R(t) of the link as clues, and continuously update the pheromone τ;

[0174] Step S512: Update the dynamic routing table. Execute the optimization path selection function to select the optimal path. The operation is as follows: According to the concentration of pheromone, select the best path s, as shown in formula (4);

[0175] Step S513: Complete the routing table update and start multi-party data transmission.

[0176] In an optional embodiment, Figure 6 is a flowchart of an optional hot financial product transaction data processing according to an embodiment of the present application, such as Figure 6 For example, if a customer of Bank A Branch participates in a product promotion activity held by a financial product issuer, the specific steps are as follows:

[0177] Step S601: The financial product issuing institution configures the hot financial product transaction parameters on the institution's application server, including: the start and end time of financial product transaction activities, the total inventory quota of financial products, the financial product quota allocated to each branch, the qualification parameters of financial product participants, the maximum number of connections and the timeout period, etc., and synchronizes them to all other branch application servers through the communication server. The customer of Branch A completes the real-name user registration on the transaction terminal, the customer transaction terminal is initialized, and the key is downloaded to the customer terminal.

[0178] Step S602: After the activity starts, the customer submits a financial product transaction request on the customer transaction terminal, and the transaction request is submitted to the application server of Branch A. The application server configures high concurrency parameters, wherein the parameter setting uses a token bucket algorithm to limit access traffic, thereby filtering each of the hot financial product transaction requests, retaining valid hot financial product transaction requests that meet the preset hot financial product transaction conditions, matching each of the hot financial product transaction requests with each inventory quota in the inventory control module one by one, and generating the corresponding order qualification certificate for the customer. The branch application server sends the hot financial product transaction request data that meets the requirements to the communication server. The application server classifies and packages the transaction requests for the same target product, and the request information package includes the source IP of the client, the URL address of the request interface, and user information. The data packet is sent to the communication server of Branch A.

[0179] Step S603: After the communication server of branch A receives the identity authentication request transaction request, the routing management module on the server is initialized, and the routing management module executes the GenKey() function (an algorithm or program function for generating a key pair (public key and private key)). For each data transmission node i (i∈[1,n]), the public key pk(i) and private key sk(i) of the data transmission node i are cyclically generated. For all nodes i (i∈[1,n]), if i is not the target node, the following calculation steps of the flow rate control protocol are executed to calculate the fair sharing rate of each link as shown in formula (2), initialize the path search process, add the state transfer rule as shown in formula (3), and the routing management module updates the pheromone τ(a,b) according to the instantaneous flow rate and cyclically updates the pheromone parameters. The specific method for updating pheromones is: based on the path distance μ and the fair sharing rate R(t) of the link, calculate the pheromone "concentration" and continuously update the pheromone τ. The pheromone update rules are as shown in formula (9)-formula (10). If the current access communication server node does not exist in the visited node library, the routing management module adds the current access node to the visited node library. Update pheromone and other information according to time slicing and load conditions. Get the file slicing size size (assuming the file slicing size is the same), time window w, and assume w is a time range [e i ,l i ],e i represents the earliest arrival time, l i represents the latest arrival time (the stay time is negligible). Then the path distance function μ of the pheromone transfer matrix is ​​optimized and adjusted to It is formally expressed as formula (1);

[0180] Step S604: 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 execution operation is as follows: According to the "concentration" of pheromone, the optimal path s is selected, as shown in formula (4);

[0181] Step S605: After the next communication server receives the communication packet, it continues to calculate the fair sharing rate of each link based on the communication destination node server address of the communication message packet, executes the optimized path selection function, selects the optimal path, and transmits the data packet to the next communication server. The communication servers along the way repeatedly perform this step until the data packet is transmitted to the communication server of the product issuing agency.

[0182] Step S606: The communication server of the product issuing institution sends the transaction data packet to the application server of the product issuing institution. The application server of the product issuing institution receives the transaction request data and processes the transaction according to the transaction quantity and transaction amount in the request data. After the communication is successful, the public account of the branch is credited and the transaction result is returned to the communication server of the product issuing institution.

[0183] Step S607: Each communication server of the bank uses the same data processing method to transmit the transaction result data packet to the application server of Branch A. The application server of Branch A updates the personal account of the customer according to the transaction result and returns the transaction result to the customer's transaction terminal. The transaction is completed.

[0184] The embodiment of the present application also provides a transaction data processing device for a financial product. It should be noted that the transaction data processing device for a financial product in the embodiment of the present application can be used to execute the transaction data processing method for a financial product provided in the embodiment of the present application. The transaction data processing device for a financial product provided in the embodiment of the present application is introduced below.

[0185] According to an embodiment of the present application, a transaction data processing device for implementing the above-mentioned financial product is also provided. Figure 7 is a schematic diagram of an optional transaction data processing device for a financial product according to an embodiment of the present application, such as Figure 7 As shown, the device includes: a receiving unit 701, an uploading unit 702, a determining unit 703, and a sending unit 704.

[0186] Optionally, the receiving unit 701 is used to receive transaction parameters sent by the second server of the issuing institution of the target financial product through the first server of the sales institution of the target financial product, wherein the transaction parameters are used to characterize the restriction conditions for purchasing the target financial product, and the target financial product is a financial product designated to be sold within a preset time period; the uploading unit 702 is used to obtain a transaction request that meets the transaction parameters uploaded by the user terminal device through the first server; the determining unit 703 is used to determine the target transmission path from multiple data transmission paths between the first server and the second server through the first server according to the shared traffic rate of the data link between the first server and the second server; the sending unit 704 is used to send the transaction request to the second server through the first server based on the target transmission path.

[0187] Optionally, the transaction parameters include at least one of the following parameters: a first parameter for limiting the transaction time of the target financial product; a second parameter for limiting the total quantity of the target financial products; a third parameter for limiting the maximum sales quantity of the target financial products by each sales institution; a fourth parameter for limiting the purchasing population of the target financial products; and a fifth parameter for limiting the maximum number of communication connections between the first server and the second server.

[0188] Optionally, the transaction data processing device for financial products also includes: a sending unit, used to send transaction parameters and traffic restriction conditions to the application server of the sales organization through the first server, wherein the traffic restriction conditions are used to limit the access traffic between the application server and the user terminal device through a token bucket algorithm, and the application server is an intermediate server between the user terminal device and the first server, and the application server is used to screen transaction requests according to the transaction parameters and traffic restriction conditions.

[0189] Optionally, the transaction data processing device for financial products also includes: an acquisition unit, used to obtain a request information package from the application server of the sales organization through the first server, wherein the request information package includes at least the following information: multiple transaction requests that meet the transaction parameters; the network identification of the user terminal device that initiates each transaction request; and user information of the user who initiates each transaction request.

[0190] Optionally, the determination unit 703 includes: a first determination subunit, a first updating subunit, and a second determination subunit. The first determination subunit is used to determine the ant colony according to the target rule, wherein the ant colony represents the search process of the data transmission path, and the target rule is used to dynamically update the selection of the data transmission path according to the pheromone and the path distance; the first updating subunit is used to update the pheromone according to the shared traffic rate at the target time and the path length that the ant colony has passed; the second determination subunit is used to determine the target transmission path from the multiple data transmission paths between the first server and the second server according to the updated pheromone.

[0191] Optionally, the transaction data processing device of financial products further includes: a first detection unit, a second detection unit, a third detection unit, a fourth detection unit, and a first determination unit. The first detection unit is used to detect the capacity of the data link, wherein the capacity represents the maximum transmission rate of the data link; the second detection unit is used to detect the average utilization rate of the transaction request entering the data link, wherein the average utilization rate represents the ratio of the total bandwidth to the capacity when the transaction request enters the data link; the third detection unit is used to detect the average round-trip time of the transaction request crossing the data link; the fourth detection unit is used to detect 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; the first determination unit is used to determine the shared traffic rate of the data link at the target time according to the capacity, average utilization rate, average round-trip time and average queue size.

[0192] Optionally, the second determination subunit includes: a first detection module, a first determination module, a second detection module, a third detection module, a second determination module, and a third determination module. The first detection module is used to detect the data size of the transaction request; the first determination module is used to determine the time range for the transaction request to arrive at the second server; the second detection module is used to detect the load parameter, wherein the load parameter represents the load of the data link when the ant colony passes through the first server at the target time; the third detection module is used to detect the time parameter, wherein the time parameter represents the degree of matching between the time when the transaction request arrives at the second server according to the path selected by the ant colony when the ant colony passes through the first server at the target time and the time range; the second determination module is used to determine the path distance function according to the data size of the transaction request, the time range for the transaction request to arrive at the second server, the load parameter, and the time parameter; the third determination module is used to determine the target transmission path from multiple data transmission paths between the first server and the second server according to the path distance function and the updated pheromone.

[0193] According to another aspect of the present application, a computer-readable storage medium is also provided, the computer-readable storage medium including a stored executable program, wherein when the executable program is running, the device where the computer-readable storage medium is located is controlled to execute the above-mentioned financial product transaction data processing method.

[0194] According to another aspect of the present application, an electronic device is provided, comprising: a memory storing an executable program; and a processor for running the program, wherein the above-mentioned method for processing transaction data of financial products is executed when the program is running.

[0195] According to another aspect of the present application, a computer program product is also provided, comprising computer instructions, which implement the steps of the above-mentioned method for processing transaction data of financial products when executed by a processor.

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

[0197] In the above embodiments of the present application, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, please refer to the relevant description of other embodiments.

[0198] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of the units can be a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.

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

[0200] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0201] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, disk or optical disk and other media that can store program codes.

[0202] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A method for processing transaction data of financial products, characterized in that: include: Receiving, through a first server of a sales institution of a target financial product, a transaction parameter sent by a second server of an issuing institution of the target financial product, wherein the transaction parameter is used to characterize a restriction condition for purchasing the target financial product, and the target financial product is a financial product designated to be sold within a preset time period; Acquiring, through the first server, a transaction request uploaded by a user terminal device that meets the transaction parameters; Determining, by the first server, a target transmission path from a plurality of data transmission paths between the first server and the second server according to a shared flow rate of a data link between the first server and the second server; Based on the target transmission path, the transaction request is sent to the second server through the first server.

2. The transaction data processing method of financial products according to claim 1, characterized in that: The transaction parameters include at least one of the following parameters: The first parameter is used to limit the trading time of the target financial product; The second parameter is used to limit the total quantity of the target financial products; A third parameter is used to limit the maximum sales quantity of the target financial product by each of the sales institutions; The fourth parameter is used to limit the purchase group of the target financial product; The fifth parameter is used to limit the maximum number of communication connections between the first server and the second server.

3. The transaction data processing method of financial products according to claim 1, characterized in that: Before obtaining, through the first server, a transaction request uploaded by a user terminal device and satisfying the transaction parameters, the method further includes: The transaction parameters and traffic restriction conditions are sent to the application server of the sales organization through the first server, wherein the traffic restriction conditions are used to limit the access traffic between the application server and the user terminal device through a token bucket algorithm, and the application server is an intermediate server between the user terminal device and the first server, and the application server is used to screen the transaction requests according to the transaction parameters and the traffic restriction conditions.

4. The transaction data processing method of financial products according to claim 3, characterized in that: After sending the transaction parameters and traffic restriction conditions to the application server of the sales organization through the first server, the method further includes: Obtaining a request information packet from the application server of the sales organization through the first server, wherein the request information packet includes at least the following information: a plurality of said transaction requests satisfying said transaction parameters; The network identification of the user terminal device that initiates each of the transaction requests; The user information of the initiator of each transaction request.

5. The method for processing transaction data of financial products according to claim 3, characterized in that: Determining, by the first server, a target transmission path from a plurality of data transmission paths between the first server and the second server according to a shared flow rate of a data link between the first server and the second server, comprising: Determining an ant colony according to a target rule, wherein the ant colony represents a search process for a data transmission path, and the target rule is used to dynamically update the selection of the data transmission path according to pheromones and path distance; updating the pheromone according to the shared traffic rate at the target time and the length of the path that the ant colony has passed; According to the updated pheromone, a target transmission path is determined from a plurality of data transmission paths between the first server and the second server.

6. The method for processing transaction data of financial products according to claim 5, characterized in that: Before updating the pheromone according to the shared traffic rate at the target time and the length of the path that the ant colony has passed, the method further includes: detecting a capacity of the data link, wherein the capacity represents a maximum transmission rate of the data link; detecting an average utilization rate of the transaction request entering the data link, wherein the average utilization rate represents a ratio of a total bandwidth to the capacity when the transaction request enters the data link; detecting an average round trip time of the transaction request traversing the data link; Detecting an 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; A shared traffic rate of the data link at the target time is determined according to the capacity, the average utilization, the average round trip time, and the average queue size.

7. The method for processing transaction data of financial products according to claim 5, characterized in that: Determining a target transmission path from a plurality of data transmission paths between the first server and the second server according to the updated pheromone includes: Detecting the data size of the transaction request; determining a time range for the transaction request to arrive at the second server; Detecting a load parameter, wherein the load parameter represents a load condition of the data link when the ant colony passes through the first server at the target time; Detecting a time parameter, wherein the time parameter represents the degree of matching between the time when the transaction request arrives at the second server according to the path selected by the ant colony and the time range when the ant colony passes the first server at the target time; determining a path distance function according to the data size of the transaction request, the time range of the transaction request arriving at the second server, the load parameter, and the time parameter; A target transmission path is determined from a plurality of data transmission paths between the first server and the second server according to the path distance function and the updated pheromone.

8. A transaction data processing device for financial products, characterized in that: include: A receiving unit receives, through a first server of a sales institution of a target financial product, a transaction parameter sent by a second server of an issuing institution of the target financial product, wherein the transaction parameter is used to characterize a restriction condition for purchasing the target financial product, and the target financial product is a financial product designated to be sold within a preset time period; an uploading unit, which obtains, through the first server, a transaction request uploaded by a user terminal device and meeting the transaction parameters; a determining unit, which determines, through the first server, a target transmission path from a plurality of data transmission paths between the first server and the second server according to a shared flow rate of a data link between the first server and the second server; A sending unit is configured to send the transaction request to the second server through the first server based on the target transmission path.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored executable program, wherein when the executable program is executed, the device where the computer-readable storage medium is located is controlled to execute the transaction data processing method for financial products according to any one of claims 1 to 7.

10. An electronic device, characterized in that: include: A memory storing an executable program; A processor is used to run the program, wherein the program, when running, executes the transaction data processing method of a financial product as described in any one of claims 1 to 7.

11. A computer program product comprising computer instructions, characterized in that: When the computer instructions are executed by the processor, the steps of the transaction data processing method of the financial product described in any one of claims 1 to 7 are implemented.

Images