A method and apparatus for power communication network multi-link switching

Abstract

The application provides a power communication network multi-link switching method and device, comprising: obtaining device resource information and service running state, constructing a multiple resource domain library, then obtaining a service resource mapping table in combination with the service running state, obtaining a planned switching instruction, determining a set of services to be switched, then obtaining a candidate switching scheme in combination with the service resource mapping table and obtaining a set of candidate switching schemes, performing resource occupation simulation to calculate simulation occupation rate and simulation occupation increment, and obtaining a competition participating service and a resource competition coupling graph, constructing a competition coupling strength matrix, obtaining an evaluation level based on the multiple resource domain library and the competition coupling strength matrix, then determining a global tentative scheme, performing time sequence isolation on the global tentative scheme to obtain a global switching scheme, obtaining a predicted competition strength and a measured competition strength based on the global switching scheme and in combination with the competition coupling strength matrix, then calculating a strength difference value to update the multiple resource domain library, and the end-to-end service quality after the multi-link switching is effectively guaranteed.

Description

Technical Field

[0001] This invention relates to the field of link discovery and switching, specifically to a method and device for multi-link switching in power communication networks. Background Technology

[0002] Multi-link switching in power communication networks relies on the comprehensive application of methods such as candidate link quality assessment and switching execution. It is widely used in scenarios such as power dispatch data networks and distribution automation communication networks. It aims to achieve a smooth transition of services between primary and backup links while ensuring end-to-end service quality. For example, in the case of line switching in power dispatch data networks, it is necessary to evaluate the indicators of candidate links one by one, ignoring the implicit competition and coupling effects between resources within the switching equipment, which may result in a large number of timeout retransmissions or losses of service packets.

[0003] Currently, the widely used multi-link switching methods mostly adopt simple threshold judgment or static routing based on link load rate and bit error rate. This makes it difficult to achieve a comprehensive balance between link quality assessment and the risk of internal resource competition within the equipment. It ignores the role of resource domain partitioning and competition intensity quantification. It is easy to forward dirty data or experience service quality degradation due to failure to consider resource access conflicts, and even endanger the safe and stable operation of the power system. Summary of the Invention

[0004] In view of the aforementioned problems, and in conjunction with the first aspect of the present invention, the present invention provides a method for multi-link handover in a power communication network, the method comprising:

[0005] S1: Obtain device resource information and business operation status, and after constructing multiple resource domain libraries based on device resource information, obtain the business resource mapping table in combination with business operation status;

[0006] S2: Obtain the planned switching instruction, determine the set of services to be switched based on the planned switching instruction, obtain candidate switching schemes by combining the service resource mapping table, and obtain the set of candidate switching schemes after constraint verification;

[0007] S3: Simulate resource usage of candidate switching schemes through multiple resource domain libraries to calculate simulated occupancy rate and simulated occupancy increment. After threshold comparison, obtain the coupling diagram of competing services and resource competition. After obtaining the real-time level of services, combine the resource competition coupling diagram, simulated occupancy increment and multiple resource domain libraries to calculate the comprehensive competition intensity to construct the competition coupling intensity matrix.

[0008] S4: After obtaining the evaluation level based on the multiple resource domain libraries and the competition coupling strength matrix, determine the global proposed scheme, and perform time-series isolation on the global proposed scheme to obtain the global switching scheme;

[0009] S5: Based on the global switching scheme and combined with the competition coupling strength matrix, the predicted competition strength and the measured competition strength are obtained, and the strength difference is calculated to update the multi-resource domain library.

[0010] Specifically, it acquires equipment resource information and business operation status, constructs multiple resource domain libraries based on the equipment resource information, and then obtains a business resource mapping table by combining the business operation status, including:

[0011] Obtain the device resource information and service operation status of the current switching device corresponding to each service. The device resource information refers to the description data of the internal resources of the current switching device, and the service operation status refers to the operation status data of each service in the current network.

[0012] Based on device resource information, the internal resources of the current switching device are divided into a cache resource domain, a scheduling resource domain, a switching resource domain, and a time synchronization resource domain.

[0013] Obtain the capacity parameters, maximum concurrency, recovery time constant, and current occupancy rate of each resource domain, and establish the sharing relationship between each resource domain to build a multi-resource domain library;

[0014] Based on the analysis of multiple resource domain libraries and service operation status, the forwarding path of each service is determined to identify the corresponding resource domain access sequence, and a service resource mapping table is established according to the resource domain access sequence.

[0015] Specifically, the process involves obtaining a planned switchover instruction, determining the set of services to be switched based on the instruction, obtaining candidate switchover schemes by combining the service resource mapping table, and then obtaining a set of candidate switchover schemes after constraint verification. This set includes:

[0016] Obtain planned switching instructions to determine the set of services to be switched, wherein the planned switching instructions are indicated by instructions that include at least the identifier of the service to be switched;

[0017] Obtain candidate link information and service constraint information. The candidate link information is represented by link quality parameters, including at least the link bandwidth, link latency, bit error rate, and link load rate of the candidate link. The service constraint information is represented by link quality requirements, including at least the maximum allowable latency and minimum available bandwidth for each service.

[0018] After determining the candidate switching devices for each candidate link based on the candidate link information, the corresponding candidate resource domain set is obtained by combining multiple resource domain libraries.

[0019] The business resource mapping table is updated based on the business resource mapping table and combined with the candidate resource domain set to generate candidate switching schemes for each service to be switched.

[0020] The candidate handover scheme set is obtained by performing constraint verification on all candidate handover schemes based on candidate link information and service constraint information.

[0021] Specifically, after constraining and validating all candidate handover schemes based on candidate link information and service constraint information, a candidate handover scheme set is obtained, including:

[0022] The available bandwidth of each candidate link is calculated based on the link bandwidth and link load rate, and the minimum available bandwidth and maximum latency corresponding to each candidate switching scheme are determined.

[0023] If the available bandwidth is less than the minimum available bandwidth, then the corresponding candidate handover scheme is discarded.

[0024] If the link delay is greater than the maximum delay, the corresponding candidate handover scheme is discarded.

[0025] If the bit error rate is greater than the bit error threshold, the corresponding candidate handover scheme is discarded.

[0026] The candidate handover schemes that were not discarded are combined into a candidate handover scheme set.

[0027] Specifically, for S3, this includes:

[0028] After statistically analyzing the current occupancy status and current occupancy intensity of each resource domain in the multi-resource domain library, each candidate switching scheme is simulated and executed sequentially, and the simulated occupancy status and simulated occupancy intensity of each resource domain under each candidate switching scheme are statistically analyzed.

[0029] The simulated occupancy rate is calculated based on the simulated occupancy status and multiple resource domain libraries, and the simulated occupancy increment is calculated based on the current occupancy intensity and the simulated occupancy intensity.

[0030] Preset the competition threshold for each resource domain, and compare the thresholds based on the simulated occupancy increment, simulated occupancy rate and competition threshold to determine the new competition relationship and corresponding competition participation business for each resource domain;

[0031] Using resource domains with newly added competitive relationships as graph nodes and the newly added competitive relationships as edges, construct a resource competition coupling graph corresponding to each candidate switching scheme;

[0032] The real-time business level is obtained to determine the business level weight. Combined with the resource competition coupling diagram, simulated occupancy increment and multiple resource domain libraries, the local competition intensity and competition transmission intensity are obtained. Based on the local competition intensity and competition transmission intensity, the comprehensive competition intensity is calculated and the competition coupling intensity matrix is ​​constructed.

[0033] Specifically, the real-time business level is obtained to determine the business level weight, and combined with the resource contention coupling diagram, simulated occupancy increment, and multiple resource domain libraries, the local contention intensity and contention propagation intensity are obtained. Based on the local contention intensity and contention propagation intensity, the comprehensive contention intensity is calculated, and a contention coupling intensity matrix is ​​constructed, including:

[0034] Obtain the real-time business level and determine the business level weight corresponding to each competing business based on the real-time business level.

[0035] Based on the number of competing businesses, obtain the current occupancy rate and recovery time constant based on the multiple resource domain libraries, and calculate the probability of resource access conflicts.

[0036] The local competition intensity of each resource domain is calculated based on the business level weight, the number of competing businesses, the simulated occupancy increment, the current occupancy rate, the recovery time constant, and the probability of resource access conflict. The competition propagation intensity is then calculated by combining the shared association relationships in the multiple resource domain libraries.

[0037] The comprehensive competition intensity of each resource domain is obtained based on the local competition intensity and competition transmission intensity to generate a competition coupling intensity matrix corresponding to the candidate switching scheme.

[0038] Specifically, after obtaining the evaluation level based on multiple resource domain libraries and the competition coupling strength matrix, a globally proposed scheme is determined. The globally proposed scheme is then temporally isolated to obtain a global switching scheme, including:

[0039] After obtaining the risk thresholds corresponding to each resource domain based on multiple resource domain libraries, the risk level is obtained by comparing them with the comprehensive competition intensity. The evaluation level of each candidate switching scheme is then determined based on the risk level.

[0040] After updating the candidate switching scheme set according to the evaluation level, a comprehensive score is calculated based on the risk level and combined with the competition coupling strength matrix and multiple resource domain libraries to determine the global proposed scheme.

[0041] The proposed global solution is isolated and verified to obtain the areas to be isolated. Based on multiple resource domain libraries, the areas to be isolated are time-series isolated to obtain a global switching solution.

[0042] Specifically, the globally proposed solution is isolated and verified to obtain the areas to be isolated. Based on multiple resource domain libraries, the areas to be isolated are then temporally isolated to obtain a global handover solution, including:

[0043] The total amount of competing business is obtained based on the globally proposed plan. If the total amount of competing business is greater than or equal to the business quantity threshold or the risk level is marked as medium risk, the corresponding resource domain is marked as a region to be isolated.

[0044] After generating business migration batches based on the total volume of competing business and determining the migration time window by combining multiple resource domain libraries, the areas to be isolated are time-series isolated to obtain a global switchover plan.

[0045] Specifically, based on the global switching scheme and combined with the competition coupling strength matrix to obtain the predicted competition strength and the measured competition strength, the strength difference is calculated to update the multi-resource domain library, including:

[0046] Based on the global switching scheme and combined with the competition coupling strength matrix, the predicted competition intensity is obtained. The service is switched according to the global switching scheme and the measured operation data of each resource domain is collected. The measured competition intensity is obtained based on the measured operation data and then the intensity difference is calculated by combining the predicted competition intensity.

[0047] The intensity difference is compared with the deviation threshold. When the intensity difference is less than or equal to the deviation threshold, the multi-resource domain library is updated based on the measured operating data. Otherwise, an alarm report is output.

[0048] Secondly, the present invention also provides a computer device, characterized in that the computer device includes a processor and a memory, the memory storing a computer program that can run on the processor, and the processor executing the computer program to implement the above-described method for multi-link switching in a power communication network.

[0049] Compared with the prior art, the present invention has the following beneficial effects:

[0050] This invention constructs a multi-resource domain library by dividing resource domains and combining them with shared association relationships to achieve fine modeling of internal resources of switching equipment and explicit representation of coupling relationships. This provides a resource competition analysis basis for handover decisions and avoids the decline in service quality after handover due to neglecting internal resource conflicts.

[0051] Simultaneously, the simulation identifies new competitive relationships, constructs a resource competition coupling graph, and obtains a comprehensive competition intensity and competition coupling intensity matrix to achieve accurate quantification and transmission path tracking of the impact of new businesses on resource domain competition. This solves the problems of being unable to predict the diffusion effect of resource competition and lacking quantitative assessment methods.

[0052] Finally, the optimal solution with the highest comprehensive score was selected to form the global proposed solution. Time-domain isolation and closed-loop comparison after handover were performed for adaptive fine-tuning, which completed the mitigation of transient impacts during the handover process and the optimization of resource domain parameters, effectively ensuring the end-to-end service quality after multi-link handover. Attached Figure Description

[0053] Figure 1 This is a flowchart illustrating the steps of a multi-link switching method for a power communication network provided in an embodiment of the present invention.

[0054] Figure 2 This is a framework diagram of a multi-link switching method for power communication networks provided in an embodiment of the present invention. Detailed Implementation

[0055] The present invention will now be described in detail with reference to the specification and accompanying drawings. Figure 1 This is a flowchart illustrating the steps of a multi-link switching method for a power communication network according to an embodiment of the present invention.Figure 2 This is a framework diagram of a multi-link switching method for power communication networks provided in an embodiment of the present invention. The following is a detailed description of this multi-link switching method for power communication networks.

[0056] Specifically, a method for multi-link switching in a power communication network includes the following steps:

[0057] Step S1: Obtain device resource information and service operation status. Based on the device resource information, construct a multi-resource domain library and then combine it with the service operation status to obtain the service resource mapping table.

[0058] In this embodiment, step S1 specifically includes steps S1-1 to S1-4:

[0059] Step S1-1: Obtain the device resource information and service operation status of the current switching device corresponding to each service. The device resource information refers to the description data of the internal resources of the current switching device, and the service operation status refers to the operation status data of each service in the current network.

[0060] Specifically, the device resource information and service operation status of the current switching device corresponding to each service are obtained. The device resource information is represented by the descriptive data of the internal resources of the current switching device, which includes at least the cache bank distribution, output queue structure, scheduler level, switching matrix connection relationship and PTP time synchronization module information of the current switching device. The service operation status is represented by the operation status data of each service in the current network, which includes at least the service identifier, service forwarding path and the switching device information where the service is located.

[0061] Among them, the cache bank distribution represents the storage medium information such as the number, capacity and mounting location of each physical storage chip inside the current switching device; the output queue structure represents the logical queuing organization form established on the storage medium; the scheduler hierarchy represents the hierarchical organization structure of the scheduling and processing units inside the current switching device from bottom to top; the switching matrix connection relationship represents the physical connection topology between each input port and output port of the switching chip inside the current switching device and the corresponding forwarding channel allocation; and the PTP time synchronization module information represents the operation information of the current switching device that undertakes the functions of sending and receiving Precision Time Protocol service messages, clock frequency calibration and timestamp calibration.

[0062] Step S1-2: Based on the device resource information, divide the internal resources of the current switching device into a cache resource domain, a scheduling resource domain, a switching resource domain, and a time synchronization resource domain.

[0063] Based on the cache bank distribution, output queue structure, scheduler hierarchy, switching matrix connection relationship, and PTP time synchronization module information in the device resource information, the internal resources of the current switching device are divided into cache resource domain, scheduling resource domain, switching resource domain, and time synchronization resource domain according to functional dimensions.

[0064] Understandably, since different cache banks are independently addressed and accessed, the upper limit of the available capacity of each cache bank is the natural boundary of all business competition behaviors. Therefore, cache resource domains are divided by the distribution of cache banks. The cache resource domain represents a set of storage resources that undertake business temporary storage and queuing functions.

[0065] Since each output queue has an independent scheduling weight, queue depth, and service policy, and the scheduling decisions are independent of each other, resource competition between different output queues under the same physical port only occurs within the output queue. The schedulers at each level make dequeue order decisions and bandwidth allocation arbitrations for the output queues at the corresponding level. Therefore, the scheduling resource domain is divided by the output queue structure and the scheduler hierarchy. The scheduling resource domain represents a set of processing resources that undertake the functions of service scheduling decisions and priority arbitration.

[0066] Since the port group switching channels of the switching matrix are independent hardware channels used to realize service switching between different input ports and output ports, and the switching channels within the port group share the same switching capacity boundary, the switching resource domain is divided by the connection relationship of the switching matrix. The switching resource domain represents a set of channel-type resources that undertake service switching and forwarding functions.

[0067] Since the PTP time synchronization module is an independent hardware unit used to implement the precise time synchronization protocol, the demand for timestamp processing from different services is aggregated into the same PTP time synchronization module for processing. However, the processing queue has a capacity limit. Therefore, the time synchronization resource domain is divided by the PTP time synchronization module information. The time synchronization resource domain represents a collection of synchronization resources that undertake the functions of clock synchronization and timestamp calibration.

[0068] It should be noted that the resource domains of caching, scheduling, switching, and time synchronization are divided separately because service switching in power communication networks is the result of mutual constraints and coupling among multiple types of resources. Therefore, focusing on only a single dimension may easily overlook implicit resource competition. By finely dividing the resource domains, more granular analysis objects can be provided for subsequent resource competition coupling analysis.

[0069] Steps S1-3: Obtain the capacity parameters, maximum concurrency, recovery time constant, and current occupancy rate of each resource domain, and establish the shared association relationship between each resource domain to construct a multi-resource domain library.

[0070] For the cache resource domain, scheduling resource domain, switching resource domain, and time synchronization resource domain, firstly, the basic response time of each resource domain is measured under no-load conditions. Then, the load intensity is increased in stages, and the utilization rate, average response time, and packet loss rate under each load intensity are recorded to plot the load-response time saturation curve. The load intensity at which the packet loss rate first exceeds the preset load threshold is taken as the capacity parameter. The load intensity corresponding to the inflection point of the load-response time saturation curve is taken as the maximum concurrency capacity. The time required to recover to the no-load state is measured as the recovery time constant. At the same time, the current occupied resource amount of each resource domain is collected in real time, and the ratio of the current occupied resource amount to the capacity parameter is taken as the current occupancy rate. The capacity parameter, maximum concurrency capacity, recovery time constant, and current occupancy rate are correlated with the corresponding cache resource domain, scheduling resource domain, switching resource domain, and time synchronization resource domain.

[0071] Among them, the capacity parameter represents the maximum total amount of resources that the resource domain can support; the maximum concurrency capacity represents the maximum number of services that the resource domain can process simultaneously per unit of time; the recovery time constant represents the time required for the resource domain to recover from a fully loaded state to an unloaded state; and the current occupancy rate represents the ratio of the amount of resources currently occupied by the resource domain to the capacity parameter.

[0072] If two or more resource domains share the same physical resource, for example, if the same cache bank is shared by multiple resource domains, then their sharing relationship is recorded and a sharing coefficient is assigned based on the degree of physical sharing. For example, if two resource domains share the same physical resource and there is no physical partition isolation, then the sharing coefficient between the two resource domains is assigned as 1; if there is an independent minimum guaranteed bandwidth allocation mechanism, then the sharing coefficient between the two resource domains is assigned as 0.8; if there is hard partition isolation, then the sharing coefficient between the two resource domains is assigned as 0.5.

[0073] The cache resource domain, scheduling resource domain, exchange resource domain, and time synchronization resource domain are combined to form a multi-resource domain library, and the shared association relationships between each resource domain are recorded.

[0074] Step S1-4: Based on the multiple resource domain library and the service operation status, analyze the forwarding path of each service to determine the corresponding resource domain access sequence, and establish a service resource mapping table according to the resource domain access sequence.

[0075] By analyzing the forwarding path of each service hop by hop based on the service's operational status, the resource domains that the service passes through in sequence during forwarding are determined and arranged in the order of forwarding to form a corresponding resource domain access sequence. A mapping relationship between each service and the resource domain access sequence is established to form a service resource mapping table.

[0076] Through the above operations, the functional decoupling and explicit modeling of the relationship between each service and the internal resources of the current switching device are realized. This allows each service to be accurately mapped to the access sequence of the resource domain it actually occupies, solving the problem of only focusing on the link layer bandwidth index and ignoring the implicit coupling relationship between various types of resources within the device.

[0077] Step S2: Obtain the planned switching instruction, determine the set of services to be switched based on the planned switching instruction, obtain candidate switching schemes by combining the service resource mapping table, and obtain the candidate switching scheme set after constraint verification.

[0078] In this embodiment, step S2 specifically includes steps S2-1 to S2-5:

[0079] Step S2-1: Obtain the planned switching instruction to determine the set of services to be switched, wherein the planned switching instruction is an instruction that includes at least the identifier of the service to be switched.

[0080] Obtain the planned switching instruction issued by EMS. The planned switching instruction is used to represent the link or path adjustment control instruction issued by EMS, and includes at least the identifier of the service to be switched. Parse the identifier of the service to be switched in the planned switching instruction and combine all the services corresponding to it into a set of services to be switched.

[0081] Step S2-2: Obtain candidate link information and service constraint information. The candidate link information is represented by link quality parameters, including at least the link bandwidth, link latency, bit error rate, and link load rate of the candidate link. The service constraint information is represented by link quality requirements, including at least the maximum allowed latency and minimum available bandwidth for each service.

[0082] Specifically, the system reads currently available candidate link information from the NMS. The candidate link information represents backup link information of the main link currently in use by the non-service to be switched, which is currently available and can be used by the non-service to be switched. It includes at least link identifier, link bandwidth, link latency, bit error rate and link load rate. The system obtains service constraint information by querying the NMS link state database. The service constraint information represents link quality requirements that include at least the maximum allowed latency and minimum available bandwidth for each service.

[0083] Step S2-3: After determining the candidate switching devices for each candidate link based on the candidate link information, obtain the corresponding candidate resource domain set by combining the multi-resource domain library.

[0084] Based on the link identifier in the candidate link information, the switching device connected to the exit end of each candidate link is determined and used as the corresponding candidate switching device. Each candidate link corresponds to a unique physical port on the candidate switching device.

[0085] The configuration of the cache bank associated with the physical port, the corresponding output queue and scheduler level, the port group and switching channel, and the PTP time synchronization module information are queried respectively to determine the cache resource domain, scheduling resource domain, switching resource domain and time synchronization resource domain corresponding to each candidate link, and then merged to form the candidate resource domain set of the candidate link.

[0086] Step S2-4: Update the business resource mapping table based on the business resource mapping table and in combination with the candidate resource domain set to generate candidate switching schemes for each service to be switched.

[0087] For each service to be switched, the current resource domain access sequence of the service to be switched is read from the service resource mapping table. Based on the candidate resource domain set, the cache resource domain, scheduling resource domain, switching resource domain and time synchronization resource domain in the resource domain access sequence are replaced respectively, while keeping their order unchanged to update the resource domain access sequence. The resource domain access sequence is combined with the corresponding candidate link to form a candidate switching scheme for the service to be switched. It should be noted that the service resource mapping table is the mapping relationship between each service and the resource domain access sequence, so the service resource mapping table is also updated after the resource domain access sequence is updated.

[0088] For example, in a possible embodiment, there are services A and B to be switched, candidate links 1 and 2, and corresponding candidate resource domain sets. The resource domain access sequence corresponding to services A and B to be switched is determined by reading the service resource mapping table. Then, the resource domain access sequence of service A to be switched is updated according to the candidate resource domain set of candidate link 1 to obtain the first candidate switching scheme of service A to be switched. Then, the resource domain access sequence of service A to be switched is updated according to the candidate resource domain set of candidate link 2 to obtain the second candidate switching scheme of service A to be switched. The above process is repeated for service B to be switched to obtain the first candidate switching scheme and the second candidate switching scheme of service B to be switched.

[0089] Step S2-5: After constraining and verifying all candidate handover schemes based on candidate link information and service constraint information, a candidate handover scheme set is obtained.

[0090] Specifically, step S2-5 includes steps S2-5-1 to S2-5-5:

[0091] Step S2-5-1: Calculate the available bandwidth of each candidate link based on the link bandwidth and link load rate, and determine the minimum available bandwidth and maximum latency corresponding to each candidate switching scheme.

[0092] Specifically, based on the candidate link information, the link bandwidth and link load rate of each candidate switching scheme are determined to calculate the available bandwidth. The calculation formula is as follows:

[0093] ;

[0094] in, This is represented as available bandwidth. Represented as link bandwidth, This is expressed as link load rate.

[0095] Based on the service constraint information, determine the minimum available bandwidth and maximum latency of the service to be switched for the candidate switching scheme.

[0096] Step S2-5-2: If the available bandwidth is less than the minimum available bandwidth, then discard the corresponding candidate handover scheme.

[0097] The available bandwidth is compared with the minimum available bandwidth. If the available bandwidth is less than the minimum available bandwidth, it means that the remaining available bandwidth of the candidate link corresponding to the candidate handover scheme is insufficient to carry the normal forwarding of the corresponding service to be handed over. This candidate handover scheme is not feasible and is discarded.

[0098] Step S2-5-3: If the link delay is greater than the maximum delay, then discard the corresponding candidate handover scheme.

[0099] The link latency is compared with the maximum latency. If the link latency is greater than the maximum latency, it means that the link latency of the candidate link corresponding to the candidate handover scheme exceeds the maximum latency of the corresponding service to be handed over, and cannot meet the real-time requirements. Therefore, this candidate handover scheme is not feasible and is discarded.

[0100] Step S2-5-4: If the bit error rate is greater than the bit error threshold, discard the corresponding candidate handover scheme.

[0101] The error threshold is preset according to the communication reliability requirements allowed by the service to be switched. For example, protection services have extremely high requirements for communication reliability and low tolerance for error rate, so the error threshold can be set to 10⁻. 9 Management-related services have relatively low requirements for communication reliability, so the error threshold can be set to 10⁻. 6 .

[0102] The bit error rate is compared with the bit error threshold. If the bit error rate is greater than the bit error threshold, it indicates that the transmission quality of the candidate link corresponding to the candidate handover scheme cannot meet the communication reliability requirements of the service to be handed over. Therefore, the candidate handover scheme is not feasible and is discarded.

[0103] Step S2-5-5: Combine the candidate handover schemes that have not been discarded into a candidate handover scheme set.

[0104] All candidate handover schemes that have not been discarded for each service to be switched are summarized and combined to form a candidate handover scheme set.

[0105] Step S2 is triggered by a planned handover command and uses the service resource mapping table as the data basis to obtain candidate links and their corresponding candidate resource domain sets. By replacing the current resource domain access sequence of each service to be handed over with the candidate resource domain set, a candidate handover scheme is generated. This ensures that all potential handover paths are included in the evaluation scope. Candidate handover schemes that do not meet the basic communication quality requirements of the service to be handed over are eliminated through three-dimensional constraint verification including minimum available bandwidth, maximum latency, and bit error rate. This avoids obviously infeasible candidate handover schemes occupying resources, and enables subsequent steps to evaluate the feasibility of candidate handover schemes from the micro perspective of resource competition within the candidate switching equipment.

[0106] Step S3: Simulate resource occupancy of candidate handover schemes through a multi-resource domain library to calculate simulated occupancy rate and simulated occupancy increment. After threshold comparison, obtain the coupling diagram of competing services and resource competition. After obtaining the real-time level of the service, combine the resource competition coupling diagram, simulated occupancy increment and multi-resource domain library to calculate the comprehensive competition intensity to construct the competition coupling intensity matrix.

[0107] In this embodiment, step S3 specifically includes steps S3-1 to S3-5:

[0108] Step S3-1: After calculating the current occupancy status and current occupancy intensity of each resource domain in the multi-resource domain library, simulate and execute each candidate switching scheme in sequence, and calculate the simulated occupancy status and simulated occupancy intensity of each resource domain under each candidate switching scheme.

[0109] The current occupancy status and current occupancy intensity of each resource domain in the multi-resource domain library are statistically analyzed. The current occupancy status represents the internal resources currently occupied by the resource domain, and the current occupancy intensity represents the sum of the occupancy intensities of all services currently residing on the resource domain.

[0110] For the current candidate handover scheme, a sandbox replica is created based on the current occupancy status and current occupancy intensity. After releasing the resources occupied by the corresponding service to be switched on each resource domain in the sandbox replica, new occupancy records are established on each resource domain of the candidate switching device according to the resource domain access sequence to simulate the execution of the candidate handover scheme, and the simulated occupancy status and simulated occupancy intensity of each resource domain are statistically analyzed.

[0111] It should be noted that the simulated execution of each candidate handover scheme means that, without actually changing the service forwarding path, the occupancy of each resource domain involved in the candidate handover scheme is simulated and deduced based on a multi-resource domain library.

[0112] Step S3-2: Calculate the simulated occupancy rate based on the simulated occupancy status and multiple resource domain libraries, and calculate the simulated occupancy increment based on the current occupancy intensity and the simulated occupancy intensity.

[0113] Extract the capacity parameters corresponding to each resource domain in the multi-resource domain library, calculate the ratio of the simulated occupancy status to the capacity parameters and use it as the simulated occupancy rate of the corresponding resource domain, calculate the difference between the simulated occupancy intensity and the current occupancy intensity as the simulated occupancy increment of the corresponding resource domain. The simulated occupancy rate is used to characterize the load intensity of the corresponding resource domain after the candidate switching scheme is executed, and the simulated occupancy increment is used to characterize the newly added occupancy load of the corresponding resource domain after the candidate switching scheme is executed.

[0114] Step S3-3: Preset the competition threshold for each resource domain, and compare the thresholds based on the simulated occupancy increment, simulated occupancy rate and competition threshold to determine the new competition relationship and corresponding competition participation business for each resource domain.

[0115] For cached resource domains, a contention threshold is preset based on the tolerance for packet loss and the capacity parameter. For example, for services that are sensitive to packet loss, the contention threshold can be set to 70% of the capacity parameter; for services with ample cache resources, the contention threshold can be set to 90% of the capacity parameter.

[0116] For the scheduling resource domain, a competition threshold is preset based on the tolerance for scheduling delay and the maximum concurrency capacity. For example, for services with low tolerance for scheduling delay, the competition threshold can be set to 70% of the maximum concurrency capacity; for services with relatively high tolerance for scheduling delay, the competition threshold can be set to 90% of the maximum concurrency capacity.

[0117] For the switching resource domain, a contention threshold is preset based on the tolerance for switching latency and the maximum concurrency capability. For example, for services that are sensitive to switching latency, the contention threshold can be set to 75% of the maximum concurrency capability; for services that have a higher tolerance for switching latency, the contention threshold can be set to 85% of the maximum concurrency capability.

[0118] For the time synchronization resource domain, a competition threshold is preset based on the requirements for synchronization accuracy and the maximum processing capacity of the PTP time synchronization module. For example, for services with extremely high synchronization accuracy requirements, the competition threshold can be set to 60% of the maximum processing capacity of the PTP time synchronization module; for services with moderate synchronization accuracy requirements, the competition threshold can be 85% of the maximum processing capacity of the PTP time synchronization module.

[0119] When the simulated occupancy increment is greater than 0 and the simulated occupancy rate is greater than the competition threshold, it is determined that there is a new competition relationship in the corresponding resource domain, and all services involving that resource domain are marked as competing services; otherwise, it is determined that there is no new competition relationship.

[0120] Step S3-4: Using the resource domains with newly added competitive relationships as graph nodes and the newly added competitive relationships as edges, construct the resource competition coupling graph corresponding to each candidate switching scheme.

[0121] Using each resource domain with newly added competitive relationships as a graph node, and the newly added competitive relationships as edges, a resource competition coupling graph for each candidate switching scheme is constructed. The resource competition coupling graph reflects the competitive relationships between each resource domain after the implementation of the candidate switching scheme.

[0122] Step S3-5: Obtain the real-time business level to determine the business level weight, and combine it with the resource competition coupling diagram, simulated occupancy increment and multiple resource domain libraries to obtain the local competition intensity and competition transmission intensity. After calculating the comprehensive competition intensity based on the local competition intensity and competition transmission intensity, construct the competition coupling intensity matrix.

[0123] Specifically, step S3-5 includes steps S3-5-1 to S3-5-4:

[0124] Step S3-5-1: Obtain the real-time business level and determine the business level weight corresponding to each competing business based on the real-time business level.

[0125] The real-time level of competing services is obtained. The real-time level is a pre-defined level based on the sensitivity of the service to latency and reliability. For example, the real-time level of protection services is the highest, the real-time level of data collection services is the second highest, and the real-time level of monitoring services is the lowest.

[0126] The business level weight of each competing business is determined based on the real-time business level. The higher the real-time business level, the greater the corresponding business level weight. It should be noted that the business level weight should not be less than 1 to ensure that the contribution of the number of competing businesses is always positive. For example, in a possible embodiment, the business level weight of protection business is 1.3, the business level weight of collection business is 1.1, and the business level weight of monitoring business is 1.0.

[0127] Step S3-5-2: Obtain the number of competing services based on the competing services, obtain the current occupancy rate and recovery time constant according to the multi-resource domain library, and calculate the probability of resource access conflict.

[0128] Specifically, the number of competing services in each resource domain is determined based on the competing services. Simultaneously, the current occupancy rate and recovery time constant of each resource domain are retrieved from the multi-resource domain database. The average access duration is obtained by averaging the time each service spends accessing a resource domain. Based on the current occupancy rate, recovery time constant, and average access duration, the resource access conflict probability of each resource domain is calculated using the following formula:

[0129] ;

[0130] in, This represents the probability of a resource access conflict. This is represented as the current occupancy rate. This is expressed as the average visit duration. It is represented as the recovery time constant.

[0131] Step S3-5-3: Calculate the local competition intensity of each resource domain based on the business level weight, the number of competing businesses, the simulated occupancy increment, the current occupancy rate, the recovery time constant, and the probability of resource access conflict, and calculate the competition transmission intensity in combination with the shared association relationship in the multiple resource domain library.

[0132] For each graph node in the resource contention coupling graph with a newly added competitive relationship, the local contention intensity of the resource domain is calculated based on the business level weight, the number of competing businesses, the simulated occupancy increment, the current occupancy rate, the recovery time constant, and the probability of resource access conflict. The calculation formula is as follows:

[0133] ;

[0134] in, Represented as local competition intensity, This is represented as the current occupancy rate. This is represented as the simulated occupancy increment. This represents the number of competing businesses. This is represented as a business level weight. This represents the probability of a resource access conflict. It is represented as the recovery time constant.

[0135] After obtaining the local contention intensity, query the shared association relationships recorded in the multi-resource domain database. For each resource domain with shared association relationships, calculate its contention propagation intensity based on the corresponding sharing coefficient. The calculation formula is as follows:

[0136] ;

[0137] in, Represented as competitive transmission strength, , These are represented as two different resource domains. Represented as local competition intensity, Represented as a resource domain With resource domain The sharing coefficient between them.

[0138] Step S3-5-4: Obtain the comprehensive competition intensity corresponding to each resource domain based on the local competition intensity and competition propagation intensity to generate a competition coupling intensity matrix corresponding to the candidate switching scheme.

[0139] Specifically, for each graph node in the resource competition coupling graph with a newly added competitive relationship, the comprehensive competitive intensity of the resource domain is obtained by summing the local competitive intensity of the resource domain with the competitive transmission intensity of all nodes transmitted to the resource domain.

[0140] Traverse all graph nodes in the resource competition coupling graph corresponding to the current candidate switching scheme, calculate the comprehensive competition intensity of each resource domain, and then combine the comprehensive competition intensities of all resource domains in the candidate switching scheme by numbering them to form the competition coupling intensity matrix corresponding to the candidate switching scheme. For each candidate switching scheme in the candidate switching scheme set, execute the process of constructing the competition coupling intensity matrix from step S3-5-1 to step S3-5-4 in sequence to obtain the competition coupling intensity matrix corresponding to each candidate switching scheme.

[0141] Step S3 takes the candidate handover scheme set as the object, performs resource occupation simulation on each candidate handover scheme, filters out resource domains with new competitive relationships and corresponding competitive services, and constructs a resource competition coupling diagram to explicitly show the transmission path of new competitive relationships between resource domains. Then, it quantifies the comprehensive competition intensity from two dimensions: local competition intensity and competition transmission intensity, and finally constructs a competition coupling intensity matrix that corresponds one-to-one with the candidate handover scheme. This avoids the problem of missing the risk of multi-resource domain collaborative competition within the device by judging the feasibility of candidate handover schemes based solely on link indicators. It overcomes the limitations of passively discovering resource congestion after handover execution and lacking quantitative evaluation methods for competition transmission effects.

[0142] Step S4: After obtaining the evaluation level based on the multiple resource domain library and the competition coupling strength matrix, determine the global proposed scheme, and perform time-series isolation on the global proposed scheme to obtain the global switching scheme.

[0143] In this embodiment, step S4 specifically includes steps S4-1 to S4-4:

[0144] Step S4-1: After obtaining the risk threshold corresponding to each resource domain based on the multi-resource domain library, compare it with the comprehensive competition intensity to obtain the risk level, and determine the evaluation level of each candidate switching scheme based on the risk level.

[0145] Specifically, risk thresholds are preset based on the contention thresholds for each resource domain in the multi-resource domain library. For example, contention in the cache resource domain mainly manifests as packet loss due to insufficient storage space, so the risk threshold can be set to 65% of the contention threshold to provide an early warning signal for candidate switching decisions. Contention in the scheduling resource domain mainly manifests as a decline in service quality due to scheduling overruns, so the risk threshold can be set to 70% of the contention threshold to identify potential risks before scheduling resources are fully saturated. Contention in the switching resource domain mainly manifests as increased forwarding latency due to switching bandwidth saturation, so the risk threshold can be set to 75% of the contention threshold to provide timely warnings before switching resources are close to saturation. Contention in the time synchronization resource domain is extremely sensitive to the accuracy of time synchronization, so the risk threshold can be set to 60% of the contention threshold to ensure that the accuracy of the PTP time synchronization module is not affected.

[0146] The overall competition intensity of each resource domain is compared with the risk threshold. When the overall competition intensity is greater than or equal to the risk threshold × 90%, it indicates that the resource domain is in a state of severe overload or high congestion. The resource access conflict between new services and existing services in the resource domain is extremely intense, and the processing capacity limit of the resource domain has been approached or reached. At this time, the resource domain under the corresponding candidate switching scheme is judged to be of high risk level.

[0147] When the risk threshold × 90% > the overall competition intensity ≥ the risk threshold × 60%, it indicates that the resource domain has experienced significant resource competition pressure but has not yet reached an overload state. Resource conflicts between new and existing businesses may lead to a decline in the service quality of some businesses, but have not yet exceeded the processing capacity limit of the resource domain. In this case, the resource domain under the corresponding candidate switching scheme is judged to be at a medium risk level.

[0148] When the risk threshold × 60% is greater than the overall competition intensity, it indicates that the resource domain has a light load. The impact of new services entering the resource domain on existing services is small. The resource domain still has sufficient capacity to handle the new load and will not have a substantial impact on the normal forwarding of services. At this time, the resource domain under the corresponding candidate switching scheme is judged to be of low risk level.

[0149] The highest risk level among all resource domains under this candidate switching plan is used as the evaluation level of this candidate switching plan.

[0150] Step S4-2: After updating the candidate switching scheme set according to the evaluation level, calculate the comprehensive score based on the risk level and in combination with the competition coupling strength matrix and multiple resource domain libraries to determine the proposed global scheme.

[0151] Candidate switching schemes assessed as high-risk are removed from the candidate switching scheme set. For the retained candidate switching schemes, the number of resource domains with a comprehensive competitive intensity greater than zero under the candidate switching scheme is read from the competitive coupling strength matrix as the number of newly added competitive resource domains, to reflect the direct impact of the candidate switching scheme on the competitive scope of each resource domain; the comprehensive competitive intensity of all resource domains is summed as the comprehensive competitive intensity sum, to reflect the comprehensive impact of the candidate switching scheme on the competitive intensity of resource domains; the maximum value of the comprehensive competitive intensity is taken as the competitive peak value, to reflect the highest competitive pressure borne by a single resource domain in the candidate switching scheme.

[0152] Resource recovery margin is calculated based on the capacity parameters and current occupancy rate of each resource domain in the multi-resource domain library to reflect the average percentage of remaining capacity of each resource domain after the candidate switchover plan is implemented. The calculation formula is as follows:

[0153] ;

[0154] in, This is expressed as resource recovery margin. This is expressed as the total number of resource domains. Represented as the first One resource domain, Represented as the first Current occupancy rate of each resource domain.

[0155] After normalizing the number of newly added competing resource domains, the total overall competition intensity, the peak competition level, and the resource recovery margin, the corresponding comprehensive score is calculated based on the risk level of each resource domain in the candidate switching scheme. The calculation formula is as follows:

[0156] ;

[0157] in, , , and These are weighted coefficients, and their sum is 1. This represents the number of newly added competing resource domains. Expressed as the sum of overall competitive intensity, Represented as the competition peak, This is expressed as resource recovery margin. This is expressed as the attenuation coefficient for medium-risk levels. This represents the number of resource domains corresponding to the medium-risk level. This is represented as the attenuation coefficient for low-risk levels. This represents the number of resource domains corresponding to the low-risk level, and < .

[0158] For each service to be switched, the candidate switching scheme with the highest comprehensive score is selected as its optimal scheme, and the optimal schemes of all services to be switched are combined to form the global proposed scheme.

[0159] Step S4-3: Perform isolation verification on the globally proposed scheme to obtain the area to be isolated, and perform time-series isolation on the area to be isolated based on the multi-resource domain library to obtain the global switching scheme.

[0160] Specifically, step S4-3 includes steps S4-3-1 to S4-3-4:

[0161] Step S4-3-1: Obtain the total amount of competing business based on the globally proposed plan. If the total amount of competing business is greater than or equal to the business quantity threshold or the risk level is marked as medium risk, then mark the corresponding resource domain as the area to be isolated.

[0162] Specifically, for all candidate handover schemes involved in the globally proposed scheme, the sum of the number of competing services for the resource domain under each candidate handover scheme is taken as the total number of competing services for the resource domain under the globally proposed scheme.

[0163] The threshold for the number of services is preset based on the service aggregation capacity that each resource domain can withstand. For example, the main competition in the cache resource domain comes from the simultaneous access of multiple service flows, which leads to the contention for storage resources. Therefore, its service quantity threshold can be set to 4.

[0164] If the total amount of competing business is greater than or equal to the business quantity threshold or the risk level is marked as medium risk, then the corresponding resource domain will be marked as a region to be isolated.

[0165] Step S4-3-2: Generate business migration batches based on the total amount of competing business, determine the migration time window by combining multiple resource domain libraries, and then perform time-series isolation on the areas to be isolated to obtain a global switchover plan.

[0166] Based on the total amount of competing services in the resource domain, services accessing the same resource domain are divided into multiple batches. Services with newly emerging competitive relationships are allocated to different batches according to the resource competition coupling diagram. Then, the recovery time constant of the resource domain is read from the multi-resource domain library, and a corresponding migration time window is assigned to each service migration batch. Different service migration batches are executed separately, and the interval between migration time windows is at least twice the recovery time constant to ensure that the resource domain has enough time to return to a stable state after the previous service migration batch is completed. Based on the service migration batch and migration time window, the area to be isolated is temporally isolated, and the globally proposed scheme after temporal isolation is used as the global switching scheme.

[0167] By determining the risk level and calculating the comprehensive score in step S4, the optimal solution for the service to be switched is selected to determine the global proposed solution. The global proposed solution is then temporally isolated to finally form the global switching solution. This achieves a complete mapping from quantifying resource competition risk to a specific global switching solution. The final selected global switching solution minimizes resource competition within the candidate switching equipment and ensures a smooth and reliable switching process while meeting link quality requirements. This avoids the problem of ignoring transient impacts during switching execution when making decisions based solely on the comprehensive score, and overcomes the limitation of lacking temporal isolation optimization for the switching execution process.

[0168] Step S5: Based on the global switching scheme and combined with the competition coupling strength matrix, obtain the predicted competition strength and the measured competition strength, and calculate the strength difference to update the multi-resource domain library.

[0169] In this embodiment, step S5 specifically includes steps S5-1 to S5-2:

[0170] Step S5-1: Based on the global switching scheme and combined with the competition coupling strength matrix, obtain the predicted competition strength, perform service switching according to the global switching scheme and collect the measured operation data of each resource domain, obtain the measured competition strength based on the measured operation data and calculate the strength difference by combining it with the predicted competition strength.

[0171] Specifically, the comprehensive competition intensity of each resource domain in the optimal scheme involved in the global switching scheme is read from the competition coupling strength matrix, and the comprehensive competition intensity values ​​of the same resource domain under all optimal schemes are summed to obtain the predicted competition intensity of that resource domain.

[0172] Then, according to the business migration batches and migration time windows divided in the global switching plan, the business switching is performed batch by batch until all the businesses to be switched are switched. Then, the measured operation data of each resource domain in the optimal solution involved in the global switching plan are collected respectively. The measured operation data represents the data that can be collected after the global switching plan is implemented, which is used to calculate the comprehensive competitive intensity.

[0173] Based on the measured operating data and the comprehensive competition intensity calculation process from step S3-5-3 to step S3-5-4, the measured competition intensity is obtained. The absolute value of the difference between the measured competition intensity and the predicted competition intensity is taken as the intensity difference of each resource domain.

[0174] Step S5-2: Compare the intensity difference with the deviation threshold. If the intensity difference is less than or equal to the deviation threshold, update the multi-resource domain library based on the measured operating data. Otherwise, output an alarm report.

[0175] Preset deviation thresholds based on the accuracy requirements of each type of resource domain. For example, the cache resource domain has a large capacity and high tolerance for fluctuations, so its deviation threshold can be set to 0.15; the time synchronization resource domain has extremely high accuracy requirements, so its deviation threshold can be set to 0.08.

[0176] When the intensity difference is less than or equal to the deviation threshold, it indicates that the deviation of the corresponding resource domain is within an acceptable range. At this time, the intensity difference is divided by the predicted competition intensity as the deviation rate. A certain percentage of the deviation rate is used to fine-tune the corresponding capacity parameters, maximum concurrency capability, and recovery time constant of the resource domain, for example, 20%.

[0177] When the intensity difference exceeds the deviation threshold, it indicates that there is a problem with the global switchover scheme being implemented, and an alarm report is output to notify the operations and maintenance personnel.

[0178] In summary, through the coordinated operation of the above five steps, this invention forms a systematic and adaptive multi-link switching method for power communication networks. It elevates the core basis for switching decisions from link quality to the level of resource competition risk within the switching equipment. Using resource domains as the granularity of analysis and comprehensive competition intensity as the basis for link selection, it avoids problems such as buffer congestion, scheduling delays, switching blockages, and time synchronization disturbances caused by multiple services converging in the same resource domain after service switching. This effectively ensures the end-to-end service quality after service switching in power communication networks.

[0179] Furthermore, this embodiment of the invention also provides a computer device, characterized in that the computer device includes a processor and a memory, the memory stores a computer program that can run on the processor, and the processor executes the computer program to implement a multi-link switching method for power communication networks provided in this embodiment of the invention.

[0180] The above description is merely a preferred embodiment of the present invention. Those skilled in the art will understand that various changes or equivalent substitutions can be made to these features and embodiments without departing from the spirit and scope of the present invention. Furthermore, under the teachings of the present invention, these features and embodiments can be modified to adapt to specific situations and materials without departing from the spirit and scope of the present invention. Therefore, the present invention is not limited to the specific embodiments disclosed herein, and all embodiments falling within the scope of the claims of this application are within the protection scope of the present invention.

Claims

1. A method for multi-link switching in a power communication network, characterized in that, include: S1: Obtain device resource information and business operation status, and after constructing multiple resource domain libraries based on device resource information, obtain the business resource mapping table in combination with business operation status; S2: Obtain the planned switching instruction, determine the set of services to be switched based on the planned switching instruction, obtain candidate switching schemes by combining the service resource mapping table, and obtain the set of candidate switching schemes after constraint verification; S3: Simulate resource usage of candidate switching schemes through multiple resource domain libraries to calculate simulated occupancy rate and simulated occupancy increment. After threshold comparison, obtain the coupling diagram of competing services and resource competition. After obtaining the real-time level of services, combine the resource competition coupling diagram, simulated occupancy increment and multiple resource domain libraries to calculate the comprehensive competition intensity to construct the competition coupling intensity matrix. S4: After obtaining the evaluation level based on the multiple resource domain libraries and the competition coupling strength matrix, determine the global proposed scheme, and perform time-series isolation on the global proposed scheme to obtain the global switching scheme; S5: Based on the global switching scheme and combined with the competition coupling strength matrix, the predicted competition strength and the measured competition strength are obtained, and the strength difference is calculated to update the multi-resource domain library.

2. The multi-link switching method for power communication networks according to claim 1, characterized in that, Obtain device resource information and service operation status. Based on the device resource information, construct a multi-resource domain library and then combine it with the service operation status to obtain a service resource mapping table, including: Obtain the device resource information and service operation status of the current switching device corresponding to each service. The device resource information refers to the description data of the internal resources of the current switching device, and the service operation status refers to the operation status data of each service in the current network. Based on device resource information, the internal resources of the current switching device are divided into a cache resource domain, a scheduling resource domain, a switching resource domain, and a time synchronization resource domain. Obtain the capacity parameters, maximum concurrency, recovery time constant, and current occupancy rate of each resource domain, and establish the sharing relationship between each resource domain to build a multi-resource domain library; Based on the analysis of multiple resource domain libraries and service operation status, the forwarding path of each service is determined to identify the corresponding resource domain access sequence, and a service resource mapping table is established according to the resource domain access sequence.

3. The multi-link switching method for a power communication network according to claim 1, characterized in that, Obtain the planned switchover instruction, determine the set of services to be switched based on the planned switchover instruction, obtain candidate switchover schemes by combining the service resource mapping table, and obtain the candidate switchover scheme set after constraint verification, including: Obtain planned switching instructions to determine the set of services to be switched, wherein the planned switching instructions are indicated by instructions that include at least the identifier of the service to be switched; Obtain candidate link information and service constraint information. The candidate link information is represented by link quality parameters, including at least the link bandwidth, link latency, bit error rate, and link load rate of the candidate link. The service constraint information is represented by link quality requirements, including at least the maximum allowable latency and minimum available bandwidth for each service. After determining the candidate switching devices for each candidate link based on the candidate link information, the corresponding candidate resource domain set is obtained by combining multiple resource domain libraries. The business resource mapping table is updated based on the business resource mapping table and combined with the candidate resource domain set to generate candidate switching schemes for each service to be switched. The candidate handover scheme set is obtained by performing constraint verification on all candidate handover schemes based on candidate link information and service constraint information.

4. The multi-link switching method for a power communication network according to claim 3, characterized in that, After constraining and validating all candidate handover schemes based on candidate link information and service constraint information, a set of candidate handover schemes is obtained, including: The available bandwidth of each candidate link is calculated based on the link bandwidth and link load rate, and the minimum available bandwidth and maximum latency corresponding to each candidate switching scheme are determined. If the available bandwidth is less than the minimum available bandwidth, then the corresponding candidate handover scheme is discarded. If the link delay is greater than the maximum delay, the corresponding candidate handover scheme is discarded. If the bit error rate is greater than the bit error threshold, the corresponding candidate handover scheme is discarded. The candidate handover schemes that were not discarded are combined into a candidate handover scheme set.

5. A multi-link switching method for a power communication network according to claim 1, characterized in that, For S3, including: After statistically analyzing the current occupancy status and current occupancy intensity of each resource domain in the multi-resource domain library, each candidate switching scheme is simulated and executed sequentially, and the simulated occupancy status and simulated occupancy intensity of each resource domain under each candidate switching scheme are statistically analyzed. The simulated occupancy rate is calculated based on the simulated occupancy status and multiple resource domain libraries, and the simulated occupancy increment is calculated based on the current occupancy intensity and the simulated occupancy intensity. Preset the competition threshold for each resource domain, and compare the thresholds based on the simulated occupancy increment, simulated occupancy rate and competition threshold to determine the new competition relationship and corresponding competition participation business for each resource domain; Using resource domains with newly added competitive relationships as graph nodes and the newly added competitive relationships as edges, construct a resource competition coupling graph corresponding to each candidate switching scheme; The real-time business level is obtained to determine the business level weight. Combined with the resource competition coupling diagram, simulated occupancy increment and multiple resource domain libraries, the local competition intensity and competition transmission intensity are obtained. Based on the local competition intensity and competition transmission intensity, the comprehensive competition intensity is calculated and the competition coupling intensity matrix is ​​constructed.

6. A multi-link switching method for a power communication network according to claim 5, characterized in that, The real-time service level is obtained to determine the service level weight. Combined with the resource contention coupling diagram, simulated occupancy increments, and multiple resource domain libraries, local contention intensity and contention propagation intensity are obtained. Based on the local contention intensity and contention propagation intensity, the comprehensive contention intensity is calculated, and a contention coupling intensity matrix is ​​constructed, including: Obtain the real-time business level and determine the business level weight corresponding to each competing business based on the real-time business level. Based on the number of competing businesses, obtain the current occupancy rate and recovery time constant based on the multiple resource domain libraries, and calculate the probability of resource access conflicts. The local competition intensity of each resource domain is calculated based on the business level weight, the number of competing businesses, the simulated occupancy increment, the current occupancy rate, the recovery time constant, and the probability of resource access conflict. The competition propagation intensity is then calculated by combining the shared association relationships in the multiple resource domain libraries. The comprehensive competition intensity of each resource domain is obtained based on the local competition intensity and competition transmission intensity to generate a competition coupling intensity matrix corresponding to the candidate switching scheme.

7. A multi-link switching method for a power communication network according to claim 1, characterized in that, After obtaining the evaluation level based on multiple resource domain libraries and the competition coupling strength matrix, a globally proposed scheme is determined. The globally proposed scheme is then temporally isolated to obtain a global handover scheme, including: After obtaining the risk thresholds corresponding to each resource domain based on multiple resource domain libraries, the risk level is obtained by comparing them with the comprehensive competition intensity. The evaluation level of each candidate switching scheme is then determined based on the risk level. After updating the candidate switching scheme set according to the evaluation level, a comprehensive score is calculated based on the risk level and combined with the competition coupling strength matrix and multiple resource domain libraries to determine the global proposed scheme. The proposed global solution is isolated and verified to obtain the areas to be isolated. Based on multiple resource domain libraries, the areas to be isolated are time-series isolated to obtain a global switching solution.

8. A multi-link switching method for a power communication network according to claim 7, characterized in that, The globally proposed solution is isolated and verified to obtain the areas to be isolated. Based on multiple resource domain libraries, the areas to be isolated are then temporally isolated to obtain a global handover solution, including: The total amount of competing business is obtained based on the globally proposed plan. If the total amount of competing business is greater than or equal to the business quantity threshold or the risk level is marked as medium risk, the corresponding resource domain is marked as a region to be isolated. After generating business migration batches based on the total volume of competing business and determining the migration time window by combining multiple resource domain libraries, the areas to be isolated are time-series isolated to obtain a global switchover plan.

9. A multi-link switching method for a power communication network according to claim 1, characterized in that, Based on the global switching scheme and combined with the competition coupling strength matrix to obtain the predicted and measured competition strength, the strength difference is calculated to update the multi-resource domain library, including: Based on the global switching scheme and combined with the competition coupling strength matrix, the predicted competition intensity is obtained. The service is switched according to the global switching scheme and the measured operation data of each resource domain is collected. The measured competition intensity is obtained based on the measured operation data and then the intensity difference is calculated by combining the predicted competition intensity. The intensity difference is compared with the deviation threshold. When the intensity difference is less than or equal to the deviation threshold, the multi-resource domain library is updated based on the measured operating data. Otherwise, an alarm report is output.

10. A computer device, characterized in that, The computer device includes a processor and a memory, the memory storing a computer program that can run on the processor, and the processor executing the computer program implements a multi-link switching method for a power communication network as described in any one of claims 1-9.

Images