A network channel planning method, apparatus, equipment and medium

By constructing the transmission network topology and service traffic matrix of the OTN network, establishing a multi-objective constraint optimization model, and generating an optical layer penetration channel scheme, the low-order resource bottleneck problem of the OTN network under low-bandwidth service carrying was solved, and the efficient utilization of network resources and stability improvement were achieved.

CN123123763APending Publication Date: 2026-11-17CHINA UNITED NETWORK COMM GRP CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611152460.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-07-31
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Existing OTN networks suffer from low-order resource bottlenecks when carrying low-bandwidth services, resulting in wasted network resources and insufficient carrying capacity. There is a lack of systematic and global high-order channel intelligent planning methods.

Method used

By acquiring basic data of network elements, basic data of transmission segments, and service requirements of the optical transport network, a transmission network topology and service traffic matrix are constructed, a multi-objective constraint optimization model is established, weighted path planning is performed, an optical layer penetration channel scheme is generated, and iterative optimization is carried out until the termination conditions are met, thereby realizing the overall allocation and dynamic adjustment of network resources.

Benefits of technology

It effectively alleviated the bottleneck of low-level resources, improved the overall service carrying capacity of the network, made full use of redundant resources on the line side, optimized the allocation of network resources, and improved the stability and carrying potential of the network.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123123763A_ABST
    Figure CN123123763A_ABST
Patent Text Reader

Abstract

This invention relates to a network channel planning method, apparatus, device, and medium. In this application, the basic data of network elements, basic data of transmission segments, and service requirements of an optical transport network are obtained. Based on the basic data of network elements, basic data of transmission segments, and service requirements, a transmission network topology and a service traffic matrix are constructed. Based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology, a multi-objective constrained optimization model is established. According to the objective function of the multi-objective constrained optimization model, weighted path planning is performed to obtain path costs. Based on the path costs, path allocation is performed for all services to obtain an initial service path scheme. Based on the node load distribution in the initial service path scheme, an optical layer penetration channel scheme is generated. The transmission network topology is updated according to the optical layer penetration channel scheme, and the steps of path allocation and optical layer penetration channel scheme generation are iteratively executed until a preset termination condition is met, resulting in a target network channel planning scheme.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of data transmission technology, and specifically to a network channel planning method, apparatus, device, and medium. Background Technology

[0002] Optical Transport Network (OTN), with its ultra-high bandwidth, high reliability, and flexible scheduling capabilities, has become a core technology for modern communication backbone transmission networks. With the comprehensive advancement of the domestic operators' Synchronous Digital Hierarchy (SDH) network decommissioning campaign, a large number of small-granularity Time Division Multiplexing (TDM) services (below 50 Mbps) are gradually being transferred to OTN networks. These services are characterized by their large number, small individual bandwidth, and long lifecycles. They account for over 70% of the total number of services in the transmission network, but their total traffic is less than 2% of the total network traffic, a stark contrast to the original design intent of OTN's "ultra-large pipeline, statistical multiplexing." The planning of high-order channels in OTN networks for low-bandwidth service scenarios aims to optimize and reconstruct network resources through the rational configuration and scheduling of high-order channels, alleviating low-order resource bottlenecks and enhancing the OTN network's capacity to carry low-bandwidth services. This is a key technology for ensuring a smooth transition during SDH decommissioning and the efficient and stable operation of the transmission network.

[0003] Currently, OTN networks carrying low-bandwidth services primarily employ traditional electrical layer cross-connect solutions. Each service requires optical-electrical-optical conversion at every node it passes through, consuming low-order cross-connect resources. To address the rapid depletion of these low-order resources, the industry mainly uses two technical approaches: one is to increase node low-order processing capacity through physical hardware expansion; the other is to adopt optical layer penetration strategies, utilizing redundant wavelength resources on the line side to construct penetration channels and reduce the occupation of low-order resources by passing services. Regarding high-order channel planning, existing solutions largely rely on the manual experience of engineers to formulate optical layer penetration strategies. Service path planning generally uses a single-objective algorithm based on the shortest path, lacking a targeted mechanism for generating and iteratively optimizing optical layer penetration channels.

[0004] However, the shortcomings of existing methods lie in the lack of a systematic and global high-order channel intelligent planning method. It is unable to take into account multiple key influencing factors such as network topology, node equipment capabilities, and service traffic distribution. This not only makes the planning results highly subjective and arbitrary, resulting in unnecessary waste of network resources, but also makes it difficult to achieve a balance between low-order resource occupation, node load balancing, and channel capacity loss. Ultimately, this leads to a serious resource mismatch problem in OTN networks, namely, rapid depletion of low-order cross-connect resources and a large amount of idle wavelength resources on the line side. This severely restricts the sustainable carrying capacity of OTN networks for a large number of low-bandwidth services.

[0005] Therefore, how to alleviate the bottleneck of low-level resources under low-bandwidth service carrying and improve the overall service carrying capacity of the network is an urgent problem to be solved. Summary of the Invention

[0006] The technical problem to be solved by this invention is how to alleviate the low-level resource bottleneck under low-bandwidth service carrying and improve the overall service carrying capacity of the network.

[0007] The technical solution of the present invention to solve the above-mentioned technical problems is as follows: This application provides a network channel planning method, including: Acquire basic data of network elements, basic data of transmission segments, and service requirements data of the optical transport network; Based on the network element basic data, the transmission segment basic data, and the service requirement data, construct the transmission network topology and service traffic matrix of the optical transport network; Based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology, a multi-objective constrained optimization model is established. Based on the objective function of the multi-objective constrained optimization model, weighted path planning is performed to obtain the path cost. Based on the path cost, path allocation is performed on all services to obtain the initial service path scheme. Based on the node load distribution in the initial service path scheme, an optical layer penetration channel scheme is generated. The transmission network topology is updated according to the optical layer penetration channel scheme, and the steps of path allocation and optical layer penetration channel scheme generation are iteratively executed until the preset termination condition is met, so as to obtain the target network channel planning scheme.

[0008] The beneficial effects of this invention are as follows: It acquires basic data of network elements, transmission segments, and service requirements of the optical transport network, comprehensively collecting relevant demand information on network equipment resources, link resources, and low-bandwidth services; it constructs a transmission network topology and service traffic matrix, unifying the modeling of discrete network element nodes, transmission links, and the entire network's service traffic, achieving a global quantitative representation of the resource and service distribution of the entire optical transport network. This overcomes the limitations of previous local planning relying solely on manual experience, enabling the overall coordination of various resources and services from a network-wide perspective; it then establishes a multi-objective constraint optimization model based on the node and edge attributes of the network topology and the service traffic matrix, overcoming the shortcomings of traditional shortest path planning's single evaluation dimension. This model comprehensively considers multiple indicators such as low-order resource occupancy, node load, and channel capacity loss, comprehensively constraining resource usage behavior and controlling unreasonable consumption of low-order resources from the source; subsequently, it performs weighted path planning and calculates path costs based on the objective function of the multi-objective constraint optimization model, thereby completing the service... The initial service path scheme is obtained through path allocation. This weighted routing method no longer simply pursues the shortest path, but incorporates key factors such as node load into the path cost accounting. During the service allocation stage, it actively guides services to bypass nodes with excessive low-order resource consumption, significantly reducing the crowding of low-order cross-link resources of nodes by passing services. This effectively suppresses the formation of low-order resource bottlenecks from the service routing stage. Finally, the optical layer penetration channel scheme is generated based on the node load distribution of the initial service path scheme, and the transmission network topology is updated simultaneously. The path allocation and penetration channel generation process is continuously iterated until the termination condition is met to obtain the final scheme. On the one hand, the optical layer penetration channel enables optical layer pass-through processing of services that originally required low-order electrical layer processing, directly relieving the low-order resource pressure of high-load nodes and making full use of redundant channel resources on the line side to make up for the problem of insufficient low-order resources. On the other hand, the network topology, service path and penetration channel configuration are continuously and dynamically adjusted through the iterative optimization mechanism to continuously optimize the overall network resource allocation and gradually reduce the overall low-order resource consumption level. The solution in this application can continuously release the potential of low-order resources without physical expansion of the equipment. It not only effectively alleviates the bottleneck problem of low-order resources that is common in scenarios of carrying massive low-bandwidth services, but also maximizes the carrying potential of the existing network and significantly improves the overall service carrying capacity of the optical transport network through a combination of global resource coordination, intelligent routing and dynamic iterative optimization.

[0009] Based on the above technical solution, the present invention can be further improved as follows.

[0010] Furthermore, the step of constructing the transmission network topology and service traffic matrix of the optical transport network based on the network element basic data, the transmission segment basic data, and the service requirement data includes: The hierarchical information and low-order cross-connect capacity information of each transmission network element are extracted from the network element basic data, and a node set of the transmission network topology is generated based on the hierarchical information and the low-order cross-connect capacity information, wherein each node of the node set corresponds to a transmission network element. The connection relationship and remaining channel capacity information between adjacent transmission network elements are extracted from the basic data of the transmission segment, and the edge set of the transmission network topology is generated based on the connection relationship and the remaining channel capacity information, wherein each edge of the edge set corresponds to a transmission segment. Based on the node set and the edge set, the transmission network topology is constructed; The number of services and the bandwidth of a single service between each pair of transmission network elements are counted from the service demand data. Based on the number of services and the bandwidth of a single service, the total service bandwidth between each pair of transmission network elements is determined, and the service traffic matrix is ​​generated based on the total service bandwidth.

[0011] The beneficial effects of adopting the above-mentioned further scheme are as follows: extracting the hierarchical information of network elements and generating node sets from the low-order cross-connect capacity not only clarifies the functional positioning of each network element in the network, but also accurately retains the low-order resource status of all network nodes. Then, relying on the link connection relationship and the remaining channel capacity to generate edge sets, the link layout and line-side channel resource situation of the entire network are fully restored. The transmission network topology constructed by combining node sets and edge sets highly restores the real physical architecture and resource distribution of the optical transport network, avoiding the problems of structural distortion and missing resource information when modeling the network. At the same time, by calculating the total service bandwidth and generating a service traffic matrix by statistically analyzing the number of services and the bandwidth of a single service, the traffic distribution and scale of small-bandwidth services in the entire network can be accurately quantified, allowing service requirements to be digitally presented.

[0012] Furthermore, before establishing the multi-objective constrained optimization model based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology, the following steps are also included: Based on the low-order cross-connect capacity information attached to each node in the transmission network topology, determine the total low-order cross-connect capacity of each node. Determine the actual low-level capacity usage value for each node based on the bandwidth requirements of all services allocated to the node; The low-order capacity occupancy ratio of a node is determined based on the total low-order cross capacity and the actual low-order capacity occupancy value. The piecewise nonlinear penalty function is determined based on the preset first engineering threshold and the second engineering threshold. The low-order capacity occupancy ratio of each node is substituted into the piecewise nonlinear penalty function for calculation to obtain the low-order load risk quantification value of the corresponding node. The low-order load risk quantification value of the corresponding node is used to construct the objective function of the multi-objective constrained optimization model.

[0013] The beneficial effects of adopting the above-mentioned further solutions are as follows: Based on the existing resource data of the nodes, the total low-order cross-connect capacity of network elements is calculated, clarifying the upper limit of low-order resources for each device. Then, by statistically analyzing the resource consumption of all services, the actual low-order capacity utilization value is obtained, accurately grasping the real-time consumption of low-order resources at each node. The low-order capacity utilization ratio calculated by combining these two methods can uniformly standardize and quantify the load level of each node across the entire network, solving the problem of not being able to horizontally compare the load of network elements with different hardware specifications. Based on on-site operation and maintenance experience, two-level engineering thresholds are set and a piecewise nonlinear penalty function is built. Gradient exponential calculation rules are set for the three load ranges of normal, risk, and high-risk. The higher the load pressure, the greater the corresponding penalty increase, which can accurately... By differentiating the risk levels of low-order resources of nodes, the shortcomings of linear calculations in highlighting the hidden dangers of high-risk nodes are overcome. The quantified value of low-order load risk obtained by substituting the occupancy ratio into the function is transformed into a numerical indicator that can be modeled and calculated, and applied to the objective function of the multi-objective constrained optimization model. This formally incorporates the low-order load risk of nodes into the overall optimization system, enabling subsequent path planning and optical layer penetration channel generation to proactively identify and avoid high-load nodes. It controls the consumption rate of low-order resources in advance from the data calculation level, effectively avoiding the problem of rapid depletion of low-order resources of a single node. In scenarios that carry massive low-bandwidth services, it further alleviates the bottleneck of low-order resources, and also provides reliable quantitative support for the optimization of load balancing of nodes across the entire network.

[0014] Furthermore, the establishment of a multi-objective constrained optimization model based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology includes: Obtain a first decision variable and a second decision variable. The first decision variable is used to indicate whether the node is located on the business path, and the second decision variable is used to indicate whether the path includes an optical layer penetration channel and whether the node is on the optical layer penetration channel. Based on the first decision variable and the second decision variable, the total low-order resource occupancy value of the entire network, the sum of the low-order load risk quantification values ​​of all nodes, and the total channel capacity loss value of the entire network are calculated respectively. The total channel capacity loss value is the total amount of channel resources additionally occupied due to the configuration of optical layer penetration channels. A multi-objective optimization function is obtained by assigning weight coefficients to the overall low-order resource occupancy value of the entire network, the sum of the low-order load risk quantification values ​​of all nodes, and the channel capacity loss value of the entire network. Minimize the multi-objective optimization function as the optimization objective, and set the constraint that the actual low-order capacity occupancy value of each node does not exceed the total low-order cross capacity. Based on the optimization objective and the constraints, the multi-objective constrained optimization model is generated.

[0015] The beneficial effects of adopting the above-mentioned further scheme are as follows: setting two types of binary decision variables accurately distinguishes the relationship between nodes and service paths as well as the transmission form of services, effectively distinguishing the resource consumption differences between electrical layer transmission and optical layer penetration transmission, making the calculation results of the three indicators of low-order resource occupation, node load risk, and channel capacity loss more accurate and objective; relying on the three core indicators and flexible weight coefficients to construct a multi-objective optimization function, it can adjust the optimization focus according to the actual network shortcomings, no longer considering a single resource indicator, and achieving coordinated optimization of low-order resources, node load, and line channels; taking the minimization of the multi-objective optimization function as the optimization direction, it continuously guides the network channel scheme to iterate towards a lower overall resource consumption direction, while with the hard constraint of not exceeding the limit of node low-order capacity, it builds a solid defense against low-order resource overflow from the model level.

[0016] Furthermore, the step of performing weighted path planning based on the objective function of the multi-objective constrained optimization model to obtain the path cost includes: For any pair of transmission network elements with service requirements, generate multiple candidate paths between the transmission network elements; For each candidate path, extract the low-order load risk quantification value of all nodes on the path, and sum the low-order load risk quantification values ​​to obtain the node load cost of the candidate path. Extract the accumulated value of the low-order capabilities required for services between transmission network elements, and use the accumulated value of the low-order capabilities as the service bandwidth cost of the candidate path. The service bandwidth cost is used to indicate the resource consumption of the service itself. The path cost is obtained by weighted summation of the node load cost and the service bandwidth cost.

[0017] The beneficial effects of adopting the above-mentioned further solutions are as follows: Multiple candidate paths are generated for network elements with service needs, overcoming the limitations of traditional planning that relies solely on the shortest path and enriching the path selection space; the node load cost is obtained by quantifying the low-order load risk of nodes along the path, accurately quantifying the overall node load risk of the entire path, allowing the routing process to proactively identify and avoid high-risk low-order resource routes; the overall low-order resource occupancy value of the service is set as the service bandwidth cost, accurately reflecting the resource consumption characteristics of the service itself and ensuring that cost accounting aligns with the actual network operation; finally, the comprehensive path cost is calculated by combining the two costs and used as the routing standard, so that when allocating paths, services no longer simply consider route length, but also take into account node load and service resource consumption, reducing the crowding of low-order resources of high-load nodes by passing services from the source of service routing, continuously suppressing the problem of low-order resources being rapidly exhausted, further alleviating the low-order resource bottleneck caused by massive low-bandwidth services, and making the distribution of service paths across the entire network more balanced, effectively improving the overall service carrying stability of the network.

[0018] Furthermore, the step of generating an optical layer penetration channel scheme based on the node load distribution in the initial service path scheme includes: Calculate the low-order capacity occupancy ratio of all nodes in the initial business path scheme, and filter out the target node set whose low-order capacity occupancy ratio exceeds the preset occupancy ratio threshold. Based on the target node set and the link connection relationship in the transmission network topology, multiple candidate optical layer penetration channels are generated. For each of the candidate optical layer penetration channels, obtain the decrease in the multi-objective optimization function after applying the candidate optical layer penetration channel to the initial service path scheme; The candidate optical layer penetration channel corresponding to the largest decrease is selected as the target optical layer penetration channel scheme, wherein the target optical layer penetration channel scheme is used to update the transmission network topology.

[0019] The beneficial effects of adopting the above-mentioned further scheme are as follows: By calculating the low-order capacity occupancy ratio of nodes and filtering the target node set according to the occupancy ratio threshold, the bottleneck nodes with high load of low-order resources in the network can be accurately located, so that the planning of optical layer penetration channels has a clear target and avoids the waste of channel resources caused by blindly configuring channels; multiple candidate optical layer penetration channels are generated based on existing links, making full use of the originally redundant channel resources on the line side, while enriching the channel selection range; by simulating deployment and calculating the reduction of the optimization function corresponding to each candidate channel, the optimal channel is selected based on the comprehensive optimization effect of low-order resource occupancy, node load, and channel loss, replacing the traditional method of selecting channels based on manual experience, which greatly improves the scientific nature of channel configuration; the final selected target optical layer penetration channel scheme synchronously updates the transmission network topology, which can convert services passing through high-load nodes to optical layer direct transmission, directly reducing the consumption of low-order electrical layer resources of nodes, effectively alleviating the low-order resource bottleneck caused by massive low-bandwidth services, and at the same time, achieving a balance between alleviating low-order load and controlling channel loss, continuously optimizing the resource allocation of the entire network, and further improving the overall service carrying capacity and operational stability of the network.

[0020] Furthermore, the steps of updating the transmission network topology according to the optical layer penetration channel scheme and iteratively executing path allocation and optical layer penetration channel scheme generation until a preset termination condition is met to obtain the target network channel planning scheme include: The target optical layer penetration channel scheme is applied to the transmission network topology to update the remaining low-order cross capacity of the corresponding node and the remaining channel capacity of the corresponding edge, so as to obtain the updated transmission network topology. Based on the updated transmission network topology, the steps of weighted path planning and path allocation are re-executed to obtain the updated service path scheme. Based on the updated service path scheme, a new target optical layer penetration channel scheme is determined; When the number of iterations reaches the preset maximum number of iterations, the iteration is terminated, and the new target optical layer penetration channel scheme is adopted as the target network channel planning scheme.

[0021] The beneficial effects of adopting the above-mentioned further solutions are as follows: By implementing the optical layer penetration channel and simultaneously updating the resource parameters of the transmission network topology, the actual resource availability of the network after the channel is activated can be accurately restored, providing accurate data support for subsequent path planning; relying on the updated topology, weighted path planning, service reallocation, and optical layer penetration channel selection are repeatedly carried out to form a closed-loop iterative optimization mechanism, continuously adjusting service routing and penetration channel configuration, gradually reducing the low-order resource occupancy level of the entire network, balancing the load of each node, and reasonably controlling the consumption of line channel resources, continuously optimizing the calculation results of the multi-objective optimization function; setting a termination condition for the maximum number of iterations can control the overall computation time and meet the requirement of quickly outputting the planning scheme.

[0022] This application embodiment also provides a network channel planning device, the device comprising: The data acquisition module is used to acquire basic network element data, basic transmission segment data, and service requirement data of the optical transport network. The topology and matrix construction module is used to construct the transmission network topology and service traffic matrix of the optical transport network based on the network element basic data, the transmission segment basic data and the service requirement data. The model building module is used to build a multi-objective constrained optimization model based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology. The path allocation module is used to perform weighted path planning based on the objective function of the multi-objective constrained optimization model to obtain the path cost, and to allocate paths to all services based on the path cost to obtain an initial service path scheme. The scheme iteration generation module is used to generate an optical layer penetration channel scheme based on the node load distribution in the initial service path scheme, update the transmission network topology according to the optical layer penetration channel scheme, and iteratively execute the steps of path allocation and optical layer penetration channel scheme generation until the preset termination condition is met to obtain the target network channel planning scheme.

[0023] This application also provides an electronic device, including a processor and a memory, wherein the memory stores a plurality of instructions; the processor loads instructions from the memory to execute steps in any of the network channel planning methods provided in this application.

[0024] This application also provides a computer-readable storage medium storing a plurality of instructions adapted for loading by a processor to execute steps in any of the network channel planning methods provided in this application. Attached Figure Description

[0025] Figure 1 A flowchart illustrating the network channel planning method provided in an embodiment of the present invention; Figure 2 This is a schematic diagram of the network channel planning device provided in an embodiment of the present invention; Figure 3 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention. Detailed Implementation

[0026] The principles and features of the present invention are described below. The examples given are only for explaining the present invention and are not intended to limit the scope of the present invention.

[0027] This application provides a network channel planning method, apparatus, electronic device, and medium.

[0028] Specifically, the network channel planning device can be integrated into an electronic device, such as a terminal or server. The terminal can be a mobile phone, tablet, smart Bluetooth device, laptop, or personal computer (PC); the server can be a single server or a server cluster consisting of multiple servers.

[0029] In some embodiments, the network channel planning device can also be integrated into multiple electronic devices, such as multiple servers, with multiple servers implementing the network channel planning method of this application.

[0030] In some embodiments, the terminal can also be used as a server to implement some or all of the functions of a server.

[0031] In the embodiments of this application, the terms "module" or "unit" can refer to a computer program or part of a computer program with a predetermined function, which works together with other related parts to achieve a predetermined goal, and can be implemented wholly or partially using software, hardware (such as processing circuitry or memory), or a combination thereof. Similarly, a processor (or multiple processors or memory) can be used to implement one or more modules or units. Furthermore, each module or unit can be part of an overall module or unit that includes the functions of that module or unit.

[0032] The following sections provide detailed descriptions of each example. It should be noted that the order of the following embodiments is not intended to limit the preferred order of the embodiments.

[0033] This embodiment provides a network channel planning method. See also Figure 1 , Figure 1 This is a flowchart illustrating the network channel planning method provided in an embodiment of the present invention, as shown below. Figure 1 As shown, the specific process of this network channel planning method can be as follows: 110. Obtain basic data of network elements, basic data of transmission segments, and service requirements data of the optical transport network; 120. Based on the network element basic data, the transmission segment basic data, and the service requirement data, construct the transmission network topology and service traffic matrix of the optical transport network; 130. Based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology, establish a multi-objective constrained optimization model; 140. Based on the objective function of the multi-objective constrained optimization model, perform weighted path planning to obtain the path cost, and based on the path cost, allocate paths to all services to obtain an initial service path scheme. 150. Based on the node load distribution in the initial service path scheme, generate an optical layer penetration channel scheme, update the transmission network topology according to the optical layer penetration channel scheme, and iteratively execute the steps of path allocation and optical layer penetration channel scheme generation until the preset termination condition is met, and obtain the target network channel planning scheme.

[0034] The optical transport network is a comprehensive transmission network built for high-capacity, multi-type telecommunications service transmission. Its network architecture consists of three layers: core, aggregation, and access, primarily carrying various communication services. This network includes numerous transmission network elements and interconnecting transmission links. The low-level electrical layer processing capabilities of these network elements are generally limited, accounting for only about five percent of the total equipment capacity, while the optical transmission channel resources on the line side often have significant redundancy.

[0035] Among them, network element basic data refers to the basic information corresponding to each transmission device in the optical transport network, which mainly includes the network layer to which the network element belongs, the total low-order cross-connect capacity of the device, the currently occupied low-order cross-connect capacity, and the remaining low-order cross-connect capacity.

[0036] Among them, the basic data of the transmission segment refers to the relevant information of the physical transmission link between two adjacent transmission network elements, mainly including the link connection relationship between network elements, the total number of channels of the entire transmission link, the number of channels already in use, and the remaining available channel capacity. Channels are the core resource for optical transmission on the line side, and this type of data is used to characterize the resource reserve status of the entire network link side.

[0037] The service demand data refers to the statistical information of all services to be carried across the entire network, including the total number of services between each group of interconnected network elements and the bandwidth of each service. In this embodiment, it mainly targets small-granularity time-division multiplexing services that are numerous, have small single-path bandwidth, and long operation cycles. Complete service demand data can accurately reflect the distribution of services and resource consumption requirements across the entire network.

[0038] The transmission network topology is a network architecture formed by combining nodes and links. Each transmission network element is defined as an independent node in the topology, and each transmission link between adjacent network elements is defined as an independent link in the topology. At the same time, the remaining low-order cross-connect capacity parameters are bound to each node, and the remaining channel capacity parameters are bound to each link, thus completely restoring the physical network structure and resource distribution of the optical transport network.

[0039] The service traffic matrix is ​​a symmetric matrix constructed based on the total number of network elements within the network. The rows and columns of the matrix correspond to different transmission network elements. The values ​​inside the matrix are used to count the total number and total bandwidth of uplink and downlink local services between any two network elements. The matrix does not record the traversing services of the nodes, and can intuitively quantify the traffic distribution of services across the entire network.

[0040] Among them, node attributes are the resource parameters attached to each network element node in the transmission network topology. The core parameter is the remaining low-order cross-connect capacity of the network element, which determines how many low-order, low-bandwidth services the node can still handle.

[0041] Among them, edge attributes are resource parameters attached to each transmission link in the transmission network topology. The core parameter is the remaining channel capacity of the transmission segment. The remaining channel capacity of the transmission segment represents the remaining resources that the current link can still use for optical layer transmission, and is used to determine the availability and loss of resources on the line side.

[0042] The multi-objective constrained optimization model is a mathematical operation model built by combining network resources and service distribution. The model takes the low-order resource occupancy of the entire network, the low-order load risk of nodes, and the link channel capacity loss as three major optimization directions, with corresponding operation rules and constraints. The model introduces a piecewise nonlinear penalty function to quantify the node load risk, and at the same time, it is clear that the actual low-order resource occupancy of all nodes must not exceed their total low-order cross-connect capacity, so as to achieve multi-dimensional resource management.

[0043] Among them, the objective function is the core calculation function of the multi-objective constrained optimization model. The objective function integrates three parts: the total low-order resource occupancy of the entire network, the total low-order load risk quantification value of all nodes, and the channel capacity loss value of the entire network. Weight coefficients are assigned to each of the three parts, and the entire function takes the minimization of the value as the overall optimization direction.

[0044] In the weighted path planning process, the low-order load risk of nodes and the resource consumption of the service itself are included in the path cost calculation. The overall cost of each optional path is calculated comprehensively, and the service route is selected based on the cost, so as to achieve path planning that takes into account both resource load and service transmission.

[0045] The path cost is the comprehensive overhead value corresponding to a single candidate transmission path. It is obtained by adding two parts: one part is the sum of the quantified values ​​of low-order load risk of all nodes on the path, and the other part is the sum of the low-order resources required by the service carried by the path. The path cost is the direct criterion for selecting the optimal transmission path.

[0046] The initial service path scheme is a set of service transmission paths formed after the first round of weighted path planning and network-wide service allocation. This scheme initially completes the path configuration for all services and avoids some low-order, high-load nodes. However, due to the limitations of the first round of single planning, there will still be some nodes in the network with high low-order resource loads.

[0047] Among them, node load distribution refers to the overall distribution of the low-order resource occupancy status of each transmission network element node in the entire network. It is mainly quantified by the low-order capacity occupancy ratio. The higher the occupancy ratio, the greater the low-order resource pressure on the node, and the easier it is to form a resource bottleneck.

[0048] Among them, the optical layer penetration channel is a direct transmission channel designed for high-load nodes with excessive low-order capacity occupancy. After this channel is enabled, the corresponding services will be transmitted in the link in the optical layer direct transmission manner, without going through the electrical layer low-order processing process of the corresponding node. This directly relieves the low-order resource pressure of the node and will give priority to the channel that can reduce the optimization function the most as the channel for formal use.

[0049] The preset termination condition is a rule for controlling the stopping of the iteration process. It includes two types of judgment situations: the first is that the value of the objective function calculated in this iteration is greater than the value of the function in the previous iteration; the second is that the total number of iterations reaches the preset maximum number of iterations. The iteration can be terminated if either of these conditions is met.

[0050] Among them, the target network channel planning scheme is the final network channel configuration scheme determined after the iterative process ends. This scheme has undergone multiple rounds of path adjustment and penetration channel optimization, achieving a balance between low-level resource occupation, node load balancing, and channel capacity loss. It is the optimal channel planning result that adapts to the current business and network resources.

[0051] For example, the specific methods for obtaining basic network element data, basic transmission segment data, and service requirement data of an optical transport network can be as follows: Staff collected basic data for each transmission network element, including its hierarchical affiliation, total low-order cross-connect capacity, used low-order capacity, and remaining low-order cross-connect capacity. They also compiled basic transmission segment data, such as the physical connection relationships between each pair of adjacent network elements, the total number of links, the number of used channels, and the remaining channel capacity. Simultaneously, they statistically analyzed the distribution locations, total number of services, and bandwidth requirements of all services awaiting activation across the entire network, with a focus on small-granularity time-division multiplexing services, which constituted the largest proportion. After collecting these three types of data, a comprehensive understanding of the network's equipment resources, link resources, and service requirements was achieved, providing reliable data support for subsequent modeling, calculations, and planning.

[0052] For example, the specific methods for constructing the transmission network topology and service traffic matrix of an optical transport network can be as follows: When constructing the transmission network topology, firstly, the hierarchical information and remaining low-order cross-connect capacity of all network elements are extracted from the basic network element data. Each network element is then set as a topology node, forming a complete node set. Next, the connection relationships between adjacent network elements and the remaining channel capacity are extracted from the basic transmission segment data. Each physical transmission link is then set as a topology link, forming a complete link set. The node set and link set are combined to form the complete transmission network topology, with each node and link within the topology bound to its corresponding resource attributes. When generating the service traffic matrix, the matrix row and column size is determined according to the total number of network elements in the entire network. A symmetrical matrix structure is constructed, and the total number of local services and total bandwidth between any two network elements are counted one by one. The statistical results are then filled into the corresponding positions in the matrix. The matrix only records the uplink and downlink local services of network elements and does not count transit services. Through this step, the physical network and service distribution are transformed into a computable digital model, eliminating the limitations of subjective human judgment.

[0053] For example, the specific way to establish a multi-objective constrained optimization model can be as follows: First, the low-order capacity occupancy ratio of each network element is calculated based on the topology node attributes. Two threshold intervals are then defined using practical engineering experience, and a piecewise nonlinear penalty function is constructed. This function quantifies the node load risk under different occupancy ratios, yielding a quantified low-order load risk value for each node. Next, two types of decision variables are set to determine whether a node is on a service path and whether the path is configured with an optical layer penetration channel and the node is located on that channel. Combining these two decision variables, the quantified node load risk value, and link attributes, the total low-order resource occupancy value of the entire network, the sum of the quantified load risk values ​​of all nodes, and the total channel capacity loss of the entire network are calculated sequentially. Weighting coefficients are then assigned to each of the three calculation results, forming a multi-objective optimization function. Minimizing this function value is set as the core optimization objective. Simultaneously, constraints are added, stipulating that the actual low-order resource occupancy of all network element nodes must not exceed their total low-order cross-connect capacity. Finally, the optimization objectives and constraints are integrated to form a complete multi-objective constrained optimization model, achieving synchronous control of low-order resources, node load, and channel loss.

[0054] For example, the specific method for obtaining the initial business path scheme can be as follows: First, weighted path planning rules are formulated based on the objective function of the multi-objective constrained optimization model. For each group of network elements with service interconnection needs, multiple candidate paths that can transmit normally between them are selected. For each candidate path, the low-order load risk quantification values ​​of all nodes within the path are extracted and summed to obtain the node load cost of the path. At the same time, the cumulative value of low-order resources consumed by the service carried by the path is calculated to obtain the service bandwidth cost. The two costs are added together to calculate the total path cost of a single path. According to the path cost ranking rule from low to high, a corresponding transmission path is matched for each service in the entire network to complete the path allocation of all services and finally generate the initial service path scheme. This routing method no longer simply pursues the length of the path, but prioritizes the path with lower overall cost and actively avoids nodes with high low-order load, reducing the ineffective consumption of low-order resources from the service allocation stage.

[0055] For example, the specific method for obtaining the target network channel planning scheme can be: First, the low-order capacity occupancy ratio of all nodes in the entire network under the initial service path scheme is statistically analyzed. High-load nodes with occupancy ratios exceeding a preset threshold are selected to form a target node set. Based on the link connections within the transmission network topology, multiple candidate optical layer penetration channels are generated for the target node set. The decrease in the multi-objective optimization function value after each candidate channel is put into use is calculated, and the candidate channel with the largest decrease is selected as the official optical layer penetration channel scheme. After this channel scheme is put into operation, the remaining low-order cross-connect capacity of the corresponding network element node and the remaining channel capacity of the corresponding transmission link are simultaneously modified to update the transmission network topology. Then, the process returns to the weighted path planning and service path allocation stage. The service path scheme is regenerated based on the updated network topology, the node load is recalculated, and a new optical layer penetration channel scheme is generated. This process is repeated. After each iteration, the objective function values ​​of the current round and the previous round are compared, and the cumulative iteration count is checked. When the function value of the current round is greater than the value of the previous round, or the number of iterations reaches the preset maximum, the iteration process is terminated. At this point, the entire channel configuration is the final target network channel planning scheme. The continuous iteration process can gradually alleviate the low-level load on nodes and balance the usage status of various resources across the entire network.

[0056] For example, the network channel planning method in this embodiment can be applied to a hierarchical optical transport network that includes 4 core network elements, 20 aggregation network elements, 100 access network elements, a total of 124 network element nodes, and 188 transmission links. This network mainly carries various small-granularity time-division multiplexing services below 50 Mbps. This planning requires configuring transmission channels for 3,000 low-bandwidth services in the network. First, staff collected basic network element data, including hierarchical information, total low-order cross-connect capacity, and remaining low-order cross-connect capacity, for all 124 network elements. They also collected basic transmission segment data, such as the connection relationships and remaining channel capacity of 188 transmission links. Simultaneously, they compiled service demand data, including the distribution location, single-link bandwidth, and number of services for 3000 services. Next, using all the collected data, a transmission network topology was constructed. The 124 network elements were divided into three types of topology nodes: core, aggregation, and access, and their respective remaining low-order cross-connect capacity parameters were bound. The 188 transmission links were used as topology links and bound to their remaining channel capacity parameters. Based on the distribution of the 3000 services, a corresponding service traffic matrix was generated, recording the total service volume and total bandwidth between every two network elements. Then, based on the node attributes, edge attributes, and service traffic matrix of the topology, the low-order capacity occupancy ratio of each node was calculated. A piecewise nonlinear penalty function was constructed using engineering thresholds to quantify node load risk. After setting two types of decision variables, the total low-order resource occupancy, the sum of node load risks, and channel loss values ​​were calculated separately. A complete multi-objective constrained optimization model is established after weighting coefficients. Then, weighted path planning is performed based on the model's objective function. For each group of network elements with service interconnection requirements, multiple candidate paths are selected. The node load cost and service bandwidth cost of each path are calculated and summed to obtain the path cost. Transmission paths are allocated to 3000 services one by one according to the path cost, forming an initial service path scheme. Next, the low-order capacity occupancy ratio of all nodes under this initial scheme is calculated, and high-load nodes with excessive low-order capacity occupancy ratios are selected. Multiple candidate optical layer penetration channels are generated based on network link connections. The decrease in the optimization function after each channel is activated is compared, and the optimal optical layer penetration channel scheme is selected. This scheme is used to modify the remaining low-order capacity of the corresponding nodes and the remaining channel capacity of the links, completing the network topology update. Weighted path planning and service allocation are performed again based on the updated topology, and penetration channel schemes are generated again. Iterative operations are continuously performed until the number of iterations reaches a set upper limit, at which point iteration stops, ultimately obtaining the target network channel planning scheme adapted to the 3000 low-bandwidth services.

[0057] As can be seen, in this embodiment, the basic data of network elements, basic data of transmission segments, and service requirements of the optical transport network are acquired, and relevant requirements information of network equipment resources, link resources, and low-bandwidth services are comprehensively collected. A transmission network topology and service traffic matrix are constructed, and discrete network element nodes, transmission links, and the entire network's service traffic are uniformly modeled to achieve a global quantitative representation of the resource and service distribution of the entire optical transport network. This overcomes the limitations of relying solely on manual experience for local planning and allows for the overall coordination of various resources and services from a network-wide perspective. Next, a multi-objective constraint optimization model is established by combining the node and edge attributes of the network topology with the service traffic matrix. This overcomes the shortcomings of the traditional shortest path planning evaluation dimension being singular, comprehensively considering multiple indicators such as low-order resource occupancy, node load, and channel capacity loss at the model level to comprehensively constrain resource usage behavior and control unreasonable consumption of low-order resources from the source. Subsequently, weighted path planning is carried out according to the objective function of the multi-objective constraint optimization model, and path costs are calculated. Based on this, the service is completed. The initial service path scheme is obtained through path allocation. This weighted routing method no longer simply pursues the shortest path, but incorporates key factors such as node load into the path cost accounting. During the service allocation stage, it actively guides services to bypass nodes with excessive low-order resource consumption, significantly reducing the crowding of low-order cross-link resources of nodes by passing services. This effectively suppresses the formation of low-order resource bottlenecks from the service routing stage. Finally, the optical layer penetration channel scheme is generated based on the node load distribution of the initial service path scheme, and the transmission network topology is updated simultaneously. The path allocation and penetration channel generation process is continuously iterated until the termination condition is met to obtain the final scheme. On the one hand, the optical layer penetration channel enables optical layer pass-through processing of services that originally required low-order electrical layer processing, directly relieving the low-order resource pressure of high-load nodes and making full use of redundant channel resources on the line side to make up for the problem of insufficient low-order resources. On the other hand, the network topology, service path and penetration channel configuration are continuously and dynamically adjusted through the iterative optimization mechanism to continuously optimize the overall network resource allocation and gradually reduce the overall low-order resource consumption level. The solution in this application can continuously release the potential of low-order resources without physical expansion of the equipment. It not only effectively alleviates the bottleneck problem of low-order resources that is common in scenarios of carrying massive low-bandwidth services, but also maximizes the carrying potential of the existing network and significantly improves the overall service carrying capacity of the optical transport network through a combination of global resource coordination, intelligent routing and dynamic iterative optimization.

[0058] Preferably, in the embodiment, constructing the transmission network topology and service traffic matrix of the optical transport network based on the network element basic data, the transmission segment basic data, and the service requirement data includes: The hierarchical information and low-order cross-connect capacity information of each transmission network element are extracted from the network element basic data, and a node set of the transmission network topology is generated based on the hierarchical information and the low-order cross-connect capacity information, wherein each node of the node set corresponds to a transmission network element. The connection relationship and remaining channel capacity information between adjacent transmission network elements are extracted from the basic data of the transmission segment, and the edge set of the transmission network topology is generated based on the connection relationship and the remaining channel capacity information, wherein each edge of the edge set corresponds to a transmission segment. Based on the node set and the edge set, the transmission network topology is constructed; The number of services and the bandwidth of a single service between each pair of transmission network elements are counted from the service demand data. Based on the number of services and the bandwidth of a single service, the total service bandwidth between each pair of transmission network elements is determined, and the service traffic matrix is ​​generated based on the total service bandwidth.

[0059] Layered information is used to identify the location of each transmission network element within the optical transport network's hierarchical architecture. The optical transport network is divided into three layers: core, aggregation, and access. Network elements at different layers undertake different transmission and cross-connection tasks. Core layer elements are responsible for relaying large volumes of data across the network; aggregation layer elements handle access layer services and aggregate them up to the core layer; and access layer elements directly connect to various terminal services with low bandwidth requirements. Layered information clearly records the specific layer to which each transmission network element belongs. This information distinguishes the functional positioning of different network elements within the network and reflects the service load characteristics of network elements at different layers. It is a crucial fundamental attribute for constructing a network topology that closely matches actual network architectures.

[0060] The node set is a collection of all topological nodes in the transmission network topology. Each topological node in the set corresponds one-to-one with an actual transmission network element in the optical transport network, with no omissions or duplications. Simultaneously, the node set carries two types of attributes extracted from the network element basic data: hierarchical information and low-order cross-connect capacity. It comprehensively records the identity hierarchy and low-order resource status of all network elements in the entire network, forming the basic unit set of the transmission network topology and determining the point composition of the digital topology model.

[0061] The edge set is a collection of all topological edges in the transmission network topology. Each topological edge in the set corresponds to an actual adjacent network element transmission segment within the optical transport network. Each topological edge is bound to two attributes extracted from the basic data of the transmission segment: the connection relationship between adjacent network elements and the remaining channel capacity. This fully records the connection method of the physical links in the entire network and the remaining optical transmission resources on the line side. As the connection carrier between topological nodes, it, together with the node set, builds a complete digital network architecture.

[0062] For example, the specific method for obtaining the node set of the transmission network topology can be: Taking all transmission network elements as the processing object, the basic data of each network element is read one by one, and two types of core information are filtered out: the network layer to which the network element belongs and the low-order cross-connect capacity currently available for the network element. For each actual transmission network element, a corresponding topology node is created, and the extracted layer information and low-order cross-connect capacity are bound to the topology node as inherent attributes. After completing the node creation and attribute mounting for all network elements, all topology nodes are integrated to form a node set covering all network elements, thus completely preserving the layer and low-order resource information of each network point.

[0063] For example, the edge set of the transmission network topology can be obtained in the following ways: The process iterates through the basic data of all physical transmission segments across the entire network, meticulously analyzing the two adjacent transmission network elements connected to each end of each transmission link, and simultaneously reading the remaining unused channel capacity of that link. A corresponding topology edge is created for each actual transmission segment, binding the link's network element connection relationships and remaining channel capacity as inherent attributes of the topology edge. After completing the creation and attribute configuration of topology edges for all transmission segments, all topology edges are aggregated and integrated to form a complete edge set, comprehensively recording the connection patterns and line-side resource reserves of the entire network.

[0064] For example, the specific way to construct a transmission network topology can be: The network architecture is constructed by using a set of nodes as the point foundation and a set of edges as the connecting links between these points. Based on the pairing relationships of adjacent network elements recorded in each topological edge of the edge set, the corresponding two topological nodes in the node set are found, and these two nodes are connected using the topological edge. The overall construction is completed following the actual physical cabling and hierarchical interconnection rules of optical transport networks. The resulting transmission network topology not only completely replicates the network structure of a real network but also assigns corresponding resources and hierarchical attributes to each node and each edge, thus transforming the physical network into a computable digital model.

[0065] For example, the specific method for obtaining the business traffic matrix can be: First, a comprehensive review of all business requirement data is conducted. Random pairs of transmission network elements are grouped together and statistically analyzed to determine the total number of services carried between each pair and the bandwidth of a single low-bandwidth service. The total service bandwidth between the two pairs is calculated by multiplying the number of services carried by each pair by its single-service bandwidth. The number of rows and columns of the matrix is ​​determined based on the total number of transmission network elements in the entire network. The rows and columns of the matrix sequentially correspond to each transmission network element. The total service bandwidth calculated for each pair of network elements is then filled into the corresponding positions in the matrix, ultimately forming a symmetrical service traffic matrix that visually represents the scale of service traffic between different network elements across the entire network in a digital format.

[0066] In this embodiment, the hierarchical information of network elements and the low-order cross-connect capacity are extracted to generate node sets. This clarifies the functional positioning of each network element in the network and accurately preserves the low-order resource status of all network nodes. Then, edge sets are generated based on link connection relationships and remaining channel capacity, which completely restores the link layout and line-side channel resource situation of the entire network. The transmission network topology constructed by combining node sets and edge sets highly restores the real physical architecture and resource distribution of the optical transport network, avoiding the problems of structural distortion and missing resource information during network modeling. At the same time, by calculating the total service bandwidth and generating a service traffic matrix by statistically analyzing the number of services and the bandwidth of a single service, the traffic distribution and scale of small-bandwidth services in the entire network can be accurately quantified, allowing service requirements to be digitally presented.

[0067] Preferably, in the embodiment, before establishing the multi-objective constrained optimization model based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology, the method further includes: Based on the low-order cross-connect capacity information attached to each node in the transmission network topology, determine the total low-order cross-connect capacity of each node. Determine the actual low-level capacity usage value for each node based on the bandwidth requirements of all services allocated to the node; The low-order capacity occupancy ratio of a node is determined based on the total low-order cross capacity and the actual low-order capacity occupancy value. The piecewise nonlinear penalty function is determined based on the preset first engineering threshold and the second engineering threshold. The low-order capacity occupancy ratio of each node is substituted into the piecewise nonlinear penalty function for calculation to obtain the low-order load risk quantification value of the corresponding node. The low-order load risk quantification value of the corresponding node is used to construct the objective function of the multi-objective constrained optimization model.

[0068] The total low-order cross-connect capacity is the maximum resource limit that the electrical layer hardware of the transmission network elements can carry for low-order, low-bandwidth services, and is an inherent performance parameter of the equipment. The overall scale of the low-order processing capability of network elements within the optical transport network is limited, and this capacity accounts for only a small proportion of the overall cross-connect capacity of the equipment. It is also the core resource indicator that is most likely to cause bottlenecks when the network carries a large number of low-bandwidth services, and it is also the calculation benchmark for judging whether node resources are overloaded.

[0069] The actual low-order capacity utilization value is the sum of low-order cross-connect resources currently consumed by various services on a single transmission network element. This includes both the resources consumed by local low-bandwidth services accessed and landed on this network element, and the low-order resources consumed by transit services forwarded through this network element. This value directly reflects the real-time consumption scale of low-order resources of a node and is the core data reflecting the current load status of the node.

[0070] The low-level capacity utilization ratio is a ratio obtained by dividing the actual low-level capacity utilization of a node by the total low-level cross-connect capacity. It can measure the saturation of low-level resources of different network elements using a unified standard. The larger the value of this ratio, the fewer low-level resources the network element has remaining, and the higher the probability of resource congestion and service failure.

[0071] The first engineering threshold is a load threshold set based on long-term field operation and maintenance experience of optical transport networks. In this embodiment, this threshold can be set to 40%. When the low-level capacity utilization ratio of a node does not exceed this value, it indicates that the low-level resources of the node are in a healthy usage range, the load pressure is within a controllable range, and it will not adversely affect service transmission.

[0072] The second engineering threshold is a load threshold set based on the actual network operating status. This threshold is higher than the first engineering threshold, and in this embodiment, it can be set to 80%. This threshold is used to delineate high-risk load intervals. Once the low-level capacity utilization ratio of a node exceeds this value, it means that the node's low-level resources are about to be exhausted, which will directly restrict the opening of new services and the stable transmission of existing services.

[0073] The piecewise nonlinear penalty function is a calculation function that divides the low-order capacity occupancy ratio into three intervals, using the first and second engineering thresholds as boundaries, and configuring different calculation rules for each interval. This function does not employ linear operation logic; its output value is zero in the normal resource usage interval; it increases exponentially after entering the risk interval; and it further increases the growth rate after entering the high-risk interval, thus differentiating the risk levels corresponding to different load conditions.

[0074] The low-order load risk quantification value is calculated by substituting the node's low-order capacity occupancy ratio into a piecewise nonlinear penalty function. This result transforms the abstract load risk of a node into a concrete numerical value that can participate in mathematical modeling and calculation. The value is positively correlated with the node's low-order load risk, and this indicator is directly applied to the objective function of the multi-objective constrained optimization model.

[0075] For example, the specific method for obtaining the total low-order cross capacity can be: The process iterates through each node in the transmission network topology, retrieves the low-order cross-connect capacity already mounted on the node, and combines this with the overall low-order cross-connect specifications specified by the equipment at the factory and the low-order resource data occupied during historical operation to perform a summary calculation, ultimately determining the total low-order cross-connect capacity of the network element. Calculations are then performed on a single node-by-node basis for all network elements to determine the maximum carrying capacity of low-order resources for each transmission device, establishing a unified benchmark parameter for calculating resource occupancy ratios.

[0076] For example, the specific method for obtaining the actual low-level capability usage value can be: This process involves analyzing all business items currently allocated to the corresponding node, calculating the low-level cross-resources consumed by each individual business, and covering both local business sent and received by this node and transit business relayed through this node. The low-level resource consumption corresponding to all businesses is then summed to obtain the node's current actual low-level capacity utilization, thus providing a complete real-time total consumption of the node's low-level resources.

[0077] For example, the specific method for obtaining the utilization rate of low-level capabilities can be: For each topology node, the calculated actual low-order capacity utilization value is divided by the total low-order cross-connect capacity corresponding to that node. The result is the low-order capacity utilization ratio of that node. This calculation method can eliminate the differences in the total capacity of different models and specifications of network elements, allowing for horizontal comparison of the resource usage status of all nodes in the entire network and achieving standardized assessment of load levels.

[0078] For example, the specific method for obtaining the piecewise nonlinear penalty function can be as follows: Using 40% as the first engineering threshold and 80% as the second engineering threshold, the low-order capacity occupancy ratio is divided into three intervals. When the occupancy ratio is less than or equal to the first engineering threshold, the function output is fixed at zero; when the occupancy ratio is between the first and second engineering thresholds, the function expression is written using the basic exponential operation rule; when the occupancy ratio is greater than or equal to the second engineering threshold, the function expression is written using the exponential operation rule with an amplification factor. Relying on the interval division and differentiated operation rules, a piecewise nonlinear penalty function is constructed to achieve hierarchical risk characterization of nodes with different load states.

[0079] For example, the specific method for obtaining the low-order load risk quantification value can be as follows: The low-order capacity occupancy ratios calculated for each node across the entire network are sequentially substituted into the constructed piecewise nonlinear penalty function for computation. Each node receives a unique calculation result, which is the quantified value of low-order load risk. The quantified risk values ​​of all nodes across the network are then aggregated and integrated, becoming a core component of the objective function of the multi-objective constrained optimization model. This makes the low-order load risk of nodes a core consideration in model optimization, guiding subsequent path planning and optical layer penetration channel generation.

[0080] In this embodiment, the total low-order cross-connect capacity of network elements is calculated based on the existing resource data of the nodes, clarifying the upper limit of low-order resources for each device. Then, the actual low-order capacity utilization is obtained by statistically analyzing the resource consumption of all services, accurately grasping the real-time consumption of low-order resources at each node. The low-order capacity utilization ratio calculated by combining these two methods can standardize and quantify the load level of all nodes across the entire network, solving the problem of not being able to horizontally compare the load of network elements with different hardware specifications. Based on on-site operation and maintenance experience, two-level engineering thresholds are set and a piecewise nonlinear penalty function is built. Gradient exponential calculation rules are set for three load ranges: normal, risky, and high-risk. The higher the load pressure, the greater the corresponding penalty increase, which can accurately distinguish the low-order capacity of nodes. The risk level of low-order resources compensates for the deficiency of linear calculation in highlighting the hidden dangers of high-risk nodes. The quantified value of low-order load risk obtained by substituting the occupancy ratio into the function is transformed into a numerical indicator that can be modeled and calculated, and applied to the objective function of the multi-objective constraint optimization model. This formally incorporates the low-order load risk of nodes into the overall optimization system, enabling subsequent path planning and optical layer penetration channel generation to proactively identify and avoid high-load nodes. It controls the consumption rate of low-order resources in advance from the data operation level, effectively avoiding the problem of rapid depletion of low-order resources of a single node. In scenarios that carry massive low-bandwidth services, it further alleviates the bottleneck of low-order resources, and also provides reliable quantitative support for the optimization of load balancing of nodes across the entire network.

[0081] Preferably, in the embodiment, establishing a multi-objective constrained optimization model based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology includes: Obtain a first decision variable and a second decision variable. The first decision variable is used to indicate whether the node is located on the business path, and the second decision variable is used to indicate whether the path includes an optical layer penetration channel and whether the node is on the optical layer penetration channel. Based on the first decision variable and the second decision variable, the total low-order resource occupancy value of the entire network, the sum of the low-order load risk quantification values ​​of all nodes, and the total channel capacity loss value of the entire network are calculated respectively. The total channel capacity loss value is the total amount of channel resources additionally occupied due to the configuration of optical layer penetration channels. A multi-objective optimization function is obtained by assigning weight coefficients to the overall low-order resource occupancy value of the entire network, the sum of the low-order load risk quantification values ​​of all nodes, and the channel capacity loss value of the entire network. Minimize the multi-objective optimization function as the optimization objective, and set the constraint that the actual low-order capacity occupancy value of each node does not exceed the total low-order cross capacity. Based on the optimization objective and the constraints, the multi-objective constrained optimization model is generated.

[0082] The first decision variable is a binary variable, possessing only two possible values. Its function is to determine whether a single network node belongs to a specific service's transmission path. One value is used when the node is within the transmission path of the corresponding service; the other value is used when the node is not on that service path. This variable can standardize the correspondence between all network nodes and each service path, serving as the fundamental basis for statistically analyzing the low-level resource usage of the entire network.

[0083] The second decision variable is a binary variable that needs to simultaneously determine two conditions: first, whether a certain service path has an optical layer penetration channel deployed; and second, whether the current node is on this optical layer penetration channel. The variable takes one value only when the service path includes an optical layer penetration channel and the node is located within that channel; otherwise, it takes the other value. Since service transmission via the optical layer penetration channel does not consume low-order cross-connect resources, this variable can distinguish the service transmission method, thereby accurately eliminating low-order resource consumption in optical layer pass-through scenarios.

[0084] The overall low-order resource occupancy value of the entire network is the sum of low-order cross-connect resource consumption generated by all nodes in the network for processing electrical layer services. This value is calculated by combining two types of decision variables and automatically deducts the low-order resource consumption avoided by optical layer penetration channels. It can truly reflect the actual scale of low-order resource usage of the entire network and is the core indicator for evaluating the low-order resource load of the entire network.

[0085] Among them, the total channel capacity loss value is the total amount of channel resources additionally occupied due to the configuration of optical layer penetration channels.

[0086] The weighting coefficients correspond to adjustment parameters for the overall low-order resource occupancy value of the entire network, the sum of the quantified low-order load risk values ​​of all nodes, and the overall channel capacity loss value of the entire network. These values ​​can be flexibly adjusted based on the current operational shortcomings of the network, thereby changing the proportion of the three indicators in the comprehensive calculation. If the pressure on low-order resources is significant, the coefficients of the low-order resource-related indicators are increased; if channel resources are scarce, the coefficients corresponding to channel loss are increased, allowing the optimization direction to adapt to different network scenarios.

[0087] The multi-objective optimization function is a comprehensive calculation function obtained by multiplying the three core indicators by their corresponding weight coefficients and then summing the results. This function integrates three types of optimization objectives: low-order resource utilization, node load risk, and channel capacity loss. The output value of the function can comprehensively evaluate the merits of the current channel planning scheme; the smaller the value, the more ideal the overall resource allocation effect of the entire network.

[0088] Among these constraints, the hard rules that must be followed during model calculation and scheme optimization are used. In this embodiment, the core constraint is that the actual low-order capacity usage of each node must not exceed its total low-order cross-connect capacity. This rule defines the upper limit of the use of low-order resources of nodes, preventing the problem of single-node low-order resource overload and service transmission obstruction from the root, and ensuring the stability of network infrastructure operation.

[0089] For example, the specific methods for obtaining the first and second decision variables can be as follows: In the initial stage of building a multi-objective constrained optimization model, the value rules and decision logic of two types of binary variables are clearly defined. All service paths and each topology node in the network are traversed, and the first decision variable is used to mark the dependency relationship between nodes and service paths one by one. Then, for each service path and the nodes on the path, the second decision variable is used to determine whether the path is configured with an optical layer penetration channel and whether the node is within that penetration channel. Through these two types of variables, a unified labeling of the states of all paths, nodes, and penetration channels in the entire network is achieved, providing a standardized basis for the calculation of subsequent resource indicators.

[0090] For example, the specific methods for obtaining the overall low-order resource occupancy value of the entire network, the sum of the low-order load risk quantification values ​​of all nodes, and the channel capacity loss value of the entire network can be as follows: Based on the labeling results of the two types of decision variables, itemized statistical calculations are performed. When calculating the overall low-order resource occupancy value of the entire network, the labeling results of whether a node is on a service path and whether it is in an optical layer penetration channel are considered. Low-order resource consumption corresponding to optical layer direct-access services is eliminated, and the resource occupancy brought by all electrical layer processing services is accumulated to obtain the overall low-order resource occupancy scale of the entire network. When calculating the sum of the low-order load risk quantification values ​​of all nodes, the low-order load risk quantification values ​​corresponding to each node in the entire network are accumulated one by one to reflect the overall node load risk level of the entire network. When calculating the channel capacity loss value of the entire network, the channel resources occupied by all services and optical layer penetration channels on each transmission link are statistically analyzed, and the total channel resource loss of the entire network is obtained after summing.

[0091] For example, the specific method for obtaining a multi-objective optimization function can be: Based on the actual network operation status and optimization focus, weight coefficients are assigned to each of the three calculated indicators. Each indicator is multiplied by its assigned weight coefficient, and the three results are then summed to form a multi-objective optimization function. The weight coefficients can be flexibly adjusted according to on-site operational needs, thereby changing the influence of different indicators in the overall evaluation and adapting the optimization function to different network load scenarios.

[0092] For example, the specific methods for obtaining the optimization objective and constraints can be as follows: By setting the continuous reduction of the calculation results of the multi-objective optimization function as the overall optimization goal, the channel planning scheme is guided to adjust towards lower overall network resource consumption and more balanced load. At the same time, hard constraint rules are set to continuously verify the actual low-order capacity occupancy value of each node in the entire process of model calculation, path planning, and channel configuration, ensuring that this value is always less than or equal to the total low-order cross capacity of the node, and avoiding the situation where the low-order resources of the node exceed the limit.

[0093] For example, the specific method for obtaining a multi-objective constrained optimization model can be: This model integrates two types of decision variables, three statistical indicators, a multi-objective optimization function, a core optimization objective, and hard constraint rules, summarizing all judgment logic, calculation rules, and restrictions into a complete mathematical model. This model integrates all functions such as resource statistics, risk assessment, objective optimization, and boundary constraints, enabling quantitative calculation, comparison, and selection of various channel planning schemes. It serves as the core computational carrier for subsequent weighted path planning and iterative optimization of optical layer penetration channels.

[0094] In this embodiment, two types of binary decision variables are set to accurately distinguish the relationship between nodes and service paths, as well as the transmission form of services. This effectively distinguishes the resource consumption differences between electrical layer transmission and optical layer penetration transmission, making the calculation results of the three indicators—low-order resource occupancy, node load risk, and channel capacity loss—more accurate and objective. A multi-objective optimization function is constructed based on the three core indicators and flexibly adjustable weight coefficients. This function can adjust the optimization focus according to the actual network shortcomings, rather than considering only one resource indicator, thus achieving coordinated optimization of low-order resources, node load, and line channels. Minimizing the multi-objective optimization function is used as the optimization direction to continuously guide the network channel scheme to iterate towards a lower overall resource consumption. At the same time, the hard constraint of not exceeding the limit of low-order capacity of nodes strengthens the defense against low-order resource overflow at the model level.

[0095] Preferably, in an embodiment, the step of performing weighted path planning based on the objective function of the multi-objective constraint optimization model to obtain the path cost includes: For any pair of transmission network elements with service requirements, generate multiple candidate paths between the transmission network elements; For each candidate path, extract the low-order load risk quantification value of all nodes on the path, and sum the low-order load risk quantification values ​​to obtain the node load cost of the candidate path. Extract the accumulated value of the low-order capabilities required for services between transmission network elements, and use the accumulated value of the low-order capabilities as the service bandwidth cost of the candidate path. The service bandwidth cost is used to indicate the resource consumption of the service itself. The path cost is obtained by weighted summation of the node load cost and the service bandwidth cost.

[0096] Candidate paths refer to all feasible transmission paths between a pair of transmission network elements with service interconnection needs, provided that the physical link is complete and capable of normally carrying low-bandwidth services within the transmission network topology. These paths are not limited to the single path with the shortest routing distance; they include multiple transmission lines with different routes and passing through different network element nodes. The load status of nodes and link resource conditions along different candidate paths vary significantly, making them the foundation for weighted path planning and cost comparison.

[0097] Among them, node load cost is a quantitative result of the overall node load risk of a single candidate path, calculated by summing the quantified values ​​of the low-order load risk of all topological nodes along the path. This value intuitively reflects the comprehensive load pressure of the nodes traversed by the entire transmission path. The higher the value, the greater the low-order resource risk of the nodes traversed by the path, and the more likely it is to exacerbate the low-order resource bottleneck problem.

[0098] Service bandwidth cost is the sum of low-order cross-link resources required for all services to be carried between a pair of interconnected transmission network elements. This value is determined by the number of services and the bandwidth of a single service, reflecting only the inherent resource consumption of the service itself. It does not change due to changes in the transmission path and is a fixed component of the overall path cost.

[0099] For example, the specific method for obtaining multiple candidate paths can be as follows: The process iterates through every combination of transmission network elements in the entire network that have low uplink and downlink bandwidth requirements. Based on the established transmission network topology, it retrieves all paths between the two groups of network elements that are connected and meet the service transmission conditions. The retrieval process does not select only the shortest route, but rather filters out all paths with transmission capabilities but different routes, forming multiple candidate paths.

[0100] For example, the specific method for obtaining the node load cost of a candidate path can be: Each candidate path is broken down and analyzed one by one, and each topological node along the path is identified in turn. The low-order load risk quantification value of each node obtained in the previous calculation is retrieved. The risk quantification values ​​of all nodes in the same path are accumulated and calculated to finally obtain the node load cost corresponding to this path.

[0101] For example, the specific methods for obtaining service bandwidth costs can be: The total scale of all services to be activated between the two interconnected network elements is calculated, and combined with the bandwidth parameters of individual services, the total low-order cross-connect resources required for all services to run are determined. This total resource consumption is only related to the attributes of the service itself and is independent of the transmission route. Therefore, it is uniformly set as the service bandwidth cost of all candidate paths under this network element group, objectively representing the basic resource consumption brought about by the service itself.

[0102] For example, the specific method for obtaining path cost can be: For a single candidate path, the calculated node load cost and service bandwidth cost are weighted and summed to obtain the path cost. The path cost incorporates both path node load risk and inherent service resource consumption, comprehensively measuring the overall quality of a transmission path.

[0103] In this embodiment, multiple candidate paths are generated for network elements with service requirements, overcoming the limitations of traditional planning that relies solely on the shortest path and enriching the path selection space. By accumulating the low-order load risk quantification value of the nodes along the path, the node load cost is obtained, which can accurately quantify the overall node load risk of the entire path. This allows the routing process to proactively identify and avoid high-risk low-order resource routes. The overall low-order resource occupancy value of the service is set as the service bandwidth cost, which accurately reflects the resource consumption characteristics of the service itself and ensures that cost accounting is consistent with the actual network operation. Finally, the comprehensive path cost is calculated by combining the two costs and used as the routing standard. This allows services to no longer simply consider route length when allocating paths, but to take into account both node load and service resource consumption. This reduces the crowding of low-order resources of high-load nodes by passing services from the source of service routing, continuously suppresses the problem of low-order resources being quickly exhausted, further alleviates the low-order resource bottleneck caused by massive low-bandwidth services, and makes the distribution of service paths across the entire network more balanced, effectively improving the overall service carrying stability of the network.

[0104] Preferably, in an embodiment, generating an optical layer penetration channel scheme based on the node load distribution in the initial service path scheme includes: Calculate the low-order capacity occupancy ratio of all nodes in the initial business path scheme, and filter out the target node set whose low-order capacity occupancy ratio exceeds the preset occupancy ratio threshold. Based on the target node set and the link connection relationship in the transmission network topology, multiple candidate optical layer penetration channels are generated. For each of the candidate optical layer penetration channels, obtain the decrease in the multi-objective optimization function after applying the candidate optical layer penetration channel to the initial service path scheme; The candidate optical layer penetration channel corresponding to the largest decrease is selected as the target optical layer penetration channel scheme, wherein the target optical layer penetration channel scheme is used to update the transmission network topology.

[0105] The preset occupancy ratio threshold is a numerical standard set based on long-term field operation and maintenance experience of optical transport networks. It serves as the boundary for distinguishing between normal and high load states of low-order resources of a node. When the low-order capacity occupancy ratio of a network element node exceeds this threshold, it indicates that the node's low-order cross-connect resources are already operating under high load. Continuing to carry through traffic or adding new traffic will quickly exhaust the remaining resources, requiring load relief through optical layer penetration channels.

[0106] The target node set is a collection of all topology nodes in the entire network whose low-level capacity occupancy ratio exceeds the occupancy ratio threshold. The nodes in the set are all low-level resource bottleneck nodes under the current business path scheme, and are also the key objects to be adapted and optimized when planning optical layer penetration channels. The design of all penetration channels will revolve around the nodes in this set.

[0107] Among them, candidate optical layer penetration channels are multiple feasible optical layer direct transmission paths planned for the target node set based on the existing physical link connections in the transmission network topology. These channels enable services passing through high-load nodes to be directly forwarded in optical layer form, without occupying the low-order cross-connect resources of the electrical layer. Different candidate channels have different routing directions, links they pass through, waveband resource consumption, and load relief effects.

[0108] The decrease in the optimization function is the difference between the multi-objective optimization function calculation results before and after a single candidate optical layer penetration channel is included in the current service path scheme. This value can quantify the comprehensive optimization effect of a penetration channel on the overall network's low-order resource utilization, node load risk, and channel capacity loss. The greater the decrease, the more prominent the optimization effect of the channel on the overall network resource allocation.

[0109] The target optical layer penetration channel scheme is the optimal configuration scheme selected from all candidate optical layer penetration channels, corresponding to the candidate channel with the largest decrease in optimization function. This scheme is the optical layer penetration configuration officially used in this iteration process, and it will directly affect the transmission network topology, completing the update of node and link resource parameters.

[0110] For example, the specific method for obtaining the target node set can be: Based on the initial service path scheme after the first round of allocation, the calculation is performed by traversing each node in the transmission network topology and calculating the low-order capacity occupancy ratio of each node according to the predetermined calculation logic. The occupancy ratio of each node is compared with the preset occupancy ratio threshold one by one, and all nodes whose occupancy ratio exceeds the threshold are grouped together to form the target node set.

[0111] For example, the specific method for generating multiple candidate optical layer penetration channels can be as follows: Using the completed target node set as the core planning object, the complete link connectivity in the transmission network topology is retrieved. Without altering the original physical architecture of the network, multiple optical layer direct-through paths with different routes are planned around high-load nodes. All paths are built based on existing transmission segments, enabling services to bypass the low-level electrical layer processing of high-load nodes. This generates multiple candidate optical layer penetration channels with consistent functions but different routes, providing a sufficient range of options for subsequent optimal selection.

[0112] For example, the specific method to obtain the decrease magnitude of the multi-objective optimization function can be: Simulated deployment calculations were performed sequentially for each candidate optical layer penetration channel. Assuming the current candidate channel was integrated into the existing service path scheme, the multi-objective optimization function value for the entire network was recalculated. The decrease in the optimization function value for that candidate channel was obtained by subtracting the original function value before deployment from the value after deployment. Through simulation, the overall optimization effect of each candidate channel was quantified, enabling an objective comparison of the effects between different channels.

[0113] For example, the specific method for obtaining the target optical layer penetration channel scheme can be as follows: By comparing the decrease in the optimization function corresponding to all candidate optical layer penetration channels, the candidate channel with the largest decrease value is selected and determined as the target optical layer penetration channel scheme for this round. After the target optical layer penetration channel scheme is determined, the remaining low-order cross-connect capacity of the corresponding node and the remaining channel capacity of the corresponding transmission link in the transmission network topology are modified according to the channel's routing and resource usage, completing the update of the network topology resource parameters and laying the foundation for the next round of path planning and iterative optimization.

[0114] In this embodiment, by calculating the low-order capability occupancy ratio of nodes and filtering the target node set according to the occupancy ratio threshold, the bottleneck nodes with high load on low-order resources in the network can be accurately located. This allows the planning of optical layer penetration channels to have a clear target and avoids the waste of channel resources caused by blindly configuring channels. Multiple candidate optical layer penetration channels are generated based on existing links, making full use of the originally redundant channel resources on the line side and enriching the channel selection range. By simulating deployment and measuring the reduction of the optimization function corresponding to each candidate channel, the optimal channel is selected based on the comprehensive optimization effect of low-order resource occupancy, node load, and channel loss. This replaces the traditional method of selecting channels based on manual experience and greatly improves the scientific nature of channel configuration. The final selected target optical layer penetration channel scheme synchronously updates the transmission network topology, which can convert services passing through high-load nodes to optical layer direct transmission, directly reducing the consumption of low-order electrical layer resources of nodes, effectively alleviating the low-order resource bottleneck caused by massive low-bandwidth services, and forming a balance between alleviating low-order load and controlling channel loss. This continuously optimizes the resource allocation of the entire network and further improves the overall service carrying capacity and operational stability of the network.

[0115] Preferably, in the embodiment, the steps of updating the transmission network topology according to the optical layer penetration channel scheme and iteratively executing path allocation and optical layer penetration channel scheme generation until a preset termination condition is met to obtain the target network channel planning scheme include: The target optical layer penetration channel scheme is applied to the transmission network topology to update the remaining low-order cross capacity of the corresponding node and the remaining channel capacity of the corresponding edge, so as to obtain the updated transmission network topology. Based on the updated transmission network topology, the steps of weighted path planning and path allocation are re-executed to obtain the updated service path scheme. Based on the updated service path scheme, a new target optical layer penetration channel scheme is determined; When the number of iterations reaches the preset maximum number of iterations, the iteration is terminated, and the new target optical layer penetration channel scheme is adopted as the target network channel planning scheme.

[0116] The updated transmission network topology is a new topology formed by implementing the target optical layer penetration channel scheme on the basis of the original transmission network topology. This topology does not change the inherent physical connection relationship between network element nodes and transmission links, but only synchronously refreshes the resource attribute parameters of nodes and links. Since services passing through the optical layer no longer occupy the low-order cross-connect resources of the corresponding nodes, the remaining low-order cross-connect capacity of the nodes will increase accordingly. However, the optical layer penetration channel will occupy the link channel resources, and the remaining channel capacity of the corresponding transmission edge will decrease accordingly, thus accurately reflecting the overall network resource status after the penetration channel is enabled.

[0117] The updated service path scheme is a set of service routes obtained after the transmission network topology has been refreshed based on resource parameters, and the weighted path planning and network-wide service allocation have been completed. The updated service path scheme will adjust the service direction based on the new round of node load and link remaining resources. Compared with the previous path scheme, it will further avoid nodes with high low-order loads, making the service routes more compatible with the current network resource distribution.

[0118] The preset maximum number of iterations is an upper limit for the number of iteration cycles set in advance based on the timeliness requirements of network planning. Optimizing the optical layer penetration channel is a combinatorial optimization operation. Setting this upper limit can prevent the iteration process from running indefinitely, control the overall operation time within a reasonable range, and ensure that the network channel planning scheme can be output quickly.

[0119] For example, the method for obtaining the updated transmission network topology can be as follows: Once the selected target optical layer penetration channel is officially activated, services that previously required low-order electrical layer processing through the channel's nodes will be converted to direct optical layer transmission, no longer consuming the low-order cross-connect resources of these nodes. Therefore, the remaining low-order cross-connect capacity of the corresponding nodes will be increased accordingly. Simultaneously, the optical layer penetration channel will occupy the channel resources of the corresponding transmission link, reducing the number of usable channels on the link, and consequently decreasing the remaining channel capacity of the corresponding transmission edge. The entire process only modifies the resource attributes of nodes and edges within the topology; the network physical structure and the connection relationships between nodes and links remain unchanged. After the parameters are refreshed, the updated transmission network topology is obtained.

[0120] For example, the method for obtaining the updated business path scheme can be as follows: Based on the updated transmission network topology with improved resource parameters, multiple candidate paths between each group of interconnecting network elements are re-searched. The node load cost and service bandwidth cost of each candidate path are then recalculated, and the path cost is summed. According to the path cost ranking rule from low to high, transmission routes are reallocated for all services across the network, completing a new round of service path arrangement. Since the network resource status has been optimized, this path allocation further optimizes service routing, ultimately generating an updated service path scheme adapted to the new network status.

[0121] For example, the specific method for obtaining a new target optical layer penetration channel scheme can be as follows: For the new service path scheme, all topology nodes across the entire network are traversed again, and the low-order capacity occupancy ratio is calculated. A new set of high-load nodes is selected by comparing the occupancy ratio threshold. Based on the link connection relationship of the transmission network topology, multiple candidate optical layer penetration channels are generated around the new set of high-load nodes. The optimization effect after the deployment of each candidate channel is simulated one by one, and the corresponding decrease in the multi-objective optimization function is calculated. The candidate channel with the largest decrease is selected and determined as the new target optical layer penetration channel scheme for this iteration.

[0122] For example, the specific method for obtaining the target network channel planning scheme can be: The cumulative number of iterations is counted, and the calculation stops when the number reaches a pre-set upper limit to ensure planning efficiency. The latest optical layer penetration channel combined with the entire network service path is the final target network channel planning scheme for implementation.

[0123] In this embodiment, by implementing the optical layer penetration channel and simultaneously updating the resource parameters of the transmission network topology, the actual resource availability of the network after the channel is activated can be accurately restored, providing accurate data support for subsequent path planning. Based on the updated topology, weighted path planning, service reallocation, and optical layer penetration channel selection are repeatedly carried out to form a closed-loop iterative optimization mechanism. This continuously adjusts service routing and penetration channel configuration, gradually reducing the overall network's low-order resource occupancy level, balancing the load of each node, and reasonably managing the consumption of line channel resources, continuously optimizing the calculation results of the multi-objective optimization function. Setting a maximum iteration termination condition can control the overall computation time and meet the requirement of quickly outputting the planning scheme.

[0124] To better implement the above methods, this application also provides a network channel planning device, which can be integrated into an electronic device, such as a server or terminal. The terminal may include a tablet computer, a laptop computer, and / or a personal computer.

[0125] For example, see Figure 2 , Figure 2 This is a schematic diagram of the network channel planning device provided in an embodiment of the present invention, as shown below. Figure 2 As shown, the network channel planning device may include a data acquisition module 201, a topology and matrix construction module 202, a model building module 203, a path allocation module 204, and a scheme iteration generation module 205, as follows: The data acquisition module 201 is used to acquire basic network element data, basic transmission segment data, and service requirement data of the optical transport network. The topology and matrix construction module 202 is used to construct the transmission network topology and service traffic matrix of the optical transport network based on the network element basic data, the transmission segment basic data and the service requirement data. The model building module 203 is used to build a multi-objective constrained optimization model based on the node attributes, edge attributes and service traffic matrix of the transmission network topology. The path allocation module 204 is used to perform weighted path planning according to the objective function of the multi-objective constrained optimization model to obtain the path cost, and to allocate paths to all services based on the path cost to obtain an initial service path scheme. The scheme iteration generation module 205 is used to generate an optical layer penetration channel scheme based on the node load distribution in the initial service path scheme, update the transmission network topology according to the optical layer penetration channel scheme, and iteratively execute the steps of path allocation and optical layer penetration channel scheme generation until the preset termination condition is met to obtain the target network channel planning scheme.

[0126] In practice, the above modules can be implemented as independent entities or combined in any way to be implemented as the same or several entities. For the specific implementation of the above modules, please refer to the previous method implementation examples, which will not be repeated here.

[0127] As can be seen from the above, this embodiment of the application acquires basic data of network elements, basic data of transmission segments, and service demand data of the optical transport network, comprehensively collecting relevant demand information of network equipment resources, link resources, and low-bandwidth services; constructs a transmission network topology and service traffic matrix, and uniformly models discrete network element nodes, transmission links, and the entire network service traffic, realizing a global quantitative representation of the resource distribution and service distribution of the entire optical transport network, breaking away from the limitations of relying solely on manual experience for local planning, and enabling the overall planning of various resources and services from a network-wide perspective; then, a multi-objective constraint optimization model is established by combining the node and edge attributes of the network topology and the service traffic matrix, overcoming the shortcomings of the single evaluation dimension of traditional shortest path planning, comprehensively considering multiple indicators such as low-order resource occupancy, node load, and channel capacity loss at the model level, comprehensively constraining resource usage behavior, and controlling the unreasonable consumption of low-order resources from the source; subsequently, weighted path planning is carried out based on the objective function of the multi-objective constraint optimization model and the path cost is calculated, and the service is completed based on this. The initial service path allocation scheme is obtained. This weighted routing method no longer simply pursues the shortest path, but incorporates key factors such as node load into the path cost accounting. During the service allocation stage, it actively guides services to bypass nodes with excessive low-order resource consumption, significantly reducing the crowding of low-order cross-link resources of nodes by passing services, and effectively suppressing the formation of low-order resource bottlenecks from the service routing stage. Finally, the optical layer penetration channel scheme is generated by combining the node load distribution of the initial service path scheme, and the transmission network topology is updated simultaneously. The process of path allocation and penetration channel generation is continuously iterated until the termination condition is met to obtain the final scheme. On the one hand, the optical layer penetration channel enables optical layer pass-through processing of services that originally required low-order electrical layer processing, directly relieving the low-order resource pressure of high-load nodes and making full use of redundant channel resources on the line side to make up for the problem of insufficient low-order resources. On the other hand, the network topology, service path and penetration channel configuration are continuously and dynamically adjusted by the iterative optimization mechanism to continuously optimize the overall network resource allocation and gradually reduce the overall low-order resource consumption level. The solution in this application can continuously release the potential of low-order resources without physical expansion of the equipment. It not only effectively alleviates the bottleneck problem of low-order resources that is common in scenarios of carrying massive low-bandwidth services, but also maximizes the carrying potential of the existing network and significantly improves the overall service carrying capacity of the optical transport network through a combination of global resource coordination, intelligent routing and dynamic iterative optimization.

[0128] In some embodiments, the network channel planning device of the present invention can be implemented in a combination of hardware and software. As an example, the network channel planning device of the present invention can be a processor in the form of a hardware decoding processor, which is programmed to execute the network channel planning method of the present invention. For example, the processor in the form of a hardware decoding processor can be one or more application-specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), complex programmable logic devices (CPLDs), field-programmable gate arrays (FPGAs), or other electronic components.

[0129] The modules described in the embodiments of this invention can be implemented in software or hardware. The names of the modules are not, in some cases, limiting the scope of the module itself.

[0130] An electronic device according to an embodiment of the present invention includes a processor and a memory, wherein the memory stores multiple instructions; the processor loads instructions from the memory to execute the steps in the network channel planning method described in any of the above embodiments. That is, an electronic device according to an embodiment of the present invention may include, but is not limited to: a processor and a memory; the memory is used to store a computer program; the processor is used to execute the network channel planning method shown in any embodiment of the present invention by calling the computer program.

[0131] In one alternative embodiment, an electronic device is provided, such as Figure 3 As shown, Figure 3 The illustrated electronic device 3000 includes a processor 3001 and a memory 3003. The processor 3001 and the memory 3003 are connected, for example, via a bus 3002. Optionally, the electronic device 3000 may further include a transceiver 3004, which can be used for data interaction between the electronic device and other electronic devices, such as sending and / or receiving data. It should be noted that in practical applications, the transceiver 3004 is not limited to one type, and the structure of the electronic device 3000 does not constitute a limitation on the embodiments of the present invention.

[0132] Processor 3001 may be a CPU (Central Processing Unit), a general-purpose processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this invention. Processor 3001 may also be a combination that implements computational functions, such as including one or more microprocessor combinations, a combination of a DSP and a microprocessor, etc.

[0133] Bus 3002 may include a path for transmitting information between the aforementioned components. Bus 3002 may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus, etc. Bus 3002 can be divided into address bus, data bus, control bus, etc. For ease of representation, Figure 3 The bus 3002 is represented by only one thick line, but this does not mean that there is only one bus or one type of bus.

[0134] The memory 3003 may be ROM (Read Only Memory) or other types of static storage devices capable of storing static information and instructions, RAM (Random Access Memory) or other types of dynamic storage devices capable of storing information and instructions, or EEPROM (Electrically Erasable Programmable Read Only Memory), CD-ROM (Compact Disc Read Only Memory) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but not limited thereto.

[0135] The memory 3003 stores application code (computer program) for executing the present invention, and its execution is controlled by the processor 3001. The processor 3001 executes the application code stored in the memory 3003 to implement the content shown in the foregoing method embodiments.

[0136] Among them, electronic devices can also be terminal devices, which can be any device that can install applications, including at least one of smartphones, tablets, laptops, desktop computers, smart speakers, smartwatches, smart TVs, and smart in-vehicle devices.

[0137] It should be noted that, Figure 3 The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of the embodiments of the present invention.

[0138] An embodiment of the present invention provides a computer-readable storage medium storing a plurality of instructions adapted for loading by a processor to execute the steps in any of the network channel planning methods described above.

[0139] Alternatively, the computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a compact disc read-only memory (CD-ROM), magnetic tape, a floppy disk, and an optical data storage device, etc.

[0140] In an exemplary embodiment, a computer program product or computer program is also provided, which includes computer instructions stored in a computer-readable storage medium. A processor of an electronic device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the electronic device to perform the steps in the network channel planning method described above.

[0141] Computer program code for performing the operations of this invention can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0142] It should be understood that the flowcharts and block diagrams in the accompanying drawings illustrate the implementable architecture, functions, and operations of methods and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code, which includes one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0143] The computer-readable storage medium provided in this invention can be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EEPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In this invention, a computer-readable storage medium can be any tangible medium that includes or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0144] The aforementioned computer-readable storage medium carries one or more programs, which, when executed by the electronic device, cause the electronic device to perform the method shown in the above embodiments.

[0145] The above description is merely a preferred embodiment of the present invention and an explanation of the technical principles employed. Those skilled in the art should understand that the scope of disclosure in this invention is not limited to technical solutions formed by specific combinations of the above-described technical features, but should also include other technical solutions formed by arbitrary combinations of the above-described technical features or their equivalents without departing from the above-disclosed concept. For example, technical solutions formed by substituting the above features with (but not limited to) technical features with similar functions disclosed in this invention.

[0146] It should be noted that the terms "first," "second," etc., used in the specification and claims of this application are used to distinguish similar objects and represent a limitation on a specific order or sequence. Where appropriate, the order of use for similar objects can be interchanged so that the embodiments of this application described herein can be implemented in an order other than that shown or described.

[0147] Those skilled in the art will recognize that this invention can be implemented as a system, method, or computer program product. Therefore, this invention can be specifically implemented in the following forms: it can be entirely hardware, entirely software (including firmware, resident software, microcode, etc.), or a combination of hardware and software, generally referred to herein as a "circuit," "module," or "system." Furthermore, in some embodiments, this invention can also be implemented as a computer program product in one or more computer-readable media, the computer-readable media including computer-readable program code.

[0148] Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention. Those skilled in the art can make changes, modifications, substitutions and variations to the above embodiments within the scope of the present invention.

Claims

1. A network channel planning method, characterized in that, include: Acquire basic data of network elements, basic data of transmission segments, and service requirements data of the optical transport network; Based on the network element basic data, the transmission segment basic data, and the service requirement data, construct the transmission network topology and service traffic matrix of the optical transport network; Based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology, a multi-objective constrained optimization model is established. Based on the objective function of the multi-objective constrained optimization model, weighted path planning is performed to obtain the path cost. Based on the path cost, path allocation is performed on all services to obtain the initial service path scheme. Based on the node load distribution in the initial service path scheme, an optical layer penetration channel scheme is generated. The transmission network topology is updated according to the optical layer penetration channel scheme, and the steps of path allocation and optical layer penetration channel scheme generation are iteratively executed until the preset termination condition is met, so as to obtain the target network channel planning scheme.

2. The network channel planning method according to claim 1, characterized in that, The step of constructing the transmission network topology and service traffic matrix of the optical transport network based on the network element basic data, the transmission segment basic data, and the service demand data includes: The hierarchical information and low-order cross-connect capacity information of each transmission network element are extracted from the network element basic data, and a node set of the transmission network topology is generated based on the hierarchical information and the low-order cross-connect capacity information, wherein each node of the node set corresponds to a transmission network element. The connection relationship and remaining channel capacity information between adjacent transmission network elements are extracted from the basic data of the transmission segment, and the edge set of the transmission network topology is generated based on the connection relationship and the remaining channel capacity information, wherein each edge of the edge set corresponds to a transmission segment. Based on the node set and the edge set, the transmission network topology is constructed; The number of services and the bandwidth of a single service between each pair of transmission network elements are counted from the service demand data. Based on the number of services and the bandwidth of a single service, the total service bandwidth between each pair of transmission network elements is determined, and the service traffic matrix is ​​generated based on the total service bandwidth.

3. The network channel planning method according to claim 1, characterized in that, Before establishing the multi-objective constrained optimization model based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology, the following steps are also included: Based on the low-order cross-connect capacity information attached to each node in the transmission network topology, determine the total low-order cross-connect capacity of each node. Determine the actual low-level capacity usage value for each node based on the bandwidth requirements of all services allocated to the node; Based on the total low-order cross capacity and the actual low-order capacity occupancy value, determine the low-order capacity occupancy ratio of each node; The piecewise nonlinear penalty function is determined based on the preset first engineering threshold and the second engineering threshold. The low-order capacity occupancy ratio of each node is substituted into the piecewise nonlinear penalty function for calculation to obtain the low-order load risk quantification value of the corresponding node. The low-order load risk quantification value of the corresponding node is used to construct the objective function of the multi-objective constrained optimization model.

4. The network channel planning method according to claim 3, characterized in that, The establishment of a multi-objective constrained optimization model based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology includes: Obtain a first decision variable and a second decision variable. The first decision variable is used to indicate whether the node is located on the business path, and the second decision variable is used to indicate whether the path includes an optical layer penetration channel and whether the node is on the optical layer penetration channel. Based on the first decision variable and the second decision variable, the total low-order resource occupancy value of the entire network, the sum of the low-order load risk quantification values ​​of all nodes, and the total channel capacity loss value of the entire network are calculated respectively. The total channel capacity loss value is the total amount of channel resources additionally occupied due to the configuration of optical layer penetration channels. A multi-objective optimization function is obtained by assigning weight coefficients to the overall low-order resource occupancy value of the entire network, the sum of the low-order load risk quantification values ​​of all nodes, and the channel capacity loss value of the entire network. Minimize the multi-objective optimization function as the optimization objective, and set the constraint that the actual low-order capacity occupancy value of each node does not exceed the total low-order cross capacity. Based on the optimization objective and the constraints, the multi-objective constrained optimization model is generated.

5. The network channel planning method according to claim 4, characterized in that, The step of performing weighted path planning based on the objective function of the multi-objective constrained optimization model to obtain the path cost includes: For any pair of transmission network elements with service requirements, generate multiple candidate paths between the transmission network elements; For each candidate path, extract the low-order load risk quantification value of all nodes on the path, and sum the low-order load risk quantification values ​​to obtain the node load cost of the candidate path. Extract the accumulated value of the low-order capabilities required for services between transmission network elements, and use the accumulated value of the low-order capabilities as the service bandwidth cost of the candidate path. The service bandwidth cost is used to indicate the resource consumption of the service itself. The path cost is obtained by weighted summation of the node load cost and the service bandwidth cost.

6. The network channel planning method according to claim 1, characterized in that, The step of generating an optical layer penetration channel scheme based on the node load distribution in the initial service path scheme includes: Calculate the low-order capacity occupancy ratio of all nodes in the initial business path scheme, and filter out the target node set whose low-order capacity occupancy ratio exceeds the preset occupancy ratio threshold. Based on the target node set and the link connection relationship in the transmission network topology, multiple candidate optical layer penetration channels are generated. For each of the candidate optical layer penetration channels, obtain the decrease in the multi-objective optimization function after applying the candidate optical layer penetration channel to the initial service path scheme; The candidate optical layer penetration channel corresponding to the largest decrease is selected as the target optical layer penetration channel scheme, wherein the target optical layer penetration channel scheme is used to update the transmission network topology.

7. The network channel planning method according to claim 6, characterized in that, The steps of updating the transmission network topology according to the optical layer penetration channel scheme and iteratively executing path allocation and optical layer penetration channel scheme generation until a preset termination condition is met to obtain the target network channel planning scheme include: The target optical layer penetration channel scheme is applied to the transmission network topology to update the remaining low-order cross capacity of the corresponding node and the remaining channel capacity of the corresponding edge, so as to obtain the updated transmission network topology. Based on the updated transmission network topology, the steps of weighted path planning and path allocation are re-executed to obtain the updated service path scheme. Based on the updated service path scheme, a new target optical layer penetration channel scheme is determined; When the number of iterations reaches the preset maximum number of iterations, the iteration is terminated, and the new target optical layer penetration channel scheme is adopted as the target network channel planning scheme.

8. A network channel planning device, characterized in that, include: The data acquisition module is used to acquire basic network element data, basic transmission segment data, and service requirement data of the optical transport network. The topology and matrix construction module is used to construct the transmission network topology and service traffic matrix of the optical transport network based on the network element basic data, the transmission segment basic data and the service requirement data. The model building module is used to build a multi-objective constrained optimization model based on the node attributes, edge attributes, and service traffic matrix of the transmission network topology. The path allocation module is used to perform weighted path planning based on the objective function of the multi-objective constrained optimization model to obtain the path cost, and to allocate paths to all services based on the path cost to obtain an initial service path scheme. The scheme iteration generation module is used to generate an optical layer penetration channel scheme based on the node load distribution in the initial service path scheme, update the transmission network topology according to the optical layer penetration channel scheme, and iteratively execute the steps of path allocation and optical layer penetration channel scheme generation until the preset termination condition is met to obtain the target network channel planning scheme.

9. An electronic device, characterized in that, It includes a processor and a memory, the memory storing multiple instructions; the processor loads instructions from the memory to perform the steps in the network channel planning method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a plurality of instructions adapted for loading by a processor to perform the steps of the network channel planning method according to any one of claims 1 to 7.