Dual-line fusion traffic unimpeded management system and method based on blockchain

Abstract

The present invention relates to the technical field of general management of telephone traffic, and in particular to a dual-line fusion telephone traffic unimpeded management system and method based on blockchain, the method comprising: obtaining the historical average communication time of each user and each operator node; obtaining the communication priority of the operator node according to the historical average communication time of each user in the communication queue of the operator node; forming a communication priority sequence according to the arrangement order of the operator sequence; constructing the local priority distance of each iteration according to the distance between each operator node and its adjacent operator node in the communication priority sequence and the difference in communication priority; improving the cuckoo algorithm according to the local priority distance to realize the allocation of the optimal operator node of the current user to be communicated. The present invention aims to improve the efficiency of telephone traffic calls, improve service quality and customer satisfaction.

Description

Technical Field

[0001] The present application relates to the technical field of general call traffic management, and specifically to a blockchain-based dual-line integrated call traffic unimpeded management system and method. Background Art

[0002] Blockchain is a distributed database technology that does not rely on a single centralized organization or server to store and manage data. It is maintained and operated by all participants in the network. Dual-line is a network configuration method that involves using two or more independent lines to provide data transmission and Internet connection services. Fusion call flow is not only to ensure that users solve product usage problems, but also covers multiple levels of optimization and service improvement to ensure that users' call applications can get a seamless, efficient and satisfactory experience. By using blockchain technology, an open and transparent communication queue of operator nodes can be established. Each operator node that answers the call can record information into the blockchain, and the transparency and credibility of the information can be ensured through the status and history of the queue. The communication queue of the operator node can automatically allocate calls through smart contracts, avoiding human intervention and time-consuming scheduling processes. At the same time, the decentralized nature of blockchain can also reduce the risk of single point failures and improve the stability and reliability of the system.

[0003] In blockchain, in order to ensure the uniqueness and integrity of data, hash functions are usually used to calculate the hash value of each block. The cuckoo algorithm is a hash table algorithm used to resolve hash conflicts. The cuckoo search algorithm is used to find the optimal solution to improve the efficiency of problem solving and user satisfaction. However, the convergence of the cuckoo search algorithm is limited by the size of the step size, and it is impossible to adjust the algorithm parameters and strategies in time according to real-time feedback information to ensure that it always maintains good convergence and effectiveness, which limits its application in converged traffic environments. Summary of the invention

[0004] In order to solve the above technical problems, the present invention provides a dual-line fusion traffic unimpeded management system and method based on blockchain, and the technical solutions adopted are as follows:

[0005] In a first aspect, an embodiment of the present invention provides a method for managing dual-line fusion traffic based on blockchain, the method comprising the following steps:

[0006] Obtain the historical average communication time of each user and each operator node; sort the operator nodes from small to large according to the work number to obtain the operator sequence, and obtain the communication queue of each operator node, wherein the communication queue is each user to be communicated;

[0007] The estimated end time of the operator node is constructed according to the historical average communication time of each user in the communication queue of the operator node and the historical average communication time of the operator node; the communication priority of the operator node is obtained according to the estimated end time and the historical average communication time of the operator node; the communication priority of each operator node is formed into a communication priority sequence according to the arrangement order of the operator sequence;

[0008] The local relative priority of each operator node is obtained according to the distance between each operator node and its neighboring operator nodes in the communication priority sequence and the difference in communication priority; the local priority distance of each iteration is constructed according to the communication priority and local relative priority of each operator node in each iteration; the step size of the original cuckoo algorithm and the local priority distance are combined to obtain the dynamically adjusted step size of each iteration;

[0009] The cuckoo algorithm is improved according to the dynamically adjusted step size of each iteration to achieve the allocation of the optimal operator node for the current user to be communicated.

[0010] Preferably, the obtaining of the historical average communication duration of each user and each operator node includes:

[0011] Obtain the historical communication time of each user through the enterprise user management system; obtain the historical communication time of each operator node through the operator node management system;

[0012] The average of all historical communication times of each user and each operator node is taken as the corresponding historical average communication time.

[0013] Preferably, the step of constructing the estimated end time of the operator node according to the historical average communication time of each user in the communication queue of the operator node and the historical average communication time of the operator node includes:

[0014] Obtain the estimated communication duration of each user in the communication queue of the operator node; calculate the sum of the estimated communication durations of all users in the communication queue of the operator node except the user currently communicating;

[0015] The difference between the communication time of the currently communicating user and the estimated communication time is used as the exponent of an exponential function with a natural constant as the base, and the sum of the sum and the calculation result of the exponential function is used as the estimated end time of the operator node.

[0016] Preferably, obtaining the estimated communication duration of each user in the communication queue of the operator node includes:

[0017] For each user in the communication queue of the operator node, when the user has a historical call application, the user's estimated communication time is set to the user's historical average communication time; when the user does not have a historical call application, the user's estimated communication time is set to the historical average communication time of the operator node.

[0018] Preferably, the obtaining of the communication priority of the operator node according to the estimated end time of the operator node and the historical average communication time includes:

[0019] Calculate the normalized value of the product of the estimated end time of the operator node and the historical average communication time, calculate the difference result of the current number of operator nodes minus 1, and round off the product of the normalized value and the difference result as the communication priority level of the operator node.

[0020] Preferably, the step of obtaining the local relative priority of each operator node according to the distance between each operator node and its adjacent operator nodes in the communication priority sequence and the difference in communication priority includes:

[0021] The m nearest operator nodes of the operator node in the communication priority sequence are recorded as each neighbor operator node;

[0022] Calculate the distance between each neighboring operator node and the operator node in the communication priority sequence respectively, and use the reciprocal of the distance as the exponent of an exponential function with a natural constant as the base;

[0023] Obtaining the mean of the communication priority levels of all neighboring operator nodes; calculating the absolute value of the difference between the communication priority level of each neighboring operator node and the mean value, and taking the sum of the products of the absolute value of the difference of all neighboring operator nodes and the calculation result of the exponential function as the first sum;

[0024] The sum of the calculation results of the exponential function of all neighboring operator nodes is used as the second sum; and the ratio of the first sum to the second sum is used as the local relative priority of the operator node.

[0025] Preferably, the step of constructing the local priority distance for each iteration according to the communication priority level and the local relative priority of each operator node at each iteration includes:

[0026] Obtaining the operator node with the minimum communication priority in the communication priority sequence, and calculating the distance between the current operator node and the operator node with the minimum communication priority in the communication priority sequence at each iteration number;

[0027] The product of the distance and the local relative limit of the operator node to which the minimum communication priority level belongs is used as the local priority distance for each iteration.

[0028] Preferably, the step size of each iteration is obtained by combining the step size of the original cuckoo algorithm and the local priority distance, comprising:

[0029] For the dynamically adjusted step size of each iteration, the inverse of the ratio of the number of iterations to the preset maximum number of iterations is calculated, and the product of the calculation result of the exponential function with the natural constant as the base and the local priority distance of each iteration is calculated;

[0030] The sum of the product and the step length of the original cuckoo algorithm is used as the dynamically adjusted step length for each iteration.

[0031] Preferably, the improved cuckoo algorithm according to the dynamically adjusted step size of each iteration includes:

[0032] The call application of the current user to be communicated and each operator node are used as the input of the cuckoo algorithm, and the step size of each iteration in the cuckoo algorithm is set to the dynamically adjusted step size under the corresponding number of iterations.

[0033] In the second aspect, an embodiment of the present invention also provides a blockchain-based dual-line converged traffic management system, including a memory, a processor, and a computer program stored in the memory and running on the processor, and the processor implements the steps of any one of the above methods when executing the computer program.

[0034] The present invention has at least the following beneficial effects:

[0035] The present invention calculates the estimated end time of the operator node through the historical records of the communication personnel in the operator queue. The method takes into account whether the user has experienced historical communication and the communication ability of the operator node, and the calculation result is more authentic; the communication priority level of the operator node is calculated by using the estimated end time of the operator node, and the allocation level of the operator node can be determined, thereby reducing the waiting time of the user's call and improving the service response speed;

[0036] The local relative priority of the operator node priority is calculated by the communication priority of the operator node, so as to explore the local fluctuation of the communication priority of adjacent operator nodes, that is, whether there is an operator node relationship that affects each other, and fully consider the spatial distribution characteristics of the operator nodes to improve the call efficiency; finally, the present invention improves the cuckoo algorithm by using the communication priority of the operator node and the local relative priority of the priority and the number of iterations to calculate the dynamic adjustment step size, which can better respond to real-time changes in call communication, improve service quality and customer satisfaction, and reduce operating costs and risks. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present invention or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0038] Figure 1 A flowchart of the steps of a method for managing unimpeded dual-line fusion traffic based on blockchain provided in one embodiment of the present invention;

[0039] Figure 2 Schematic diagram of the local relative priority of each operator node.

[0040] Figure 3 Construct a flow chart for the indicator of dynamically adjusting the step size at each number of iterations. DETAILED DESCRIPTION

[0041] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the following is a detailed description of the specific implementation method, structure, features and effects of the blockchain-based dual-line fusion traffic management system and method proposed by the present invention in combination with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.

[0042] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.

[0043] The specific scheme of the blockchain-based dual-line fusion traffic unimpeded management system and method provided by the present invention is described in detail below with reference to the accompanying drawings.

[0044] An embodiment of the present invention provides a blockchain-based dual-line fusion traffic unimpeded management system and method.

[0045] Specifically, the following blockchain-based dual-line fusion traffic management method is provided, please refer to Figure 1 , the method comprises the following steps:

[0046] Step S001, obtaining operator node data and user call history data information.

[0047] The historical communication time of each user is obtained through the user management system database within the enterprise, and the historical communication time of each operator node is obtained through the operator node management system. The historical communication time obtained for each user and each operator node is averaged to obtain the historical average communication time th of each user and each operator node. The operators are sorted from small to large according to their work numbers to obtain the operator sequence, which is recorded as PR.

[0048] Step S002, calculate the estimated end time of the operator node through the historical records of the communication personnel in the operator queue; calculate the communication priority of the operator node using the estimated end time of the operator node; calculate the local relative priority of the operator node priority through the communication priority of the operator node; calculate the dynamic adjustment step size under each iteration number using the communication priority of the operator node and the local relative priority of the priority level and the number of iterations.

[0049] For the operator's blockchain-based communication technology, each operator can be regarded as a participant or service provider in the blockchain network, and the user's call application can be stored on the blockchain as interaction information, and the information is owned by a certain operator node.

[0050] The key to ensuring smooth call traffic is to optimize the communication efficiency and allocation strategy between the user's call application and the operator node. Different users have different communication problems and require different times. The number of users that each operator node currently needs to communicate with may also be different. First, the optimal allocation of user call applications requires calculating the communication end time required by the operator node, that is, the time required to end the current operator communication queue.

[0051] For the personnel who need to communicate, determine whether they have interacted with each other in the past. If so, mark it as 1, otherwise mark it as 0. Operators with high processing capabilities can usually understand and solve user application problems more quickly, thereby shortening communication time and improving service efficiency. When calculating the estimated end time of the operator node, for the user call applications in the communication queue of each operator node, determine whether they have communicated with the operator node according to the historical communication mark table. If so, use the average duration of previous communications to estimate the duration of this communication; if not, use the average communication duration of the operator node for estimation.

[0052] The estimated end time of the operator node is calculated through the communication queue of each operator node.

[0053]

[0054]

[0055] Where, Tij represents the estimated communication time required for the call application of the jth user of operator node i; ij represents the historical average communication time of the jth user of operator node i; i represents the historical average communication time of operator node i; f ij Indicates a marking symbol. When the value is 1, it means that the user has a history of call applications. When the value is 0, it means that the user's call application is the first application. i represents the estimated end time currently required by operator node i; exp() represents an exponential function with the natural constant e as the base; Nt i Indicates the length of time that the operator node i has communicated with the current user’s call request; T i0 Indicates the estimated communication time between operator node i and the current user's call request; n i Indicates the number of people in the communication queue of operator node i.

[0056] When a user has a call request record, the time they may need for the next call is estimated based on the communication duration of the user's historical call request. This estimated value is T ij The closer to the actual communication duration, the higher the estimation accuracy. For each operator node, their estimated end time Aet i is the estimated communication time T for all user call requests they need to receive ij If the number of call applications n that the operator node needs to receive from users is larger, then their estimated end time Aet i Usually the larger the better.

[0057] The longer the estimated end time required by the operator node, the longer it takes for the operator node to communicate with the user's call application. In order to ensure that the user's call application can be communicated with the operator node as soon as possible to solve the problem. The shorter the estimated end time of the operator node, the higher the priority of the operator node. The processing frequency of the operator node is calculated by the estimated end time of the operator node and the historical average communication time of the operator node, and the communication priority of the operator node is calculated based on this.

[0058] Pr i =round(Norm(Aet i ×th i )×(N-1)+β)

[0059] In the formula, Pr i represents the communication priority of operator node i; round() represents the rounding function; Norm() represents the normalization function; Aet i represents the estimated end time currently required by operator node i; thi It represents the historical average communication time of operator node i; N represents the number of current operator nodes; β is the level adjustment factor, and the maximum priority is defined as 1, and the empirical value is 1. Note: The maximum priority is 1 and the minimum is N.

[0060] If the average processing time of an operator node is smaller, it means that they can handle tasks faster and more efficiently. This can not only reduce customer waiting time and improve service response speed, but also improve the overall service quality. When the average processing time of the operator node is smaller, the corresponding estimated end time will also be smaller, which means that they can complete all work tasks faster. The product of the estimated end time and the average processing time. An indicator that reflects the total workload of the operator node. The smaller this product is, the shorter the overall time required for the operator node to handle all tasks and the higher the work efficiency. The smaller the normalized value is, the higher the calculated communication priority level Pr i The smaller the value, the higher the priority of the operator node.

[0061] The communication priority levels of all operator nodes are arranged in the order of the operator sequence to form a communication priority sequence Pg. Since the priorities of operator nodes are different, all local relative priorities are also different. In the process of using the cuckoo algorithm for optimization, the local relative changes in the priorities of operator nodes need to be considered. When the local relative changes are small, it means that the priority distribution of operator nodes is relatively stable in the current search area, and the space for further optimization may be relatively limited. In this case, the step size of the cuckoo algorithm should be relatively small.

[0062] For the communication priority sequence Pg of the operator node, any element obtains its nearest m elements, where m takes the empirical value of 4, and records their communication priority and distance. The local relative priority of the operator node priority is constructed through the above description.

[0063]

[0064] Where, LPg i Represents the local relative priority of the communication priority level of operator node i; m is the number of elements with the closest distance; Pg i,k Pg represents the communication priority level of the operator node that is the kth nearest neighbor of operator node i; iμ represents the mean of the communication priority levels of the operator node i and its m nearest neighboring operator nodes; exp() represents an exponential function with the natural constant e as the base; L i,k represents the distance between operator node i and its kth nearest neighbor in the communication priority sequence. is the first sum value, is the second sum value.

[0065] When the communication priority of the operator node becomes insignificant locally, that is, the acquired communication priority is not much different, the local relative priority LPg of the communication priority of the operator node is obtained. i The smaller the value of . When the communication priority level of the operator node is closer, it means that the communication priority level of the operator node has a higher degree of influence on each other. Therefore, the inverse of the distance between the two is used as the exponent of the exponential function. As a weight, when the communication priority of the operator node changes more obviously locally, the local relative priority LPg of the operator node i The larger the value of . The schematic diagram of the local relative priority of each operator node is as follows Figure 2 shown.

[0066] When searching for the optimal solution through the cuckoo algorithm, different step sizes will lead to different calculation results, so when calculating the updated bird's nest position, the calculated step size is more applicable.

[0067] The dynamic adjustment step size of the communication cuckoo algorithm is calculated by the local relative priority LPg.

[0068]

[0069]

[0070] Where RRPg v The local priority distance of the vth iteration; LPg represents the distance between the current operator node and the operator node with the minimum communication priority in the communication priority sequence in the vth iteration; min represents the local relative priority of the operator node with the minimum communication priority in the communication priority sequence; Pg represents the communication priority sequence of the operator node. a' v Indicates the dynamically adjusted step size of the vth iteration; a indicates the step size of the original cuckoo algorithm, which takes an empirical value of 5 and can be set by the implementer according to the actual situation; exp() indicates an exponential function with the natural constant e as the base; v indicates the current number of iterations; V indicates the maximum number of iterations, which takes an empirical value of 100 and can be set by the implementer according to the actual situation.

[0071] The greater the distance between the current operator node and the operator node with the minimum communication priority level in the vth iteration, that is, The larger the value, the greater the local relative limit of the operator node to which the minimum communication priority belongs, that is, LPg min The larger the value is, the greater the local priority distance RRPg of the vth iteration is.v The larger the value, the larger the dynamic adjustment step value of the vth iteration. At the same time, the greater the number of iterations, the lower the impact on the dynamic adjustment step value. Therefore, As the influence weight of the iteration number.

[0072] At this point, the dynamic adjustment step size under each iteration number can be obtained through the above method. Among them, the indicator construction flow chart of the dynamic adjustment step size under each iteration number is as follows: Figure 3 shown.

[0073] Step S003, optimal traffic communication node selection and allocation module: improve the cuckoo algorithm according to the dynamic adjustment step size under each iteration number, allocate the optimal operator node for communicating with the current user, so as to realize normal traffic management.

[0074] The cuckoo algorithm is improved by dynamically adjusting the step size at each iteration number calculated in the above steps. The call application of the user who currently needs to communicate and each operator node are used as the input of the cuckoo algorithm. The optimal operator node is calculated in the improved cuckoo algorithm, and the user's call application is added to the communication queue of the optimal operator node through the uplink.

[0075] At this point, efficient allocation and processing of real-time user call application communication requests can be achieved, ensuring that the user's call application can be communicated and resolved as soon as possible.

[0076] At this point, this embodiment is completed.

[0077] Based on the same inventive concept as the above method, an embodiment of the present invention also provides a blockchain-based dual-line converged traffic unimpeded management system, including a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the computer program, the steps of any one of the above-mentioned blockchain-based dual-line converged traffic unimpeded management methods are implemented.

[0078] In summary, the embodiment of the present invention calculates the estimated end time of the operator node through the historical records of the communication personnel in the operator queue. The method takes into account whether the user has experienced historical communication and the communication ability of the operator node, and the calculation result is more authentic; the communication priority level of the operator node is calculated by using the estimated end time of the operator node, and the allocation level of the operator node can be determined, thereby reducing the waiting time of the user's call and improving the service response speed;

[0079] The local relative priority of the operator node priority is calculated by the communication priority of the operator node, so as to explore the local fluctuation of the communication priority of adjacent operator nodes, that is, whether there is an operator node relationship that affects each other, fully consider the spatial distribution characteristics of the operator nodes, and improve the call efficiency; finally, the embodiment of the present invention improves the cuckoo algorithm by utilizing the communication priority of the operator node and the local relative priority of the priority and the number of iterations to calculate the dynamic adjustment step size, which can better respond to real-time changes in call communication, improve service quality and customer satisfaction, and reduce operating costs and risks.

[0080] It should be noted that the sequence of the above embodiments of the present invention is only for description and does not represent the advantages and disadvantages of the embodiments. The above is a description of a specific embodiment of this specification. In addition, the processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0081] The various embodiments in this specification are described in a progressive manner, and the same or similar parts between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from other embodiments.

[0082] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Modifications to the technical solutions recorded in the aforementioned embodiments, or equivalent replacement of some of the technical features therein, do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.

Claims

1. A dual-line fusion traffic management method based on blockchain, characterized in that: The method comprises the following steps: Obtain the historical average communication time of each user and each operator node; sort the operator nodes from small to large according to the work number to obtain the operator sequence, and obtain the communication queue of each operator node, wherein the communication queue is each user to be communicated; The estimated end time of the operator node is constructed according to the historical average communication time of each user in the communication queue of the operator node and the historical average communication time of the operator node; the communication priority of the operator node is obtained according to the estimated end time and the historical average communication time of the operator node; the communication priority of each operator node is formed into a communication priority sequence according to the arrangement order of the operator sequence; The local relative priority of each operator node is obtained according to the distance between each operator node and its neighboring operator nodes in the communication priority sequence and the difference in communication priority; the local priority distance of each iteration is constructed according to the communication priority and local relative priority of each operator node in each iteration; the step size of the original cuckoo algorithm and the local priority distance are combined to obtain the dynamically adjusted step size of each iteration; The cuckoo algorithm is improved according to the dynamic adjustment step size of each iteration to achieve the allocation of the optimal operator node for the current user to be communicated; The step of constructing the estimated end time of the operator node according to the historical average communication time of each user in the communication queue of the operator node and the historical average communication time of the operator node includes: Obtain the estimated communication duration of each user in the communication queue of the operator node; calculate the sum of the estimated communication durations of all users in the communication queue of the operator node except the user currently communicating; The difference between the duration of communication of the currently communicating user and the estimated duration of communication is used as the exponent of an exponential function with a natural constant as the base, and the sum of the sum and the calculation result of the exponential function is used as the estimated end duration of the operator node; The step size of each iteration is obtained by combining the step size of the original cuckoo algorithm and the local priority distance, including: For the dynamically adjusted step size of each iteration, the inverse of the ratio of the number of iterations to the preset maximum number of iterations is calculated, and the product of the calculation result of the exponential function with the natural constant as the base and the local priority distance of each iteration is calculated; The sum of the product and the step length of the original cuckoo algorithm is used as the dynamic adjustment step length of each iteration; The improved cuckoo algorithm according to the dynamically adjusted step size of each iteration includes: The call application of the current user to be communicated and each operator node are used as the input of the cuckoo algorithm, and the step size of each iteration in the cuckoo algorithm is set to the dynamically adjusted step size under the corresponding number of iterations.

2. The method for managing unimpeded dual-line fusion traffic based on blockchain as claimed in claim 1, characterized in that: The obtaining of the historical average communication duration of each user and each operator node includes: Obtain the historical communication time of each user through the enterprise user management system; obtain the historical communication time of each operator node through the operator node management system; The average of all historical communication times of each user and each operator node is taken as the corresponding historical average communication time.

3. The blockchain-based dual-line fusion traffic management method according to claim 1, characterized in that: The obtaining of the estimated communication duration of each user in the communication queue of the operator node includes: For each user in the communication queue of the operator node, when the user has a historical call application, the user's estimated communication time is set to the user's historical average communication time; when the user does not have a historical call application, the user's estimated communication time is set to the historical average communication time of the operator node.

4. The method for managing smooth dual-line fusion traffic based on blockchain as claimed in claim 1, characterized in that: The obtaining of the communication priority of the operator node according to the estimated end time of the operator node and the historical average communication time includes: Calculate the normalized value of the product of the estimated end time of the operator node and the historical average communication time, calculate the difference result of the current number of operator nodes minus 1, and round off the product of the normalized value and the difference result as the communication priority level of the operator node.

5. The blockchain-based dual-line fusion traffic management method according to claim 1, characterized in that: The step of obtaining the local relative priority of each operator node according to the distance between each operator node and its adjacent operator nodes in the communication priority sequence and the difference in communication priority includes: The m nearest operator nodes of the operator node in the communication priority sequence are recorded as each neighbor operator node; Calculate the distance between each neighboring operator node and the operator node in the communication priority sequence respectively, and use the reciprocal of the distance as the exponent of an exponential function with a natural constant as the base; Obtaining the mean of the communication priority levels of all neighboring operator nodes; calculating the absolute value of the difference between the communication priority level of each neighboring operator node and the mean value, and taking the sum of the products of the absolute value of the difference of all neighboring operator nodes and the calculation result of the exponential function as the first sum; The sum of the calculation results of the exponential function of all neighboring operator nodes is used as the second sum; and the ratio of the first sum to the second sum is used as the local relative priority of the operator node.

6. The method for managing smooth dual-line fusion traffic based on blockchain as claimed in claim 5, characterized in that: The local priority distance of each iteration is constructed according to the communication priority level and local relative priority of each operator node in each iteration, including: Obtaining the operator node with the minimum communication priority in the communication priority sequence, and calculating the distance between the current operator node and the operator node with the minimum communication priority in the communication priority sequence at each iteration number; The product of the distance and the local relative limit of the operator node to which the minimum communication priority level belongs is used as the local priority distance for each iteration.

7. A dual-line fusion traffic management system based on blockchain, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

Images