Digitized Internet-based financial marketing management method and system

Abstract

The invention relates to the technical field of financial management, in particular to a digital one-network financial marketing management method and system, and the method comprises the following steps: obtaining a node data comparison time delay queuing arrangement task sequence, reading a dependency chain comparison time length, analyzing, splitting and extracting a link, extracting a spare capacity comparison remaining time weight distribution task, and obtaining a task sequence; and according to a business currency time limit matching region distribution sequence, reading branch comparison delay insertion positions to obtain an execution scheme. According to the method, the processing time delay, the queuing number and the capacity of the transaction nodes are compared in real time, the task entering sequence and the node positions are optimized, and the reorganization of the detachable tasks is completed under the condition that the dependency sequence is kept in combination with dependency chain comparison and link information extraction; the resource utilization rate is improved through matching of standby channel capacity, task remaining time and dependency weights, the priority is adjusted in a cross-region mode according to service types, currency types and time limits, and confluence nodes shorten the overall waiting time according to delay optimization branch insertion.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of financial management, in particular to a digital one-network financial marketing management method and system. BACKGROUND

[0002] The technical field of financial management involves the organization, coordination and implementation of core matters such as fund flow, asset allocation, risk control, income analysis, market transaction and customer relationship, covering information collection, processing and decision execution processes in banking business, securities investment, insurance operation, tax processing and other financial service systems, aiming to realize efficient allocation and operation of financial resources through institutionalization, proceduralization and toolization means. Among them, the traditional digital one-network financial marketing management method refers to the centralized management and business processing of marketing activities of multiple financial products and services on a unified digital platform. This kind of method usually relies on centralized database to realize the integration of multi-channel business information, uses preset business logic rules for customer classification and business matching, and completes the execution and tracking of marketing tasks through batch automatic pushing and interactive recording.

[0003] The prior art lacks continuous monitoring of node running state and dynamic changes of task queue in multi-link task processing, resulting in deviation of task allocation sequence and actual processing capacity, difficulty in reorganization of dependent tasks on the chain, often idle available capacity of standby processing channels, difficulty in simultaneously considering business urgency and time limit for cross-regional task sorting, and uneven branch arrival rhythm in confluence nodes causing cumulative delay, resulting in insufficient resource utilization and prolonged overall task response time. SUMMARY

[0004] In order to solve the technical problems existing in the prior art, the embodiments of the present application provide a digital one-network financial marketing management method, comprising the following steps: In order to achieve the above-mentioned purpose, the present application adopts the following technical scheme: a digital one-network financial marketing management method, comprising the following steps: S1: acquiring transaction node processing delay, queuing quantity and capacity data in the unified marketing scheduling platform, comparing waiting time and processing delay, arranging task entering sequence and node position, and obtaining node task execution sequence; S2: based on the node task execution sequence, reading task dependency chain data, comparing task execution time and identification sequence order, analyzing splittable positions, extracting link information, and obtaining split task chain list; S3: based on the split task chain list, extracting standby channel capacity in the transaction clearing channel, comparing task remaining execution time and dependency weight, and selecting pushable tasks in capacity order to be distributed to target channels to obtain standby channel pushing list; S4: based on the backup channel push list, according to the task business type, the currency type and the compliance time limit, the currency type and the time limit are associated to the business type, the supervision priority table matching area is matched, the processing order is distributed, and the cross-regional priority processing list is obtained; S5: based on the cross-regional priority processing list, the number of branch of confluence node is read, the branch list and the delay cumulative value are compared, the unarrived branch is screened and the insertion position is supplemented according to the delay value, and the confluence node execution path scheme is obtained.

[0005] As a further scheme of the application, the node task execution sequence includes task entry order, task node position, task waiting time length and processing time delay comparison result, the split task chain list includes splittable task position, task dependency link information and sequence order comparison result, the backup channel push list includes task remaining execution time sorting result, available backup channel capacity distribution result and push task list, the cross-regional priority processing list includes business type associated currency type, currency type corresponding compliance time limit and region supervision priority, and the confluence node execution path scheme includes unarrived branch list, delay cumulative value corresponding insertion position and necessary branch comparison result.

[0006] As a further scheme of the application, the task dependency chain data refers to reading the execution time length and task identification of each task based on the node task execution sequence, comparing in order sequence, extracting the preposition between tasks, and arranging the dependency relationship in the original order. The dependency weight refers to reading the weight value of the task in the dependency chain when the backup channel capacity information and the task remaining execution time are compared. The weight value is derived from the original data record of the task dependency relationship, and can be used as a task scheduling attribute to determine the priority in the subsequent steps in combination with the backup channel capacity and the remaining execution time.

[0007] As a further scheme of the application, the supervision priority table refers to matching the region code in the supervision priority table with the business type after establishing the business type compliance association table, merging the matched region information to the task record, and grouping and sorting according to the region. The branch list refers to reading the necessary branch identification sequence of the confluence node after establishing the cross-regional priority processing list, comparing the completed branch with the necessary branch, screening the unarrived branch, and inserting the position according to the delay cumulative value.

[0008] As a further scheme of the application, the specific steps of S1 are: S101: obtain the real-time processing time delay, current task queue number and node capacity data of the transaction node in the unified marketing scheduling platform, divide the data according to the node identification, correspond the processing time delay and task queue number in the partition to the node capacity, and obtain the node partition performance information. S102: based on the node partition performance information, according to the number of queued tasks corresponding to each node and the node capacity, and in contrast with the processing time delay of the node, the contrast result is distributed in order of waiting time length to obtain a node waiting time length sequence; S103: based on the node waiting time length sequence, each task is matched to the corresponding node position in the order of entering, and the node position in the sequence is connected to obtain a node task execution sequence.

[0009] As a further scheme of the application, the specific steps of S2 are: S201: based on the node task execution sequence, read the task execution dependency chain data, compare the task execution time and the task identifier in order, verify the position of each task in the sequence, and obtain task order corresponding information; S202: based on the task order corresponding information, filter the task position that can be split in the order, calculate the task position node occupancy rate, and list the task position in the list to obtain a list of splittable task positions; S203: based on the splittable task position list, extract the link information consistent with the list position in the task execution dependency chain data, and splice according to the relationship between tasks in the order to obtain a split task chain list.

[0010] As a further scheme of the application, the specific steps of S3 are: S301: based on the split task chain list, extract the available capacity of the standby channel buffer area in the financial transaction clearing channel, divide the capacity data according to the channel identifier, and correspond the capacity and task position to obtain standby channel capacity information; S302: based on the standby channel capacity information, compare the remaining execution time of each task with the task dependency weight, calculate the task dependency weight occupancy ratio, and list the order according to the remaining execution time to obtain a task execution order table; S303: based on the task execution order table, select the tasks that can be pushed to the standby channel in turn, assign the tasks to the corresponding target channel, and obtain a standby channel push list.

[0011] As a further scheme of the application, the specific steps of S4 are: S401: based on the standby channel push list, read the transaction task business type, transaction currency type and compliance time limit, correspond the transaction currency type and compliance time limit according to the business type, and associate the relationship according to the task identifier to obtain a business type compliance association table; S402: based on the business type compliance association table, match the business type to the corresponding region in the regulatory priority table, combine the region code matched to the original associated information to obtain a region matching result table; S403: Based on the region matching result table, arrange the task processing order according to the compliance time limit, and assign the task to the corresponding region to obtain a cross-region priority processing list.

[0012] As a further scheme of the application, the specific steps of S5 are: S501: Based on the cross-region priority processing list, read the completed branch quantity parameter of the confluence node, correspond the quantity to the confluence node required branch list parameter, identify the branch arrival state, and obtain a branch arrival state table; S502: Based on the branch arrival state table, compare the non-arrival branch with the delay cumulative value parameter, and distribute the branch according to the delay cumulative value in the position of the list to obtain a non-arrival branch delay position table; S503: Based on the non-arrival branch delay position table, insert the branch into the corresponding position in the confluence node required branch list parameter, and splice into an executable node path to obtain a confluence node execution path scheme.

[0013] The digital one-network financial marketing management system comprises: The transaction node monitoring module obtains the real-time processing delay, task queuing quantity and processing capacity of the transaction node in the unified marketing scheduling platform, compares the waiting time and processing delay according to the queuing quantity and processing capacity grouped by the node, and distributes the task entering order and the node position according to the comparison result to obtain a node task execution sequence; The task link decomposition module reads the task dependency chain data and execution time based on the node task execution sequence, compares the execution time and order, identifies the separable task position, and extracts the corresponding link to obtain a split task chain list; The standby channel allocation module extracts the standby channel capacity of the financial transaction clearing channel based on the split task chain list, compares the task remaining execution time and dependency weight, and selects the pushable task according to the capacity to be distributed to the target channel in turn to obtain a standby channel push list; The cross-region priority processing module associates the currency type and time limit to the business type according to the transaction task business type, currency type and compliance time limit, matches the region according to the supervision priority table, and distributes the processing order to obtain a cross-region priority processing list; The confluence path planning module calls the completed branch quantity, required branch list and delay cumulative value of the confluence node based on the cross-region priority processing list, compares the branch list and delay cumulative value, filters the non-arrival branch and inserts the position according to the delay value to obtain a confluence node execution path scheme.

[0014] Compared with the prior art, the application has the advantages and positive effects that: In the application, by comparing the processing delay, queuing number and capacity of the transaction node in real time, the task entering order and node position are optimized, the dependency chain comparison and link information extraction are combined, the split task is reorganized while maintaining the dependency order, the resource utilization is improved by matching the standby channel capacity, task remaining time and dependency weight, the priority is adjusted according to the business type, currency type and time limit across regions, and the overall waiting time is shortened by inserting the delay optimization branch according to the flow node. BRIEF DESCRIPTION OF DRAWINGS

[0015] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0016] Figure 1 The step flowchart of the present application is shown in the figure. Figure 2 The S1 refinement diagram of the present application is shown in the figure. Figure 3 The S2 refinement diagram of the present application is shown in the figure. Figure 4 The S3 refinement diagram of the present application is shown in the figure. Figure 5 The S4 refinement diagram of the present application is shown in the figure. Figure 6 The S5 refinement diagram of the present application is shown in the figure. Figure 7 The system module diagram of the present application is shown in the figure. DETAILED DESCRIPTION

[0017] The technical solutions in the present application will be described below in conjunction with the drawings.

[0018] In the embodiments of the present application, the words such as "example", "for example" are used to represent as an example, illustration or description. Any embodiment or design scheme described as "example" in the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the word "example" is intended to present the concept in a specific way. In addition, in the embodiments of the present application, the meaning expressed by "and / or" can be both, or can be one of the two.

[0019] In the embodiments of the present application, "image" and "picture" can be used interchangeably, and it should be pointed out that the meanings expressed are consistent when the distinction is not emphasized.

[0020] In the embodiments of the present application, sometimes the subscript such as W1 can be written in the form of non-subscript such as W1, and the meanings expressed are consistent when the distinction is not emphasized.

[0021] In order to make the technical problems, technical solutions and advantages to be solved by the present application more clear, the following will be described in detail in conjunction with the drawings and specific embodiments.

[0022] Please refer to Figure 1 The embodiment of the present application provides a digital one-network financial marketing management method, comprising the following steps: S1: Obtain the real-time processing delay of the transaction node in the unified marketing scheduling platform, the current task queuing quantity of the node and the node capacity data, compare the waiting time and the processing delay by grouping according to the node identifier, arrange the entering order and the node position of each to-be-processed task according to the comparison result, and obtain the node task execution sequence; S2: Based on the node task execution sequence, read the task execution dependency chain data, compare the task execution time and the task identifier in sequence with the sequence order, analyze the position of the splittable task, and extract the corresponding link information to obtain the split task chain list; S3: Based on the split task chain list, extract the available capacity of the standby channel buffer in the financial transaction clearing channel, compare the task remaining execution time and the task dependency weight, arrange the tasks from short to long according to the task remaining execution time, select the pushable tasks according to the standby capacity in turn, and distribute them to the target channel to obtain the standby channel push list; S4: Based on the standby channel push list, according to the transaction task business type, transaction currency type and compliance time limit, associate the transaction currency type and compliance time limit to the corresponding business type one by one, match to the corresponding area in the regulatory priority table, and distribute the processing order of the tasks according to the compliance time limit to obtain the cross-regional priority processing list; S5: Based on the cross-regional priority processing list, read the completed branch quantity parameter of the merging node, compare the merging node required branch list parameter and the delay cumulative value parameter one by one, filter the branches that have not arrived, and insert the position according to the delay cumulative value parameter to obtain the merging node execution path scheme.

[0023] The node task execution sequence includes task entry sequence, node position where the task belongs, task waiting time length and processing time delay comparison result, the split task chain list includes splittable task position, task dependency link information and sequence order comparison result, the backup channel pushing list includes task remaining execution time sorting result, available backup channel capacity allocation result and pushed task list, the cross-region priority processing list includes business type associated currency type, currency type corresponding compliance time limit and region supervision priority, and the confluence node execution path scheme includes non-arrival branch list, delay cumulative value corresponding insertion position and necessary branch comparison result.

[0024] Referring to Figure 2 The specific steps of S1 are as follows: S101: Obtain real-time processing time delay, current task queue number and node capacity data of a transaction node in a unified marketing scheduling platform, divide the data according to node partitioning according to node identification, and correspond the processing time delay and task queue number in the partition to the node capacity to obtain node partition performance information; Firstly, the processing start time and end time data of each node are called, the difference between the end time and the start time is converted into a millisecond-level delay, and the delay is recorded as a processing time delay value. For example, the start time of node A processing a task is 08:00:00, and the end time is 08:00:05, and the processing time delay is 5000 milliseconds. The current task queue number needs to be read from the node's queue length field, and the length value is directly regarded as the task queue number. For example, the queue length of node A at a certain time is 12, and the task queue number is recorded as 12. The node capacity data needs to be read from the node's maximum concurrent processing capacity field. If node A can process 15 tasks at the same time, the node capacity is 15. After completing the collection of the three types of data, all the data are partitioned according to the node identification, that is, the data of the same node identification are collected into the same interval. For example, the processing time delay, queue number and capacity of node A are all included in the partition of node A. Then, the processing time delay and task queue number are corresponded to the node capacity in the partition. The specific operation is to establish a one-to-one matching relationship in the same partition, and to compare the processing time delay and task queue number of a node with the node capacity value at the same time. For example, the processing time delay of node A is 5000 milliseconds, the task queue number is 12, and the capacity is 15. Therefore, the task number to capacity ratio is 12 / 15, and the processing time delay corresponds to the capacity of 15 units. The same processing is performed on all nodes to establish a corresponding relationship between the processing time delay and the task queue number according to the capacity. Finally, the node partition performance information is obtained.

[0025] S102: Based on the node partition performance information, according to the number of queued tasks corresponding to each node and the node capacity, and in comparison with the processing delay of the node, the comparison result is distributed in order of waiting time length to obtain a node waiting time length sequence; First, the two data items of task queue number and node capacity are extracted node by node. When corresponding the task queue number and the capacity, the total number of tasks currently queued in the node and the maximum number of tasks that can be processed simultaneously by the node need to be read. For example, node B currently has 20 tasks queued, and the maximum processing capacity is 25. Therefore, the ratio of the number of tasks to the capacity of the node at the corresponding time is 20 to 25. Then, this ratio is compared with the processing delay of the node. The processing delay is obtained based on the existing delay data in the node partition performance information. For example, the average processing delay of node B is 7500 milliseconds. Therefore, in the comparison, the corresponding relationship of "20 to 25 to 7500 milliseconds" for the node can be directly formed. After all nodes are processed, a corresponding set of the ratios of multiple nodes and processing delays is formed. Then, these sets are distributed according to the waiting time length, that is, the processing delay values are placed in the sequence from shortest to longest, while the node task ratio information corresponding to the delay is retained. For example, the ratio of node C is 10 to 15, and the processing delay is 4000 milliseconds. The ratio of node D is 18 to 20, and the processing delay is 9000 milliseconds. In the distribution process, node C is placed before node B, and node B is placed before node D. This distribution process determines the positions of all nodes according to their corresponding waiting time length in order, and includes the task ratio in the sorting result. Finally, the node waiting time length sequence is obtained.

[0026] S103: Based on the node waiting time length sequence, each task is matched to the corresponding node position according to the order of entry, and the execution process is connected according to the position of the node in the sequence to obtain a node task execution sequence. First, read the entry order number in the task record one by one, which is used to indicate the arrival order of the task, for example, the number of task T01 is 1, the number of T02 is 2, and the number of T03 is 3, which shows that T01 is earlier than T02 and T03 into the processing link, then match the task number with the corresponding node identifier in the node waiting time sequence, and check the node ownership of each task in the matching process, ensure that task T01 is assigned to node N1, task T02 is assigned to node N3, and task T03 is assigned to node N2, and the corresponding relationship is accurate, then according to the position sequence of the node in the waiting time sequence, the matched task information is connected to form an execution link, for example, the time of node N2 in the waiting time sequence is 4500 milliseconds, the time of node N1 is 6000 milliseconds, and the time of node N3 is 8000 milliseconds, then in the execution link, the task at the position of node N2 will be processed before the task at the position of node N1 and node N3, then fill in the task according to the link structure, for example, T03 falls into N2, T01 falls into N1, and T02 falls into N3, forming the task sequence connected in turn according to the node position, if there are multiple tasks under the same node in the process, continue to connect according to the entry order at the node position, for example, if the number of task T01 is less than the number of task T05 under node N1, then T01 is in front of T05, through this connection process, the entering order of the task and the processing order of the node are completely integrated, and finally the node task execution sequence is obtained.

[0027] Please refer to Figure 3 , the specific steps of S2 are: S201: Based on the node task execution sequence, read the task execution dependency chain data, compare the task execution time and the task identifier in order, verify the position of each task in the sequence, and obtain the task order corresponding information; First, read the task execution dependency chain data one by one, extract the execution time of each task in the dependency chain and the task identification corresponding to the task identification, for example, the execution time of task T11 is 6200 milliseconds, the task identification is T11, the execution time of task T15 is 4800 milliseconds, the task identification is T15, arrange these task data in order, and compare them with the corresponding task order in the node task execution sequence. The comparison process needs to check the position of each task in the execution sequence whether it is consistent with the order recorded in the dependency chain. If task T15 is located after T11 in the dependency chain, it must also be located after T11 in the execution sequence. If the difference is found, it will be directly marked during comparison. Continue to compare the next task. The whole process needs to be repeated until all tasks are compared. During this period, for multiple tasks under the same node, it is also necessary to compare whether the relative positions of T21 and T23 in the execution sequence are consistent with the order recorded in the dependency chain. For example, T21 is prior to T23 in the dependency chain, then T21 must be prior to T23 in the execution sequence. This position comparison is not only performed between different nodes, but also performed within the same node. In this way, the time and identification information of the dependency chain data are fully checked into the order information of the node task execution sequence, and finally the task order corresponding information is obtained.

[0028] S202: Based on the task order corresponding information, filter the task position that can be split in the order, calculate the task position node occupancy rate, and list the task position to obtain a list of splittable task positions. The calculation formula of the task position node occupancy rate is as follows: ; Among them, represents the task position node occupancy rate at time t, represents the number of tasks allocated to the i th task position at time t, represents the maximum number of tasks that can be accommodated by the i th task position node, represents the number of tasks completed by the i th task position node at time t, represents the critical weight coefficient of the i th task position node, and n represents the total number of task position nodes. The operation logic of the formula: first, get the difference between the number of allocated tasks and the maximum capacity of the node in each node range, and take the absolute value to exclude the influence of positive and negative directions, divide the difference by the maximum capacity of the node to get the relative proportion, then multiply the proportion by the weight value of the corresponding node to reflect the importance of the node in the whole, and add the weighted proportion results of all nodes to get the global capacity difference weighted sum; then get the difference between the number of allocated tasks and the number of completed tasks in each node range, divide the difference by the maximum capacity of the node to get the proportion of unfinished tasks to capacity, square the proportion to amplify the influence of larger deviations, and sum all the square results of the nodes to get the global task progress difference sum, then square root of the sum to adjust the dimension back to the same level as the proportion; then add the square root results of the capacity difference weighted sum and the task progress difference square sum to get the comprehensive occupation value, and normalize the comprehensive value by the sum of the weight values of all nodes, so as to get the task position node occupancy rate for measuring the overall task allocation and progress state; After monitoring and retrieving the scheduling task data: Node 1: maximum capacity =120 tasks, allocated =100 tasks, completed =90 tasks, weight =0.8; Node 2: maximum capacity =150 tasks, allocated =130 tasks, completed =110 tasks, weight =0.6; Node 3: maximum capacity =100 tasks, allocated =95 tasks, completed =85 tasks, weight =0.9; The node capacity is measured by stress test, the number of allocations and the number of completions are directly counted from the scheduling log, and the weight is quantified and normalized to the 0-1 interval by the impact percentage grading; Substitute the calculation process: Calculate the absolute difference proportion weighted item: Node 1: ; Node 2: ; Node 3: ; Weighted sum = 0.10664 + 0.07998 + 0.045 = 0.23162; Calculate the standard deviation item of the difference between allocation and completion: Node 1: (100-90) / 120=0.08333, square=0.00694; Node 2: (130-110) / 150=0.13333, square=0.01778; Node 3: (95-85) / 100=0.1, square=0.01; Square sum=0.00694+0.01778+0.01=0.03472, square root=0.18626; Calculate the denominator weight sum: ; Substitute the formula: ; Result interpretation and numerical significance: the task position node occupancy rate is 0.18169, which shows that the current task position node has low occupancy proportion under the maximum task capacity, which means that tasks can be added to the "splittable task position list"; Innovative points of the formula: The beneficial aspects of the formula are that by combining the weighted difference proportion of task capacity with the dispersion term of task completion and allocation difference, the capacity deviation and progress balance can be reflected in the calculation of occupancy rate at the same time, and the influence of differentiated node size difference is eliminated through weight normalization, so that the calculation result is used for global scheduling evaluation.

[0029] S203: Based on the splittable task position list, extract link information consistent with the list position in the task execution dependency chain data, and connect according to the front and back relationship of the task in the order, to obtain a split task chain list; First, read the task identification information corresponding to each position in the list, for example, position 1 corresponds to task T08, position 2 corresponds to task T12, and position 3 corresponds to task T19, then enter the task execution dependency chain data one by one to retrieve, compare the task identification in the dependency chain with the task identification in the list, if the task identification recorded in the dependency chain is completely consistent with the identification in the list, extract the complete link information of the task, the link information needs to include the pre-task identification, subsequent task identification and associated dependency relationship parameters of the task, for example, task T08 is located after T05 and before T10 in the dependency chain, then the associated field and order information of T05 and T10 are obtained at the same time, after completing the link information extraction of all matched tasks, the link information is connected according to the front and back relationship of the tasks in the original execution order, and the dependency relationship between the tasks needs to be maintained during the connection, for example, T08 is originally located between T05 and T10 in the order, so it still needs to be located between T05 and T10 during the chain connection, if multiple tasks come from the same node, then they are connected in the original entering order in the node position, for example, task T12 is earlier than task T19 in node N7, so T12 is placed before T19 in the chain, after the link information of all tasks is connected, a continuous path containing all the links of the splittable tasks is formed, and finally the split task chain list is obtained.

[0030] Please refer to Figure 4 , the specific steps of S3 are: S301: Based on the split task chain list, extract the available capacity of the standby channel buffer area in the financial transaction clearing channel, divide the capacity data according to the channel identifier, and correspond the capacity to the task position to obtain the standby channel capacity information; First, read the identification information and its location channel number of each task in the chain in turn, take the financial transaction clearing channel where the task is located as the positioning basis, enter the standby channel buffer of the corresponding channel to read the available capacity data, the available capacity needs to be directly obtained by calling the remaining task carrying number field of the buffer, for example, the buffer remaining carrying task number of standby channel C1 is 120, and that of standby channel C2 is 85, correspond the obtained available capacity values of all standby channels with the channel identifiers one by one to form a paired data set of capacity and channel identifier, then partition the paired data according to the channel identifier, that is, the capacity data with the same identifier are concentrated in the same section, for example, all capacity records under channel C1 are grouped into the same section, and channel C2 is processed in the same way, after partitioning, the partitioned capacity data needs to be matched with the position of the corresponding task in the split task chain list, find the capacity value in the channel partition to which each task belongs, for example, task T52 in the chain belongs to channel C1, then correspond the capacity value in the C1 partition to T52 and record it in the matching result, if there are multiple tasks under the same channel in the chain, respectively assign the current available capacity data of the channel to the corresponding task until all tasks in the chain have established a corresponding relationship with the capacity information, in this way, each task not only retains its position in the chain, but also has associated information of the available capacity, and finally the standby channel capacity information is obtained.

[0031] S302: Based on the standby channel capacity information, the remaining execution time of each task is matched with the task dependency weight to calculate the task dependency weight occupation ratio, and the order is listed according to the remaining execution time to obtain a task execution order table. The calculation formula of the task dependency weight occupation ratio is as follows: ; Wherein, represents the task dependency weight occupation ratio value of the vth task, represents the task dependency weight of the vth task, represents the arithmetic mean of the current task dependency weight, represents the remaining execution time of the vth task, represents the arithmetic mean of the current task remaining execution time, and u represents the total number of current tasks to be executed, represents the task dependency weight of the jth task. Formula operation logic: the dimensionless difference value between the current task dependency weight and the average value of all task dependency weights is obtained by subtraction operation and absolute value is taken to remove directionality and keep the difference value as non-negative number, then the ratio of the current task remaining execution time and the average value of all task remaining execution time is calculated and square root operation is performed to form a dimensionless scaling factor of time scale, the multiplication combination of the above difference value and time scaling factor is performed, then multiplied by the standby channel capacity normalization coefficient to introduce the influence of current available channel capacity, finally divided by the average value of all task dependency weights for normalization, so that the result is kept in a comparable dimensionless interval, thereby obtaining the task dependency weight occupation proportion value which can be directly used for task priority sorting; : monitor link rated bandwidth ; monitor average utilization in window , calculate ; with : calculate , batch average ; example data: , ; get , T=2.5h; : number of downstream tasks ; shift reference , task slack amount ; calculate slack gap ; resource blocking ratio ; maximum value: , , ; normalized to get ; ; ; sum to get , interval scaling (minimum value 1.1587, maximum value 3.0000) to get ; : calculate to get ; substitute into formula calculation process (denominator average , ): v=1: , ; v=2: , ; v=3: , ; v=4: , ; Shift reference comes from enterprise work system; The result shows: , task 3 and task 2 have higher dependency weight proportion in this batch, as the sorting weight, and the remaining execution time jointly determine the task execution order table; The formula innovation point shows: The benefit of the formula is that, through the same dimension synthesis of the dependency deviation term , the square root term of time ratio , and the normalized coefficient of standby channel capacity , the influence of dependency intensity discreteness, relative remaining time scale, and available link capacity proportion on scheduling priority can be comprehensively reflected on the same numerical scale, and the obtained value can directly drive task sorting.

[0032] S303: Based on the task execution order table, sequentially select the tasks that can be pushed to the standby channel, and assign the tasks to the corresponding target channel to obtain a standby channel pushing list; First, read the task records in turn from the first position of the order table, each task record contains task identification, node information and current pushable state marker, tasks with pushable state marker "Yes" need to enter the standby channel allocation link, for example, the pushable state of task T07 in the order table is "Yes", then T07 is treated as a task to be allocated, read its node number, and find the standby channel identifier corresponding to the node number in the standby channel capacity information, find the available channel, then establish a corresponding relationship between task T07 and the channel and generate an allocation record, continue to read the next task in the order table, such as T12, which is also in the pushable state and belongs to the same standby channel, then append the allocation record of the task in the channel, if the pushable state of the task is "No", skip the task and continue to read the order, do not participate in allocation, until all tasks in the order table are checked, in the process of processing, if the available capacity of the standby channel is less than the number of tasks to be allocated, only the number of tasks within the capacity limit range in the order table are allocated, for example, the remaining capacity of standby channel C5 is 3 tasks, and the tasks in the order table that meet the conditions are T15, T16, T19, T20, then only T15, T16, T19 are allocated to C5, and T20 is reserved in the order table waiting for the next round of allocation, through this one-by-one matching and allocation operation, all pushable tasks in the order table are allocated to the corresponding standby channel, and finally the standby channel push list is obtained.

[0033] Please refer to Figure 5 The specific steps of S4 are: S401: Based on the standby channel push list, read the transaction task business type, transaction currency type and compliance time limit, correspond the transaction currency type and compliance time limit according to the business type, and associate the relationship according to the task identification, to obtain a business type compliance association table; First, read the task identification of each transaction task in the list in turn, and call the corresponding business type field, transaction currency type field and compliance time limit field from the transaction task information library, for example, the business type of task T21 is B1, the transaction currency type is USD, and the compliance time limit is 48 hours. When the transaction currency type and the compliance time limit are matched according to the business type, all tasks of the same business type need to be classified and processed, and the currency type and the compliance time limit under it are paired to form a record, for example, the tasks under B1 type may have USD-48 hours, EUR-72 hours and other groups of data. These paired records will be concatenated with the task identification in the subsequent operation, and the concatenation process is to form a one-to-one mapping relationship between each paired record and its corresponding task identification, for example, USD-48 hours corresponds to T21, and EUR-72 hours corresponds to T26. In this way, each task identification and its business type, currency type and compliance time limit form a complete data combination. If there are multiple tasks with the same business type and currency type but different compliance time limits in the processing process, they will be distinguished according to the value of the compliance time limit, and all different pairing results will be retained in the mapping, such as JPY-24 hours and JPY-36 hours under B2 type will be bound with T32 and T35 respectively. The whole process will repeat the operation of corresponding and concatenating the currency type and the compliance time limit of business type for all tasks in the backup channel push list until all task identifications complete the operation, and finally obtain the business type compliance association table.

[0034] S402: Based on the business type compliance association table, match the region in the regulatory priority table according to the business type, merge the region code matched with the original associated information, and obtain a region matching result table; First, read the business type field of each record in the table, which is used to identify the business category to which the transaction task belongs, for example, the business type of task T31 is B3, and the business type of task T42 is B7, then enter the supervision priority table to find the same record as the business type one by one, and the complete consistency of the business type code needs to be compared in the search process to ensure that there will be no matching error due to partial character similarity, for example, B3 can only match B3, not B30 or B13, when the matching is successful, read the area code corresponding to the business type in the supervision priority table, for example, the area code matched by B3 is R2, and the area code matched by B7 is R5, add this area code to the record of the original business type compliance association table corresponding to the task, and keep the original transaction currency type and compliance time limit information in the record unchanged, for example, the original record of task T31 is B3, USD-48 hours, and after merging, it is updated to B3, USD-48 hours, R2, the original record of task T42 is B7, JPY-72 hours, and after merging, it is updated to B7, JPY-72 hours, R5, after adding the area code to all tasks, it is necessary to check again whether there is the same business type in multiple areas, if such a situation exists, then keep each area information as an independent record in the result table, without merging, for example, when B4 matches in R1 and R3, the corresponding task record will be divided into two records to keep the area R1 and the area R3, after adding the area code to all task records, a complete data set with business type, transaction currency type, compliance time limit and area code is formed, and finally the area matching result table is obtained.

[0035] S403: Based on the area matching result table, arrange the task processing order according to the compliance time limit, and assign the task to the corresponding area to obtain a cross-area priority processing list; First, the compliance time limit value and the regional code of each task record in the table are extracted, and the compliance time limit value is read directly in the task record, for example, the compliance time limit of task T51 is 36 hours, and the regional code is R3, the compliance time limit of task T57 is 72 hours, and the regional code is R2, all tasks are grouped according to the regional code, and sorted according to the length of the compliance time limit value in each regional group, the task with shorter time limit value is in front, and the task with longer time limit value is in back, for example, in the region R3, T51 (36 hours) should be arranged before T64 (60 hours), after completing the sorting in each regional group, the sorting result is taken as the task processing order table of the region, and the original business type, transaction currency type and other associated information are retained, then according to the order table of each region, the tasks are sequentially distributed to the task execution list of the corresponding region, and the distribution needs to ensure that a task only enters the list of its own region and does not cross with other regions, for example, T51 can only enter the execution list of R3, and will not be put into the list of R2 or R5, for multiple tasks with the same compliance time limit, for example, T57 and T60 in R2 have the same compliance time limit of 72 hours, then arrange the position according to their appearance order in the original regional matching result table, this distribution process will be executed in all regions in turn until all tasks are sorted and distributed, and finally the cross-regional priority processing list is obtained.

[0036] Please refer to Figure 6 , the specific steps of S5 are: S501: Based on the cross-regional priority processing list, read the completed branch quantity parameter of the confluence node, correspond the quantity with the confluence node required branch list parameter, identify the branch arrival state, and obtain the branch arrival state table; First, read the task records in the list involving the confluence node one by one, determine the confluence node number to which these tasks belong, for example, tasks T72 and T75 belong to confluence node M4, then read the number of completed branches parameter of the node in the node state data set, which is an integer value, indicating the number of branches that have successfully arrived at the node, for example, the number of completed branches of M4 is 3, compare this number with the required branch list parameter of the same node, which contains all the branch identifiers required by the node to complete the confluence, for example, the required branch list of M4 is [P1, P2, P3, P4, P5], during the comparison, the identifiers of the completed branches and the identifiers in the required branch list are compared one by one, if they match, the branch is determined to be in the arrived state, if they do not match, it is determined to be in the unarrived state, for example, the completed branch identifiers are [P1, P3, P4], then P1, P3, P4 are identified as arrived, P2, P5 as unarrived, during the identification process, the state of each branch needs to be recorded separately and the node number to which it belongs needs to be recorded, so as to keep the correspondence with the node consistent in the subsequent link, when all the required branches and the completed branch number parameter complete the comparison check, a complete branch state list can be formed, which clearly marks which branches have arrived and which branches have not arrived, and finally a branch arrival state table is obtained.

[0037] S502: Based on the branch arrival state table, compare the unarrived branches with the delay cumulative value parameter, distribute the branches in the list according to the delay cumulative value, and obtain an unarrived branch delay position table; First, the branch records in the state of not arrived are screened, and the branch identifiers and the numbers of the corresponding merging nodes, such as the not arrived branches P2 and P5 of the node M4 and the not arrived branches P8 and P9 of the node M6, are reserved. Then, the delay cumulative value parameters of each not arrived branch in the delay information table are read, and the parameters are in the form of numerical values representing the cumulative delay time of the branch, such as the delay cumulative value of P2 being 2400 milliseconds, the delay cumulative value of P5 being 4800 milliseconds, the delay cumulative value of P8 being 1500 milliseconds, and the delay cumulative value of P9 being 3000 milliseconds. After the delay cumulative values are obtained, the not arrived branches under the same node are arranged in the delay position list of the node in the order of the delay cumulative values, and the branch with a shorter delay time is arranged in front and the branch with a longer delay time is arranged in back, such as P2 in front and P5 in back in the node M4, and P8 in front and P9 in back in the node M6. The delay position lists of the nodes are generated independently to ensure that the delay position distributions of the nodes do not affect each other. If the delay cumulative values are the same during the processing, the original order of the branches in the branch arrival state table is kept unchanged, so that the relative relationship of the original data can be avoided from being changed in disorder. After the not arrived branches of all the nodes are processed, the results are integrated into a unified format, and the order of each not arrived branch in the delay position list and the delay cumulative value of the not arrived branch under each node are recorded, and finally the not arrived branch delay position table is obtained.

[0038] S503: Based on the not arrived branch delay position table, the branch is inserted into the corresponding position in the branch list parameter of the merging node, and the node path is connected to obtain an executable node path scheme. First, read the branch identifier of each non-arriving branch and its order in the delay position list one by one, for example, P2 of node M4 is in the first position of the delay list, P5 is in the second position, P8 of node M6 is in the first position, P9 is in the second position, then extract the mandatory branch list parameter of the confluence node, which records all the branch positions required for the confluence node to complete execution and their fixed order, for example, the mandatory branch list of node M4 is P1, P2, P3, P4, P5 in turn, and the mandatory branch list of node M6 is P6, P7, P8, P9, P10 in turn, after the extraction is completed, the non-arriving branch is inserted into the specified position of the corresponding mandatory branch list one by one, this process needs to match the branch identifier with the mandatory branch list item one by one, after successful matching, the branch record in the delay position table is inserted at this position, while keeping the relative order of the arrived branches in the original mandatory branch unchanged, for example, in node M4, P2 should be inserted between P1 and P3, and P5 should be inserted after P4, in node M6, P8 should be inserted between P7 and P9, and P9 should be inserted after P8, after the insertion is completed, the up and down connection relationship of each branch is checked to ensure that the predecessor and successor of each branch are continuous on the logical path, for example, the successor of P1 is P2, the successor of P2 is P3, the successor of P3 is P4, and the successor of P4 is P5, finally, the branch path chain in each node range is formed which can be directly executed, and the branch chains of each node are combined in turn according to the node identifier to obtain the execution path scheme of the confluence node.

[0039] Please refer to Figure 7 , the digital one network financial marketing management system, comprising: The transaction node monitoring module obtains the real-time processing delay, task queuing quantity and processing capacity of the transaction node in the unified marketing scheduling platform, groups the queuing quantity and processing capacity according to the node, compares the waiting time and processing delay, and distributes the task entering and leaving according to the comparison result and the node position to obtain the node task execution sequence; The task link decomposition module reads the task dependency chain data and execution time based on the node task execution sequence, compares the execution time and order, identifies the separable task position, and extracts the corresponding link to obtain the split task chain list; The standby channel allocation module extracts the standby channel capacity of the financial transaction clearing channel based on the split task chain list, compares the remaining execution time of the task and the dependency weight, and selects the pushable task according to the capacity to be distributed to the target channel in turn to obtain the standby channel push list; The cross-regional priority processing module associates the currency type and time limit to the business type according to the transaction task business type, currency type and compliance time limit, matches the region of the regulatory priority table, allocates the processing order, and obtains the cross-regional priority processing list; The confluence path planning module calls the completed branch quantity of the confluence node, the essential branch list and the delay cumulative value based on the cross-region priority processing list, compares the branch list and the delay cumulative value, screens the unarrived branch and inserts the position according to the delay value, and obtains the confluence node execution path scheme.

[0040] The above merely provides a specific implementation of the present application, but the protection scope of the present application is not limited thereto, any person skilled in the art can easily think of changes or replacements within the technical range disclosed by the present application, which should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A digital, one-stop financial marketing management method, characterized in that, Includes the following steps: S1: Obtain transaction node processing latency, queue number and capacity data in the unified marketing scheduling platform, compare waiting time and processing latency, arrange task entry order and node position, and obtain node task execution sequence; S2: Based on the node task execution sequence, read the task dependency chain data, compare the task execution time with the identifier sequence order, analyze the splittable positions, extract the link information, and obtain a list of split task chains; S3: Based on the list of split task chains, extract the capacity of the backup channel in the transaction clearing channel, compare the remaining execution time of the task with the dependency weight, select the pushable tasks in order of capacity and allocate them to the target channel to obtain the backup channel push list; S4: Based on the backup channel push list, according to the task business type, currency type and compliance time limit, associate the currency type and time limit with the business type, match the regulatory priority table with the region, allocate the processing order, and obtain the cross-regional priority processing list. S5: Based on the cross-regional priority processing list, read the number of branches of the merging node, compare the branch list with the cumulative delay value, filter out the branches that have not been reached and fill in the insertion position according to the delay value to obtain the execution path scheme of the merging node; The task dependency chain data refers to reading the execution time and task identifier of each task based on the node task execution sequence, comparing them in sequence, extracting the predecessors between tasks, and arranging the dependency relationship in the original order. The dependency weight refers to the weight value of the task in the dependency chain when comparing the backup channel capacity information with the remaining execution time of the task. The weight value comes from the original data record of the task dependency relationship and can be used as a task scheduling attribute to determine priority in subsequent steps in combination with the backup channel capacity and the remaining execution time.

2. The digital one-stop financial marketing management method according to claim 1, characterized in that, The node task execution sequence includes the task entry order, the node position of the task, and the comparison result of task waiting time and processing delay. The split task chain list includes the position of splittable tasks, task dependency link information, and sequence order comparison result. The backup channel push list includes the sorting result of the remaining execution time of tasks, the allocation result of available backup channel capacity, and the list of push tasks. The cross-regional priority processing list includes the currency type associated with the business type, the compliance time limit corresponding to the currency type, and the regulatory priority of the region. The merging node execution path scheme includes the list of branches not yet reached, the insertion position corresponding to the cumulative delay value, and the comparison result of the required branches.

3. The digital one-stop financial marketing management method according to claim 1, characterized in that, The regulatory priority table refers to the process of matching the regional code in the regulatory priority table with the business type after the business type compliance association table is established, merging the matched regional information into the task record, and grouping and sorting them according to the region. The branch list refers to the process of reading the essential branch identifier sequence of the merging node after the cross-regional priority processing list is established, comparing the completed branches with the essential branches, filtering out the branches that have not been reached, and inserting them into the position according to the cumulative delay value.

4. The digital one-stop financial marketing management method according to claim 1, characterized in that, The specific steps of S1 are as follows: S101: Obtain real-time processing latency, current task queue count, and node capacity data of transaction nodes in the unified marketing scheduling platform. Partition the data by node according to the node identifier, and match the processing latency and task queue count within the partition with the node capacity to obtain node partition performance information. S102: Based on the node partition performance information, according to the number of tasks queued for each node and the node capacity, and compared with the node processing latency, the comparison results are distributed in order of waiting time to obtain the node waiting time sequence. S103: Based on the node waiting time sequence, match each task to the corresponding node position according to the order of entry, and connect the execution flow according to the position of the node in the sequence to obtain the node task execution sequence.

5. The digital one-stop financial marketing management method according to claim 1, characterized in that, The specific steps of S2 are as follows: S201: Based on the node task execution sequence, read the task execution dependency chain data, compare the task execution time with the task identifier in sequence, verify the position of each task in the sequence, and obtain the task order correspondence information; S202: Based on the task order correspondence information, filter the task positions that can be split in the order, calculate the task position node occupancy rate, and list the task positions to obtain a list of splittable task positions; S203: Based on the list of divisible task positions, extract the link information that matches the position in the list from the task execution dependency chain data, and connect them according to the sequential relationship of the tasks to obtain a list of split task chains.

6. The digital one-stop financial marketing management method according to claim 1, characterized in that, The specific steps for S3 are as follows: S301: Based on the split task chain list, extract the available capacity of the backup channel buffer in the financial transaction clearing channel, partition the capacity data according to the channel identifier, and obtain the backup channel capacity information by corresponding capacity and task position. S302: Based on the backup channel capacity information, compare the remaining execution time of each task with the task dependency weight, calculate the task dependency weight occupancy ratio, and arrange the tasks in order according to the remaining execution time to obtain the task execution order table; S303: Based on the task execution priority table, select the tasks that can be pushed to the backup channel in sequence, assign the tasks to the corresponding target channels, and obtain the backup channel push list.

7. The digital one-stop financial marketing management method according to claim 1, characterized in that, The specific steps of S4 are as follows: S401: Based on the backup channel push list, read the transaction task business type, transaction currency type and compliance time limit, match the transaction currency type and compliance time limit according to the business type, and link the association relationship according to the task identifier to obtain the business type compliance association table. S402: Based on the business type compliance association table, match the region to which the business type belongs in the regulatory priority table, merge the matched region code with the original association information, and obtain the region matching result table; S403: Based on the aforementioned regional matching result table, the task processing priority is arranged according to the compliance time limit, and the tasks are assigned to the corresponding regions to obtain a cross-regional priority processing list.

8. The digital one-stop financial marketing management method according to claim 1, characterized in that, The specific steps of S5 are as follows: S501: Based on the cross-regional priority processing list, read the number of branches completed by the merging node, match the number with the required branch list parameter of the merging node, identify the branch arrival status, and obtain the branch arrival status table. S502: Based on the branch arrival status table, compare the unreached branches with the cumulative delay value parameter, and distribute the branches according to the cumulative delay value in the list to obtain the unreached branch delay position table. S503: Based on the unreached branch delay position table, insert the branch into the corresponding position in the required branch list parameter of the merging node, and connect them into an executable node path to obtain the merging node execution path scheme.

9. A digital, all-in-one financial marketing management system, characterized in that: The system is used to implement the digital one-stop financial marketing management method according to any one of claims 1-8, the system comprising: The transaction node monitoring module obtains the real-time processing latency, task queue number and processing capacity of transaction nodes in the unified marketing scheduling platform. It groups the queue number and processing capacity by node, compares the waiting time and processing latency, and assigns the order of task entry and the position of the node according to the comparison results to obtain the node task execution sequence. The task chain decomposition module reads the task dependency chain data and execution time based on the node task execution sequence, compares the execution time with the order, identifies the separable task positions, extracts the corresponding links, and obtains a list of split task chains. Based on the list of split task chains, the backup channel allocation module extracts the backup channel capacity of the financial transaction clearing channel, compares the remaining execution time of the task with the dependency weight, and selects the pushable tasks in order of capacity to allocate them to the target channel, thus obtaining the backup channel push list. The cross-regional priority processing module pushes a list based on the backup channel, and associates the currency type and time limit with the business type according to the transaction task business type, currency type and compliance time limit, matches the regulatory priority table with the region, allocates the processing order, and obtains the cross-regional priority processing list. Based on the cross-regional priority processing list, the merging path planning module calls the number of completed branches, the list of required branches, and the cumulative delay value of the merging node. It compares the branch list with the cumulative delay value, filters out branches that have not been reached, and adds them to the positions according to the delay value to obtain the execution path scheme of the merging node.

Images