Method for path planning based on optical communication network

Abstract

The present application relates to the technical field of optical communication transmission, and discloses a path planning method based on an optical communication network, comprising the following steps: step one: connecting the optical communication network and an optical spectrum analyzer through a network, acquiring management data of a topology structure and signal monitoring data of all links, and classifying and forming a structure data set and a transmission data set, and real-time sensing a network state; step two: real-time analyzing link transmission bottlenecks of different topology structures, generating corresponding link bottleneck indexes, and efficiently positioning the link bottlenecks; step three: real-time analyzing the aggregable space of spectrum resources of the optical communication network, generating corresponding elasticity indexes, and directly reflecting the continuity and size of the available space of the spectrum resources; step four: setting bottleneck threshold values and elasticity threshold values with fixed numerical values, combining the link bottleneck indexes and the elasticity indexes, distinguishing transient shocks and persistent overloads, outputting corresponding path planning methods, and intelligently integrating high link utilization.

Description

Technical Field

[0001] This invention relates to the field of optical communication transmission technology, specifically to a path planning method based on optical communication networks. Background Technology

[0002] Optical communication networks, as an advanced data transmission technology, achieve efficient information transmission by leveraging the propagation of optical signals in optical fibers and cables. Using light waves as the carrier, it first converts electrical signals into optical signals, enabling long-distance, high-speed communication. An optical communication network mainly consists of an optical transmitter for signal transmission, an optical amplifier for signal strength enhancement, optical fiber infrastructure forming the transmission channel, an optical receiver for receiving terminal signals, and a series of related control and management devices. Compared to traditional communication methods, it offers higher bandwidth, faster transmission speeds, lower signal attenuation, and stronger resistance to electromagnetic interference. In terms of network architecture, optical communication networks have various layout types, commonly including star, ring, and tree topologies. Different topologies follow unique transmission logics, and their inherent bottleneck characteristics also differ significantly. In practical applications, optical communication networks often experience spectrum fragmentation. This phenomenon arises from dynamic service allocation strategies, wavelength routing selection mechanisms, and frequent bandwidth release and occupancy operations, causing the originally continuous optical spectrum resources to be divided into numerous discontinuous, scattered, and varying-sized idle blocks. This fragmentation severely limits the system's ability to handle continuous high-bandwidth demands. To address this issue, flexible grid technology needs to be introduced to dynamically adjust the spectral width used by each connection precisely based on real-time traffic demands. Simultaneously, complex defragmentation algorithms and virtualization slicing techniques are required to maintain reasonable system efficiency, but these measures inevitably and significantly increase the complexity of network management.

[0003] Currently, traditional optical communication network path planning methods often employ the shortest path first algorithm, which often ignores the bottleneck characteristics unique to different topologies and the requirement for spectrum continuity. In environments with spectrum fragmentation, the complexity of path planning increases exponentially with the number of nodes. Even if the total remaining bandwidth in the network is relatively abundant, the lack of sufficiently large continuous spectrum blocks may still lead to the inability to successfully access high-order modulation signals, resulting in low link utilization. Summary of the Invention

[0004] To address the shortcomings of existing technologies, this invention provides a path planning method based on optical communication networks, which has the advantages of efficient link bottleneck location and intelligent integration of high link utilization. It solves the problems of traditional optical communication network path planning methods neglecting the bottleneck characteristics unique to different topologies and the requirements for spectrum continuity, resulting in low link utilization.

[0005] To achieve the above objectives, the present invention provides the following technical solution: a path planning method based on optical communication networks, comprising the following steps:

[0006] Step 1: Connect the optical communication network and optical spectrum analyzer to obtain topology management data and signal monitoring data of all links, and classify them into structure datasets and transmission datasets;

[0007] Step 2: Based on the structure dataset and transmission dataset, analyze the link transmission bottlenecks of different topologies in real time and generate corresponding link bottleneck indices. ;

[0008] Step 3: Based on the transmission dataset, analyze the aggregateable space of optical communication network spectrum resources in real time and generate corresponding elasticity indices. ;

[0009] Step 4: Set a bottleneck threshold with a fixed value. and elasticity threshold Combined with the link bottleneck index and elasticity index It distinguishes between transient impacts and sustained overloads and outputs corresponding path planning methods.

[0010] Preferably, in step one, the structure dataset includes the layout type of the topology, node attributes, number of nodes, number of links, link bandwidth capacity, and total number of channels. The layout type includes star, ring, and tree topologies, and the node attributes include central nodes, edge nodes, base nodes, root nodes, and leaf nodes.

[0011] Preferably, in step one, the transmission dataset includes the transmission direction, instantaneous traffic, queue length, total number of separated spectrum blocks, and total width of the separated spectrum block interval for each link. The transmission direction includes central node to edge node, edge node to central node, clockwise, counterclockwise, root node to leaf node, and leaf node to root node. Separated spectrum blocks represent independent and discontinuous spectrum blocks.

[0012] Preferably, in step two, the link bottleneck index of the star topology is... The calculation process is as follows:

[0013] S11. Based on the structure dataset, extract the management data of the star topology and mark the central node of the star topology as... The total number of edge nodes in the star topology is marked as In a star topology, the total number of edge nodes is the same as the total number of links.

[0014] S12. Based on the transmission dataset, extract the signal monitoring data of all links in the star topology at the current time point, and mark the instantaneous traffic emitted by each edge node as... , will the central node The total outbound flow at the current time point is marked as ;

[0015] S13. Calculate the inflow-outflow ratio of the star topology at the current time point. ;

[0016] S14. Based on the structured dataset and the transmitted dataset, the central node... To edge nodes The link bandwidth capacity is marked as The current time point, the central node Send to edge nodes The instantaneous flow rate is marked as , The current time point, edge nodes Sent to the central node The instantaneous flow rate is marked as , Then, according to the transmission direction, calculate the current time point and the central node. With edge nodes Link utilization between ;

[0017] S15. Based on the structured dataset, the central node... To edge nodes The total number of link channels between them is marked as Then, according to the transmission direction, calculate the current time point and the central node. With edge nodes Channel utilization between ;

[0018] S16. Based on the transmitted dataset, the central node... To edge nodes The link queue length between them is marked as Based on S11-S15 and according to the transmission direction, the weighted formula is used to calculate the current time point in the star topology, where the central node... With edge nodes Link bottleneck index .

[0019] Preferably, in step two, the link bottleneck index of the ring topology is... The calculation process is as follows:

[0020] S21. Based on the structure dataset, extract the management data of the ring topology and mark the total number of basic nodes of the ring topology as... In a ring topology, the total number of basic nodes is the same as the total number of links.

[0021] S22. Based on the transmission dataset, extract the signal monitoring data of all links in the ring topology at the current time point, and mark the instantaneous traffic emitted by each basic node as... Furthermore, all basic nodes share links in the same transmission direction. Since all basic nodes are uniformly interconnected, there is a bidirectional communication requirement between every two basic nodes. , , , , ;

[0022] S23. Based on the structure dataset, label the bandwidth capacity of a single link in the ring topology as follows: Then, based on the transmission direction, calculate the link utilization rate of the ring topology at the current time point. ;

[0023] S24. Based on the transmission dataset, mark the cumulative clockwise total transmission traffic in the ring topology as follows: In the ring topology, the cumulative counter-clockwise transmission total traffic is marked as... Then calculate the symmetry ratio of the flow matrix of the ring topology at the current time point. ;

[0024] S25. Based on the transmission dataset, mark the link queue length of the ring topology at the current time point as... Then, based on S21-S24, the link bottleneck index of the ring topology is calculated at the current time using a weighted formula. .

[0025] Preferably, in step two, the link bottleneck index of the tree topology is... The calculation process is as follows:

[0026] S31. Based on the structure dataset, extract the management data of the tree topology and mark the total number of root nodes of the tree topology as... The total number of leaf nodes in the tree topology is marked as ;

[0027] S32. Based on the transmission dataset, extract the signal monitoring data of all links in the tree topology at the current time point, and mark the instantaneous traffic emitted by each root node as... The instantaneous flow emitted by each leaf node is marked as ;

[0028] S33. Based on the structure dataset, mark the link bandwidth capacity corresponding to a single root node as... Mark the link bandwidth capacity corresponding to a single leaf node as Then, based on the transmission direction, calculate the link utilization rate of the tree topology at the current time point. ;

[0029] S34. Calculate the convergence ratio of the tree topology at the current time point. ;

[0030] S35. Based on the transmission dataset, mark the link queue length in the tree topology as... Based on S31-S34, and according to the transmission direction, the weighted formula is used to calculate the bottleneck index of the tree topology at the current time point. .

[0031] Preferably, in step three, the elasticity index The calculation process is as follows:

[0032] Based on the transmitted dataset, extract the first... Signal monitoring data of each link, and the current time point in the optical communication network, the first The total number of separate spectrum blocks for each link is marked as At the current time point, in the optical communication network, the [number]th [unit / item] The total width of the separated spectrum block spacing of the link is marked as ;

[0033] Set a standard value to measure the total number of separated spectrum blocks. and the standard value used to measure the total width of the separated spectral block spacing Then, using a weighted formula, the elasticity index of the optical communication network at the current time point is calculated. .

[0034] Preferably, in step four, the link bottleneck index of the optical communication network... ≤ Bottleneck threshold And the elasticity index ≥ Elasticity threshold When the transmission status is stable, the current path should be maintained.

[0035] Preferably, in step four, the link bottleneck index of the optical communication network... > Bottleneck Threshold But the elasticity index ≥ Elasticity threshold When this occurs, it indicates that a transient impact has caused the transmission state to be unstable. In this case, flexible grid technology should be used to merge adjacent separated spectrum blocks and expand the channel width of adjacent links.

[0036] Preferably, in step four, the link bottleneck index of the optical communication network... > Bottleneck Threshold And the elasticity index <elastic threshold This indicates that persistent overload has led to unstable transmission. In such cases, multipath splitting measures should be implemented, and flexible grid technology should be used to merge adjacent separated spectrum blocks until the total width of the separated spectrum block spacing for each link is less than or equal to the standard value. .

[0037] Compared with existing technologies, this invention provides a path planning method based on optical communication networks, which has the following advantages:

[0038] 1. This invention connects an optical communication network and an optical spectrum analyzer to acquire topology management data and signal monitoring data for all links. These data are then categorized into structure datasets and transmission datasets. The network status is monitored in real time, and based on these datasets, transmission bottlenecks in different topologies are analyzed to generate corresponding bottleneck indices. It efficiently locates link bottlenecks and significantly improves the accuracy, real-time performance, and operability of optical communication network status diagnosis.

[0039] 2. This invention generates a corresponding elasticity index by analyzing the aggregateable space of optical communication network spectrum resources in real time. It directly reflects the continuity and size of available spectrum resources, and has a fixed bottleneck threshold. and elasticity threshold Combined with the link bottleneck index and elasticity index It distinguishes between transient impacts and sustained overloads, outputs corresponding path planning methods, realizes intelligent and adaptive optimization of optical communication network path planning, and ultimately achieves the effects of improving network stability, maximizing spectrum resource utilization, reducing latency, and distinguishing between transient bursts and long-term congestion. It also intelligently integrates links with high utilization. Attached Figure Description

[0040] Figure 1 This is a diagram illustrating the steps of the method of the present invention. Detailed Implementation

[0041] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0042] Example 1

[0043] Please see Figure 1 This invention provides a path planning method based on optical communication networks, comprising the following steps:

[0044] Step 1: Connect the optical communication network and optical spectrum analyzer to obtain topology management data and signal monitoring data of all links, and classify them into structure datasets and transmission datasets;

[0045] The structured dataset includes the layout type of the topology, node attributes, number of nodes, number of links, link bandwidth capacity, and total number of channels. The layout types include star, ring, and tree topologies, and the node attributes include central nodes, edge nodes, base nodes, root nodes, and leaf nodes.

[0046] The transmission dataset includes the transmission direction, instantaneous traffic, queue length, total number of split spectrum blocks, and total width of the split spectrum block interval for each link. The transmission direction includes central node to edge node, edge node to central node, clockwise, counterclockwise, root node to leaf node, and leaf node to root node.

[0047] Specifically, it comprehensively covers topologies of different layout types, enabling real-time perception of network status;

[0048] Step 2: Based on the structure dataset and transmission dataset, analyze the link transmission bottlenecks of different topologies in real time and generate corresponding link bottleneck indices. Accurately pinpoint the current network's transmission bottleneck links;

[0049] Step 3: Based on the transmission dataset, analyze the aggregateable space of optical communication network spectrum resources in real time and generate corresponding elasticity indices. This directly reflects the continuity and size of the available spectrum resources;

[0050] Step 4: Set a bottleneck threshold with a fixed value. and elasticity threshold Combined with the link bottleneck index and elasticity index It distinguishes between transient impacts and sustained overloads and outputs corresponding path planning methods.

[0051] Specifically, bottleneck threshold and elasticity threshold These are all derived from practical experience in optical communication networks. When the resilience of the optical communication network itself is poor, the corresponding bottleneck threshold... The elasticity threshold will be at a lower level if the link bandwidth capacity of the optical communication network is limited. It will also be on the lower side;

[0052] Link bottleneck index of optical communication network ≤ Bottleneck threshold And the elasticity index ≥ Elasticity threshold When the transmission status is stable, the current path should be maintained.

[0053] Link bottleneck index of optical communication network > Bottleneck Threshold But the elasticity index ≥ Elasticity threshold When a transient impact causes the transmission state to be unstable, flexible grid technology should be used to merge adjacent separated spectrum blocks and expand the channel width of adjacent links, thereby creating higher transmission capacity on the existing physical links to cope with sudden traffic and avoiding unnecessary path switching or physical expansion.

[0054] Link bottleneck index of optical communication network > Bottleneck Threshold And the elasticity index <elastic threshold This indicates that persistent overload has led to unstable transmission. In such cases, multipath splitting measures should be implemented, and flexible grid technology should be used to merge adjacent separated spectrum blocks until the total width of the separated spectrum block spacing for each link is less than or equal to the standard value. This not only alleviated the current congestion but also continuously optimized the availability of the spectrum pool, reserving space for future traffic growth.

[0055] In this embodiment, intelligent and adaptive optimization of optical communication network path planning is achieved through real-time data acquisition, intelligent status diagnosis, and hierarchical dynamic response. Ultimately, this improves network stability, maximizes spectrum resource utilization, reduces latency, and distinguishes between instantaneous bursts and long-term congestion.

[0056] Example 2

[0057] Please refer to Table 1 for experimental data on the star topology. This example is based on the explanation of Example 1. Specifically, the link bottleneck index of the star topology... The calculation process is as follows:

[0058] S11. Based on the structure dataset, extract the management data of the star topology and mark the central node of the star topology as... The total number of edge nodes in the star topology is marked as In a star topology, the total number of edge nodes is the same as the total number of chains.

[0059] S12. Based on the transmission dataset, extract the signal monitoring data of all links in the star topology at the current time point, and mark the instantaneous traffic emitted by each edge node as... , will the central node The total outbound flow at the current time point is marked as ;

[0060] S13. Calculate the inflow-outflow ratio of the star topology at the current time point. Its expression is as follows:

[0061]

[0062] In the formula, The central node represents the sum of instantaneous traffic emitted by all edge nodes. Total inbound traffic at the current time point;

[0063] Specifically, the ratio of inflow to outflow. The higher the value, the greater the amount of data that rushes into the central node at an instant, which is far greater than its output capacity. Data packets accumulate in the central node's buffer, increasing latency and significantly improving the packet loss rate.

[0064] S14. Calculate the current time point and the central node according to the transmission direction. With edge nodes Link utilization between Its expression is as follows:

[0065] If at the current time, the instantaneous traffic transmission direction is towards the central node. →Edge Node ,

[0066]

[0067] In the formula, Indicates the central node Send to edge nodes Instantaneous flow rate , Indicates the central node To edge nodes Link bandwidth capacity, Indicates the central node Send to edge nodes Link utilization at time ;

[0068] If at the current time point, the instantaneous traffic transmission direction is towards the edge nodes. →Central Node ,

[0069]

[0070] In the formula, Represents edge nodes Sent to the central node Instantaneous flow rate Represents edge nodes Sent to the central node Link utilization at time ;

[0071] S15. Based on the structured dataset, the central node... To edge nodes The total number of link channels between them is marked as Then, according to the transmission direction, calculate the current time point and the central node. With edge nodes Channel utilization between Its expression is as follows:

[0072] If at the current time, the instantaneous traffic transmission direction is towards the central node. →Edge Node ,

[0073]

[0074] In the formula, Indicates the central node Send to edge nodes Channel utilization at time ;

[0075] If at the current time point, the instantaneous traffic transmission direction is towards the edge nodes. →Central Node ,

[0076]

[0077] In the formula, Represents edge nodes Sent to the central node Channel utilization at time ;

[0078] Specifically, channel utilization This visually displays the average busy level of each channel. A ratio of 1 indicates that all channels are fully occupied; a ratio less than 1 indicates redundant capacity; and a ratio consistently close to or exceeding 1 may trigger congestion. When channel utilization... When the value remains consistently high, it indicates that the current link has become a performance bottleneck, and it is necessary to consider upgrading the bandwidth, increasing the number of channels, or introducing a traffic offloading mechanism.

[0079] S16. Based on the transmitted dataset, the central node... To edge nodes The link queue length between them is marked as Based on S11-S15 and according to the transmission direction, the weighted formula is used to calculate the current time point in the star topology, where the central node... With edge nodes Link bottleneck index Its expression is as follows:

[0080] If at the current time, the instantaneous traffic transmission direction is towards the central node. →Edge Node ,

[0081]

[0082] If at the current time point, the instantaneous traffic transmission direction is towards the edge nodes. →Central Node ,

[0083]

[0084] In the formula, This indicates the ratio of inflow to outflow. The weight, Indicates link utilization The weight, Indicates channel utilization The weight, Indicates the length of the link queue. The weight, , , and All are constants, and , Indicates according to , , and Weights are calculated based on the current time point and the central node. Send to edge nodes Star topology bottleneck index , Indicates according to , , and Weights are calculated to determine the edge nodes at the current time point. Sent to the central node Star topology bottleneck index .

[0085]

[0086] Table 1 Experimental data for star topology

[0087] Table 1 shows the experimental data for the star topology. Star topologies A, B, and C, each with a link bandwidth capacity of 100 Mbps and a total of 100 links, were selected as experimental subjects. At the current time point, the traffic transmission direction in star topologies A, B, and C is from the edge node to the central node. , , , , ;

[0088] Bottleneck threshold Setting it to 1, the link bottleneck index of star topology B and star topology C is determined. > Bottleneck Threshold This indicates that the transmission states of star topologies B and C are unstable and should be considered in conjunction with the elasticity index. The transmission paths of the optical communication network need to be redesigned.

[0089] In this embodiment, since the biggest bottleneck risk of the star topology lies in the imbalance between the processing capacity of the central node and the influx of traffic to the edge nodes, the inflow-to-outflow ratio is adjusted accordingly. and link utilization It accurately distinguishes between link congestion and core node overload, significantly improving the accuracy, real-time performance, and operability of optical communication network status diagnosis.

[0090] Example 3

[0091] Please refer to Table 2 for experimental data on the ring topology. This example is based on the explanation of Example 1. Specifically, the link bottleneck index of the ring topology... The calculation process is as follows:

[0092] S21. Based on the structure dataset, extract the management data of the ring topology and mark the total number of basic nodes of the ring topology as... In a ring topology, the total number of basic nodes is the same as the total number of chains.

[0093] S22. Based on the transmission dataset, extract the signal monitoring data of all links in the ring topology at the current time point, and mark the instantaneous traffic emitted by each basic node as... Furthermore, all basic nodes share links in the same transmission direction. Since all basic nodes are uniformly interconnected, there is a bidirectional communication requirement between every two basic nodes. , , , , ;

[0094] S23. Calculate the link utilization rate of the ring topology at the current time point. Its expression is as follows:

[0095]

[0096] In the formula, This represents the bandwidth capacity of a single link in a ring topology.

[0097] S24. Based on the transmission dataset, mark the cumulative clockwise total transmission traffic in the ring topology as follows: In the ring topology, the cumulative counter-clockwise transmission total traffic is marked as... Then calculate the symmetry ratio of the flow matrix of the ring topology at the current time point. Its expression is as follows:

[0098]

[0099] S25. Based on the transmission dataset, mark the link queue length of the ring topology at the current time point as... Then, based on S21-S24, the link bottleneck index of the ring topology is calculated at the current time using a weighted formula. Its expression is as follows:

[0100]

[0101] In the formula, Indicates link utilization The weight, Indicates a symmetric ratio for the flow matrix The weight, Indicates the length of the link queue. The weight, , and All are constants, and , Indicates according to , and The weights are used to calculate the bottleneck index of the ring topology at the current time. .

[0102]

[0103] Table 2 Experimental data for the ring topology structure

[0104] In Table 2, the experimental data for ring topologies show that ring topologies D, E, and F, each with a single link bandwidth capacity of 100Mbps, were selected as the experimental subjects. , , ;

[0105] Bottleneck threshold Setting it to 0.5, it was determined that the link bottleneck index of ring topology D and ring topology E is... > Bottleneck Threshold This indicates that the transmission states of ring topologies D and E are unstable and should be considered in conjunction with the elasticity index. The transmission paths of the optical communication network need to be redesigned.

[0106] In this embodiment, the unique traffic imbalance phenomenon and directional congestion characteristics in the ring network are accurately grasped, and the impact and traffic superposition effect of multi-hop communication between nodes are fully considered. From a global perspective, network bottlenecks can be quickly diagnosed and warned.

[0107] Example 4

[0108] Please refer to Table 3 for experimental data on the tree topology structure. This example is based on the explanation of Example 1. Specifically, the link bottleneck index of the tree topology structure... The calculation process is as follows:

[0109] S31. Based on the structure dataset, extract the management data of the tree topology and mark the total number of root nodes of the tree topology as... The total number of leaf nodes in the tree topology is marked as ;

[0110] S32. Based on the transmission dataset, extract the signal monitoring data of all links in the tree topology at the current time point, and mark the instantaneous traffic emitted by each root node as... The instantaneous flow emitted by each leaf node is marked as ;

[0111] S33. Calculate the link utilization rate of the tree topology at the current time point according to the transmission direction. Its expression is as follows:

[0112] If at the current time point, the instantaneous traffic transmission direction is root node → leaf node,

[0113]

[0114] In the formula, This represents the sum of instantaneous traffic from all root nodes to leaf nodes in the downlink. This represents the link bandwidth capacity corresponding to a single root node. This represents the total bandwidth capacity of the core layer of the tree topology. This represents the link utilization rate when data is sent from the root node to the leaf node. ;

[0115] If at the current time point, the instantaneous traffic transmission direction is leaf node → root node,

[0116]

[0117] In the formula, This represents the sum of instantaneous traffic from all leaf nodes to the root node in the uplink. This represents the link bandwidth capacity corresponding to a single leaf node. This represents the total bandwidth capacity of the access layer in a tree-structured topology. This represents the link utilization rate when a leaf node sends data to the root node. ;

[0118] S34. Calculate the convergence ratio of the tree topology at the current time point. Its expression is as follows:

[0119]

[0120] Specifically, convergence ratio A ratio greater than 1 indicates an overload risk; the higher the ratio, the greater the risk.

[0121] S35. Based on the transmission dataset, mark the link queue length in the tree topology as... Then, based on S31-S34, calculate the bottleneck index of the tree topology at the current time point. Its expression is as follows:

[0122] If at the current time point, the instantaneous traffic transmission direction is root node → leaf node,

[0123]

[0124] If at the current time point, the instantaneous traffic transmission direction is leaf node → root node,

[0125]

[0126] In the formula, Indicates link utilization The weight, Indicates the convergence ratio The weight, Indicates the length of the link queue. The weight, , and All are constants, and , Indicates according to , and The weights are used to calculate the bottleneck index of the tree topology link when the root node sends data to the leaf node at the current time. , Indicates according to , and The weights are used to calculate the bottleneck index of the tree topology link when the leaf node sends data to the root node at the current time. .

[0127]

[0128] Table 3 Experimental data for tree topology structure

[0129] Table 3 shows the experimental data for tree topologies. Tree topologies G, H, and I were selected as experimental subjects. Statistical analysis revealed that these three tree topologies all had a total of 3 root nodes, 8 leaf nodes, a link bandwidth capacity of 10 Mbps for a single root node, a link bandwidth capacity of 1 Mbps for a single leaf node, a total core layer bandwidth capacity of 30 Mbps, and a total access layer bandwidth capacity of 8 Mbps. , , ;

[0130] Bottleneck threshold Set to 1.5, the link bottleneck index of tree topology G and tree topology I is determined. > Bottleneck Threshold This indicates that the transmission states of tree topologies G and I are unstable, and should be considered in conjunction with the elasticity index. The transmission paths of the optical communication network need to be redesigned.

[0131] In this embodiment, the significant differences in uplink and downlink traffic patterns within a tree network are clearly distinguished. The unique hierarchical traffic aggregation characteristics and the asymmetric nature of uplink and downlink traffic are accurately grasped. By leveraging hierarchical aggregation-related indicators, intelligent diagnosis of bottlenecks in the backbone link can be performed, thereby providing a scientific and reasonable decision-making basis for subsequent multi-path traffic splitting and capacity upgrades in the tree network.

[0132] Example 5

[0133] Please refer to Table 4 for the experimental data on the elasticity index. This example is based on the explanation of Example 1. Specifically, the elasticity index... The calculation process is as follows:

[0134] Based on the transmitted dataset, extract the first... Signal monitoring data of each link, and the current time point in the optical communication network, the first The total number of separate spectrum blocks for each link is marked as At the current time point, in the optical communication network, the [number]th [unit / item] The total width of the separated spectrum block spacing of the link is marked as ;

[0135]

[0136] In the formula, This represents a standard value used to measure the total number of separated spectral blocks. The weights represent the ratio of the standard value to the total number of separated spectral blocks. This represents a standard value used to measure the total width of the spacing between separated spectral blocks. The weight representing the ratio of the standard value to the total width of the separated spectral block spacing. and All are constants, and , Indicates according to and The weights are used to calculate the elasticity index of the optical communication network at the current time point. Elasticity index The calculation formula applies to any link in star, ring, and tree topologies;

[0137] Specifically, the standard value used to measure the total number of separated spectral blocks and the standard value used to measure the total width of the separated spectral block spacing The settings are based on the resource distribution of the optical communication network topology. As the channel spectrum bandwidth increases, these two standard values ​​will also increase accordingly.

[0138]

[0139] Table 4. Experimental data on elasticity index

[0140] Table 4 shows the experimental data for the elasticity index. In the same topology, links 1, 2, and 3 were selected as experimental subjects to measure the standard value for the total number of separated spectrum blocks. Standard value used to measure the total width of the separated spectral block spacing , , ;

[0141] Elastic threshold The value was set to 1.3, which, based on the assessment, indicates the link bottleneck index of the optical communication network. > Bottleneck Threshold Under these circumstances, the elasticity index of link 1 <elastic threshold This indicates that continuous overload has caused unstable transmission status of Link 1. Multipath splitting measures should be implemented, and flexible grid technology should be used to merge adjacent separated spectrum blocks until the total width of the separated spectrum block spacing for each link is ≤ the standard value. ;

[0142] Link bottleneck index of optical communication network > Bottleneck Threshold Under these circumstances, the elasticity index of link 2 =Elastic threshold The elasticity index of link 3 > Elastic threshold This indicates that the transmission status of Link 2 and Link 3 is unstable due to transient impacts. Flexible grid technology should be used to merge adjacent separated spectrum blocks and expand the channel width of adjacent links.

[0143] In this embodiment, the degree of fragmentation of idle spectrum is reflected by the total number of separated spectrum blocks, and the dispersion between fragments is measured by the total width of the interval between separated spectrum blocks. The fragmentation status of each link is monitored in real time, and the elasticity index is compared horizontally across links and time periods. This allows for precise identification of bottleneck links, providing a key basis for automated operation and maintenance, and powerfully promoting the continuous development of optical networks towards high elasticity and self-optimization.

[0144] The threshold is set to facilitate comparison. The size of the threshold depends on the amount of sample data and the number of bases set by those skilled in the art for each set of sample data; as long as it does not affect the ratio between the parameter and the quantized value, it is acceptable.

[0145] The above formulas are all derived from software simulation using a large amount of data and are selected to be close to the actual values. The coefficients in the formulas are set by those skilled in the art according to the actual situation. The above description is only a preferred embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any equivalent substitutions or changes made by those skilled in the art within the technical scope disclosed in the present invention, based on the technical solution and inventive concept of the present invention, should be covered within the protection scope of the present invention.

Claims

1. A path planning method based on optical communication networks, characterized in that, Includes the following steps: Step 1: Connect the optical communication network and optical spectrum analyzer to obtain topology management data and signal monitoring data of all links, and classify them into structure datasets and transmission datasets; Step 2: Based on the structure dataset and transmission dataset, analyze the link transmission bottlenecks of different topologies in real time and generate corresponding link bottleneck indices. ; Step 3: Based on the transmission dataset, analyze the aggregateable space of optical communication network spectrum resources in real time and generate corresponding elasticity indices. ; Step 4: Set a bottleneck threshold with a fixed value. and elasticity threshold Combined with the link bottleneck index and elasticity index It distinguishes between transient impacts and sustained overloads and outputs corresponding path planning methods.

2. The path planning method based on optical communication networks according to claim 1, characterized in that: In step one, the structure dataset includes the layout type of the topology, node attributes, number of nodes, number of links, link bandwidth capacity, and total number of channels. The layout type includes star, ring, and tree topologies, and the node attributes include central nodes, edge nodes, base nodes, root nodes, and leaf nodes.

3. The path planning method based on optical communication networks according to claim 2, characterized in that: In step one, the transmission dataset includes the transmission direction, instantaneous traffic, queue length, total number of separated spectrum blocks, and total width of the separated spectrum block interval for each link. The transmission direction includes central node to edge node, edge node to central node, clockwise, counterclockwise, root node to leaf node, and leaf node to root node. Separated spectrum blocks represent independent and discontinuous spectrum blocks.

4. The path planning method based on optical communication networks according to claim 3, characterized in that: In step two, the link bottleneck index of the star topology is... The calculation process is as follows: S11. Based on the structure dataset, extract the management data of the star topology and mark the central node of the star topology as... The total number of edge nodes in the star topology is marked as In a star topology, the total number of edge nodes is the same as the total number of links. S12. Based on the transmission dataset, extract the signal monitoring data of all links in the star topology at the current time point, and mark the instantaneous traffic emitted by each edge node as... , will the central node The total outbound flow at the current time point is marked as ; S13. Calculate the inflow-outflow ratio of the star topology at the current time point. ; S14. Based on the structured dataset and the transmitted dataset, the central node... To edge nodes The link bandwidth capacity is marked as The current time point, the central node Send to edge nodes The instantaneous flow rate is marked as , The current time point, edge nodes Sent to the central node The instantaneous flow rate is marked as , Then, according to the transmission direction, calculate the current time point and the central node. With edge nodes Link utilization between ; S15. Based on the structured dataset, the central node... To edge nodes The total number of link channels between them is marked as Then, according to the transmission direction, calculate the current time point and the central node. With edge nodes Channel utilization between ; S16. Based on the transmitted dataset, the central node... To edge nodes The link queue length between them is marked as Based on S11-S15 and according to the transmission direction, the weighted formula is used to calculate the current time point in the star topology, where the central node... With edge nodes Link bottleneck index .

5. The path planning method based on optical communication networks according to claim 4, characterized in that: In step two, the link bottleneck index of the ring topology is... The calculation process is as follows: S21. Based on the structure dataset, extract the management data of the ring topology and mark the total number of basic nodes of the ring topology as... In a ring topology, the total number of basic nodes is the same as the total number of links. S22. Based on the transmission dataset, extract the signal monitoring data of all links in the ring topology at the current time point, and mark the instantaneous traffic emitted by each basic node as... Furthermore, all basic nodes share links in the same transmission direction. Since all basic nodes are uniformly interconnected, there is a bidirectional communication requirement between every two basic nodes. , , , , ; S23. Based on the structure dataset, label the bandwidth capacity of a single link in the ring topology as follows: Then, based on the transmission direction, calculate the link utilization rate of the ring topology at the current time point. ; S24. Based on the transmission dataset, mark the cumulative clockwise total transmission traffic in the ring topology as follows: In the ring topology, the cumulative counter-clockwise transmission total traffic is marked as... Then calculate the symmetry ratio of the flow matrix of the ring topology at the current time point. ; S25. Based on the transmission dataset, mark the link queue length of the ring topology at the current time point as... Then, based on S21-S24, the link bottleneck index of the ring topology is calculated at the current time using a weighted formula. .

6. The path planning method based on optical communication networks according to claim 5, characterized in that: In step two, the link bottleneck index of the tree topology is... The calculation process is as follows: S31. Based on the structure dataset, extract the management data of the tree topology and mark the total number of root nodes of the tree topology as... The total number of leaf nodes in the tree topology is marked as ; S32. Based on the transmission dataset, extract the signal monitoring data of all links in the tree topology at the current time point, and mark the instantaneous traffic emitted by each root node as... The instantaneous flow emitted by each leaf node is marked as ; S33. Based on the structure dataset, mark the link bandwidth capacity corresponding to a single root node as... Mark the link bandwidth capacity corresponding to a single leaf node as Then, based on the transmission direction, calculate the link utilization rate of the tree topology at the current time point. ; S34. Calculate the convergence ratio of the tree topology at the current time point. ; S35. Based on the transmission dataset, mark the link queue length in the tree topology as... Based on S31-S34, and according to the transmission direction, the weighted formula is used to calculate the bottleneck index of the tree topology at the current time point. .

7. The path planning method based on optical communication networks according to claim 6, characterized in that: In step three, the elasticity index The calculation process is as follows: Based on the transmitted dataset, extract the first... Signal monitoring data of each link, and the current time point in the optical communication network, the first The total number of separate spectrum blocks for each link is marked as At the current time point, in the optical communication network, the [number]th [unit / item] The total width of the separated spectrum block spacing of the link is marked as ; Set a standard value to measure the total number of separated spectrum blocks. and the standard value used to measure the total width of the separated spectral block spacing Then, using a weighted formula, the elasticity index of the optical communication network at the current time point is calculated. .

8. The path planning method based on optical communication networks according to claim 7, characterized in that: Step four, the link bottleneck index of the optical communication network. ≤ Bottleneck Threshold And the elasticity index ≥ Elasticity threshold When the transmission status is stable, the current path should be maintained.

9. The path planning method based on optical communication networks according to claim 8, characterized in that: Step four, the link bottleneck index of the optical communication network. > Bottleneck Threshold But the elasticity index ≥ Elasticity threshold When this occurs, it indicates that a transient impact has caused the transmission state to be unstable. In this case, flexible grid technology should be used to merge adjacent separated spectrum blocks and expand the channel width of adjacent links.

10. The path planning method based on optical communication networks according to claim 9, characterized in that: Step four, the link bottleneck index of the optical communication network. > Bottleneck Threshold And the elasticity index <elastic threshold This indicates that persistent overload has led to unstable transmission. In such cases, multipath splitting measures should be implemented, and flexible grid technology should be used to merge adjacent separated spectrum blocks until the total width of the separated spectrum block spacing for each link is less than or equal to the standard value. .

Images