Route planning method and device of optical fiber communication network, electronic equipment and medium

Abstract

The invention provides a route planning method and device for an optical fiber communication network, electronic equipment and a medium. The method comprises the following steps: acquiring a route request of the optical fiber communication network; analyzing the routing request, and determining a source node, a target node and a path constraint condition; the method comprises the following steps: under a path constraint condition, carrying out path search simultaneously from a source node and a target node by adopting a bidirectional search strategy based on a pre-constructed multi-level resource topological graph, recording searched nodes by adopting an adaptive Bloom filter, carrying out priority ranking on nodes to be searched, and searching the nodes to be searched according to a priority ranking result, an optimal path planning scheme is obtained; wherein the multi-level resource topological graph comprises a multi-level grid structure, and the multi-level resource topological graph takes a plurality of physical resources of the optical fiber communication network as nodes and takes an incidence relation among the plurality of physical resources as edges. According to the method, the efficiency and the accuracy of route planning are improved by performing bidirectional search on the multi-level resource topological graph.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a routing planning method, apparatus, electronic device, and medium for optical fiber communication networks. Background Technology

[0002] With the rapid development of information technologies such as cloud computing, big data, and the Internet of Things, the scale of modern communication networks has expanded dramatically, and network topologies have become increasingly complex. As the physical carrier of information transmission, the efficient and reliable routing planning of optical communication paths has become a core element in ensuring network service quality and resource utilization.

[0003] However, existing routing planning techniques still face many serious challenges in practical applications. The traditional Dijkstra algorithm has high computational complexity in large networks, making it difficult to meet the real-time requirements of route path search; although A... While the algorithm improves search efficiency to some extent by introducing heuristic functions, its performance still degrades significantly in ultra-large-scale network environments. Existing technologies struggle to accurately locate network resources, impacting the accuracy of path planning. Furthermore, frequent topology changes in dynamic network environments lead to extensive redundant computations; traditional algorithms lack effective incremental update mechanisms, resulting in severe waste of computational resources. Considering only a single constraint during path search also leads to low reliability. Summary of the Invention

[0004] This invention provides a routing planning method, apparatus, electronic device, and medium for optical fiber communication networks, which addresses the shortcomings of low efficiency and poor accuracy in existing routing planning methods for optical fiber communication networks.

[0005] This invention provides a routing planning method for an optical fiber communication network, comprising: Obtain routing requests from the fiber optic communication network; The routing request is parsed to determine the source node, target node, and path constraints; Under the path constraints, a bidirectional search strategy is adopted. Based on a pre-constructed multi-level resource topology graph, the path search starts simultaneously from the source node and the target node. An adaptive Bloom filter is used to record the searched nodes, and the nodes to be searched are prioritized. Based on the priority ranking results, the nodes to be searched are searched to obtain the optimal path planning scheme. The multi-level resource topology graph includes a multi-level grid structure, with multiple physical resources of the optical fiber communication network as nodes and the relationships between these multiple physical resources as edges.

[0006] In some embodiments, the multi-level resource topology map is constructed based on the following steps: The geographical area corresponding to the optical fiber communication network is divided into multi-level grids to construct a multi-level grid structure. Space-filling curves are used to encode each layer of the multi-layered grid structure, generating a unique identifier for each layer of the grid. Based on the unique identifier of each layer of the grid, the mapping relationship between multiple physical resources of the optical fiber communication network and each layer of the grid is determined, and the multiple physical resources are mapped to the multi-level grid structure to obtain the multi-level resource topology map.

[0007] In some embodiments, the space-filling curve is a Morton curve.

[0008] In some embodiments, the multi-layered grid structure includes a global grid layer, a regional grid layer, a city grid layer, and a building grid layer.

[0009] In some embodiments, the step of searching the node to be searched according to the priority ranking result to obtain the optimal path planning scheme includes: Based on the priority sorting results, a priority queue is generated, and the nodes to be searched are searched based on the priority queue to obtain an initial path planning scheme. Based on multiple objectives, the initial path planning scheme is optimized to obtain the optimal path planning scheme. The multiple objectives include at least two of path cost minimization, performance optimization, and load balancing; the optimal path planning scheme includes the primary path and alternative paths.

[0010] In some embodiments, the path constraints include bandwidth constraints, latency constraints, and cost constraints.

[0011] In some embodiments, after obtaining the optimal path planning scheme, the method further includes: Monitor the real-time status of the fiber optic communication network; If it is determined that there is an anomaly in the target node of the optimal path planning scheme, the optimal path planning scheme is updated according to the real-time status of the optical fiber communication network to obtain the updated path planning scheme.

[0012] The present invention also provides a routing planning device for an optical fiber communication network, comprising: The acquisition unit is used to acquire routing requests from the optical fiber communication network. The parsing unit is used to parse the routing request and determine the source node, target node, and path constraints. The search unit is used to employ a bidirectional search strategy under the path constraints, and based on a pre-constructed multi-level resource topology graph, simultaneously start path search from the source node and the target node. It uses an adaptive Bloom filter to record the searched nodes, prioritizes the nodes to be searched, and searches the nodes to be searched according to the priority ranking results to obtain the optimal path planning scheme. The multi-level resource topology graph includes a multi-level grid structure, with multiple physical resources of the optical fiber communication network as nodes and the relationships between these multiple physical resources as edges.

[0013] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement a routing planning method for any of the above-described optical fiber communication networks.

[0014] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements a routing planning method for an optical fiber communication network as described above.

[0015] The present invention provides a routing planning method, apparatus, electronic device, and medium for optical fiber communication networks. This method acquires routing requests from the optical fiber communication network; parses the routing requests to determine the source node, target node, and path constraints; under the path constraints, employs a bidirectional search strategy, based on a pre-constructed multi-level resource topology map, to simultaneously search for paths from both the source and target nodes. An adaptive Bloom filter is used to record already searched nodes, and the nodes to be searched are prioritized. Based on the priority ranking results, the nodes to be searched are searched to obtain the optimal path planning scheme, thus improving the efficiency and accuracy of routing planning. Attached Figure Description

[0016] To more clearly illustrate the technical solutions in this invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0017] Figure 1 This is a flowchart illustrating the routing planning method for an optical fiber communication network provided in an embodiment of the present invention.

[0018] Figure 2 This is a flowchart illustrating the construction process of a multi-level resource topology map provided in an embodiment of the present invention.

[0019] Figure 3This is a schematic diagram of the structure of the routing planning device for an optical fiber communication network provided in an embodiment of the present invention.

[0020] Figure 4 This is a schematic diagram of the structure of the electronic device provided in an embodiment of the present invention. Detailed Implementation

[0021] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.

[0022] The terms "first," "second," etc., used in this invention are used to distinguish similar objects, not to describe a specific order or sequence. It should be understood that such terms can be used interchangeably where appropriate so that embodiments of the invention can be implemented in orders other than those illustrated or described herein, and the objects distinguished by "first" and "second" are generally of the same class, not limited in number; for example, the first object can be one or more. Furthermore, in this invention, "and / or" indicates at least one of the connected objects, and the character " / " generally indicates that the preceding and following objects are in an "or" relationship.

[0023] Figure 1 This is a flowchart illustrating the routing planning method for an optical fiber communication network provided in an embodiment of the present invention. Figure 1 As shown, a routing planning method for an optical fiber communication network is provided, including the following steps: step 110, step 120, and step 130. This method's steps are merely one possible implementation of the invention.

[0024] Step 110: Obtain the routing request of the fiber optic communication network.

[0025] Among them, optical fiber communication networks are communication networks that use light as the information carrier and optical fiber as the transmission medium. Their advantages include long transmission distance, large capacity, high speed, and strong anti-interference capability.

[0026] The purpose of a routing request is to calculate a feasible path from a starting point to an end point in a fiber optic communication network. This request contains the basic information needed for path planning. When a device in the network needs to send data to another device, it initiates a routing request, asking the network to calculate and establish an available communication path for it.

[0027] Optionally, user-submitted routing requests can be received through a specific interface.

[0028] Step 120: Parse the routing request to determine the source node, target node, and path constraints.

[0029] The source node is the starting point of the path, which can be a core data center in a city, a specific network device, or a geographical coordinate; the destination node is the ending point of the path, which can also be a core data center in a city, a specific network device, or a geographical coordinate.

[0030] Among them, path constraints are the rules or restrictions that must be followed in path search.

[0031] In some embodiments, path constraints include bandwidth constraints, latency constraints, and cost constraints.

[0032] Optionally, the bandwidth constraint could be: the available bandwidth of all links on the path is greater than or equal to the bandwidth value requested for routing. For example, to request a 100Gbps connection, no fiber optic segment on the path can be lower than this capacity. The delay constraint could be: the total time for data packets to travel from the source node to the destination node is less than a preset time threshold.

[0033] Optionally, the rationality and validity of the source node, target node, and path constraints are verified to ensure that the source node and target node exist in the network and that the constraint values ​​are within a reasonable range.

[0034] Step 130: Under path constraints, a bidirectional search strategy is adopted. Based on the pre-constructed multi-level resource topology graph, path search is started simultaneously from the source node and the target node. An adaptive Bloom filter is used to record the searched nodes, and the nodes to be searched are prioritized. Based on the priority ranking results, the nodes to be searched are searched to obtain the optimal path planning scheme. The multi-level resource topology graph includes a multi-level grid structure. The multi-level resource topology graph uses multiple physical resources of the optical fiber communication network as nodes and the association relationships between multiple physical resources as edges.

[0035] One such strategy is the bidirectional search strategy, a graph search algorithm that starts searching from both the beginning and the end simultaneously. A path is found when the search waves from both sides meet. This method typically reduces the number of nodes that need to be checked, thus significantly improving search speed.

[0036] Alternatively, when performing large-scale path search, a macroscopic path can be quickly found in the high-level topology first, and then a precise microscopic path that meets the path constraints can be found in the relevant low-level topology, avoiding blind search in a large and flat detail graph.

[0037] The adaptive Bloom filter is used to record nodes that have already been processed by the algorithm during the path search process. By using an adaptive Bloom filter to record searched nodes, duplicate and unnecessary calculations on the same node can be avoided, thus improving search efficiency.

[0038] It should be noted that the adaptive Bloom filter can dynamically adjust its size according to the number of nodes that need to be processed. In the early stages of the search, when there are few nodes to be processed, the filter can maintain a small size to save memory. As the search progresses and the number of nodes to be processed increases, the filter can automatically expand, thereby balancing memory usage and false positive rate, ensuring high performance while maintaining high accuracy.

[0039] Among them, the multi-level grid structure is a hierarchical spatial indexing model. Each grid layer divides the geographic space into grid units of regular or irregular size. Higher-level grids have a large coverage area but low accuracy, while lower-level grids have a small coverage area but high accuracy.

[0040] Optionally, physical resources include at least switches, routers, optical amplifiers, junction boxes, etc.

[0041] Optionally, under path constraints, with the goal of minimizing path cost, optimizing performance, and balancing load, a bidirectional search strategy is adopted, and path search is started simultaneously from the source node and the target node based on a pre-built multi-level resource topology graph.

[0042] Optionally, the node with the highest search priority can be searched first.

[0043] In this embodiment of the invention, routing requests from an optical fiber communication network are obtained; the routing requests are parsed to determine the source node, target node, and path constraints; under the path constraints, a bidirectional search strategy is adopted, and based on a pre-constructed multi-level resource topology map, path search is started simultaneously from the source node and the target node. An adaptive Bloom filter is used to record the searched nodes, and the nodes to be searched are prioritized. Based on the priority ranking results, the nodes to be searched are searched to obtain the optimal path planning scheme, thereby improving the efficiency and accuracy of routing planning.

[0044] Figure 2 This is a flowchart illustrating the construction process of a multi-level resource topology map provided in an embodiment of the present invention. In some embodiments, the multi-level resource topology map is constructed based on the following steps: Step 210: Divide the geographical area corresponding to the optical fiber communication network into a multi-level grid and construct a multi-level grid structure.

[0045] Optionally, a hierarchical, top-down grid system can be pre-designed. For each level, specific geometric rules are used to divide the geographic space into continuous, non-overlapping grid units.

[0046] In some embodiments, the multi-layered grid structure includes a global grid layer, a regional grid layer, a city grid layer, and a building grid layer.

[0047] The global grid layer, as the top-level grid, covers the entire Earth's surface. This layer has the largest grid units and is used for macro-level route planning. The regional grid layer, below the global layer, divides large regions. The grid units at this level are smaller and more precise, used to manage network resources at the provincial, state, or large city cluster levels. The city grid layer, below the regional grid layer, divides specific cities or regions. This layer can accurately locate different urban areas, core hub data centers, and major trunk routes within a city. The building grid layer, as the bottom-level grid, achieves the highest precision positioning. Its smaller grid units can reach the building level, used to accurately locate network access points, specific data center locations, and even the distribution of optical cables within buildings.

[0048] Step 220: Encode each layer of the multi-layer grid structure using space-filling curves to generate a unique identifier for each layer of the grid.

[0049] Optionally, the unique identifier for each grid layer can be LXYZ, where L represents the level of the grid, X and Y represent its two-dimensional coordinates, and Z is a one-dimensional code that can be used as a sub-region identifier or core index.

[0050] The space-filling curve is a continuous curve that passes through every point in a high-dimensional space once and only once.

[0051] Optionally, for each grid cell in the multi-level grid structure, its two-dimensional coordinates in the current level are determined.

[0052] In some embodiments, the space-filling curve is a Morton curve.

[0053] The Morton curve, also known as the Z-order curve, is a classic space-filling curve. Its core function is to map points in a multidimensional space onto a one-dimensional straight line in a specific order that preserves a certain degree of spatial locality. The one-dimensional code generated by this mapping is called a Morton code or a Z-order code.

[0054] Step 230: Based on the unique identifier of each layer of the grid, determine the mapping relationship between multiple physical resources of the optical fiber communication network and each layer of the grid, and map multiple physical resources to the multi-level grid structure to obtain a multi-level resource topology map.

[0055] Specifically, the process involves traversing every physical resource in the fiber optic communication network to obtain the precise geographic coordinates of each physical resource; based on the coordinates of each physical resource, the grid containing that resource is located within the constructed multi-level grid structure; and using the unique identifier of that grid as the spatial index ID of the physical resource.

[0056] For example, the location of a computer room can be precisely mapped to its "city grid layer - code A" and "building grid layer - code B".

[0057] In this embodiment of the invention, a multi-level grid structure is constructed by dividing the geographical area corresponding to the optical fiber communication network into multiple levels; each level of the grid in the multi-level grid structure is encoded using a space-filling curve to generate a unique identifier for each level of the grid; based on the unique identifier of each level of the grid, the mapping relationship between multiple physical resources of the optical fiber communication network and each level of the grid is determined, and multiple physical resources are mapped to the multi-level grid structure to obtain a multi-level resource topology map, which can greatly improve search efficiency and achieve accurate positioning.

[0058] In some embodiments, the node to be searched is searched according to the priority ranking result to obtain the optimal path planning scheme, including: Based on the priority sorting results, a priority queue is generated. Based on the priority queue, the nodes to be searched are searched to obtain the initial path planning scheme. Based on multiple objectives, the initial path planning scheme is optimized to obtain the optimal path planning scheme; The objectives include at least two of the following: minimizing path cost, optimizing performance, and load balancing; the optimal path planning scheme includes the primary path and alternative paths.

[0059] A priority queue is a special data structure in which each element has a priority. When performing a dequeue operation, the element with the highest priority will be taken out first.

[0060] The primary path is the optimal path calculated using an optimization algorithm at a specific time. Alternative paths are physical backups that are separate from the primary path; they allow for rapid switching to alternative paths when the primary path fails, significantly enhancing network reliability.

[0061] Optionally, the optimal path planning scheme includes detailed path information, such as node sequence, bandwidth, latency, and cost of each link segment.

[0062] Specifically, the node with the highest current priority is taken from the priority queue and processed. It is checked whether the node satisfies the path constraints. Then, all neighboring nodes of the node are explored, the cost of reaching these neighboring nodes is calculated, and they are added to the priority queue. This process is repeated until the target node is reached, and an initial path planning scheme is obtained.

[0063] Optionally, based on the initial path planning scheme, multiple feasible paths with differences on the critical links can be generated by adjusting the weights of path constraints or using other search strategies.

[0064] Optionally, the dynamic weight of each objective is determined, multiple objectives are comprehensively weighed, one path is selected from multiple paths as the main path, and one or more paths with high redundancy with the main path are selected as alternative paths.

[0065] In this embodiment of the invention, a priority queue is generated based on the priority sorting result. Based on the priority queue, the node to be searched is searched to obtain an initial path planning scheme. Based on multiple objectives, the initial path planning scheme is optimized to obtain the optimal path planning scheme, thereby improving the efficiency, accuracy and reliability of route planning.

[0066] In some embodiments, after obtaining the optimal path planning scheme, the method further includes: Monitor the real-time status of fiber optic communication networks; If the target node in the optimal path planning scheme is found to be abnormal, the optimal path planning scheme is updated based on the real-time status of the optical fiber communication network to obtain the updated path planning scheme.

[0067] Optionally, the real-time status of the fiber optic communication network includes, but is not limited to, key performance indicators such as: CPU / memory utilization of network devices, connectivity status of physical optical cables, current bandwidth utilization of links, packet transmission latency and jitter, and network error rate.

[0068] Optionally, the real-time status of the fiber optic communication network can be compared with a preset threshold to determine whether there are any abnormalities in the nodes or links of the optimal path planning scheme. If so, the optimal path planning scheme can be updated and an alarm can be issued.

[0069] In this embodiment of the invention, by monitoring the real-time status of the optical fiber communication network, and in the event that an anomaly exists in the target node of the optimal path planning scheme, the optimal path planning scheme is updated according to the real-time status of the optical fiber communication network, thereby enhancing the reliability of the network and ensuring the continuity of services.

[0070] The routing planning device for an optical fiber communication network provided in the embodiments of the present invention will be described below. The routing planning device for an optical fiber communication network described below can be referred to in correspondence with the routing planning method for an optical fiber communication network described above.

[0071] Figure 3 This is a schematic diagram of the structure of a routing planning device for an optical fiber communication network provided in an embodiment of the present invention, as shown below. Figure 3 As shown, the routing planning device 300 for the optical fiber communication network includes: The acquisition unit 310 is used to acquire routing requests from the optical fiber communication network; The parsing unit 320 is used to parse the routing request and determine the source node, target node and path constraints; Search unit 330 is used to perform path search simultaneously from source node and target node under path constraints by adopting a bidirectional search strategy based on a pre-built multi-level resource topology graph. It uses an adaptive Bloom filter to record the searched nodes, prioritizes the nodes to be searched, and searches the nodes to be searched according to the priority ranking results to obtain the optimal path planning scheme. The multi-level resource topology graph includes a multi-level grid structure. The multi-level resource topology graph uses multiple physical resources of the optical fiber communication network as nodes and the association relationships between multiple physical resources as edges.

[0072] Optionally, the multi-level resource topology map is constructed based on the following steps: The geographical area corresponding to the optical fiber communication network is divided into multi-level grids to construct a multi-level grid structure. Space-filling curves are used to encode each layer of the multi-layer grid structure, generating a unique identifier for each layer of the grid. Based on the unique identifier of each mesh layer, the mapping relationship between multiple physical resources of the optical fiber communication network and each mesh layer is determined, and multiple physical resources are mapped to a multi-level mesh structure to obtain a multi-level resource topology map.

[0073] Optionally, the space-filling curve is a Morton curve.

[0074] Optionally, the multi-layered grid structure includes a global grid layer, a regional grid layer, a city grid layer, and a building grid layer.

[0075] Optionally, based on the priority ranking results, the nodes to be searched are searched to obtain the optimal path planning scheme, including: Based on the priority sorting results, a priority queue is generated. Based on the priority queue, the nodes to be searched are searched to obtain the initial path planning scheme. Based on multiple objectives, the initial path planning scheme is optimized to obtain the optimal path planning scheme; The objectives include at least two of the following: minimizing path cost, optimizing performance, and load balancing; the optimal path planning scheme includes the primary path and alternative paths.

[0076] Optionally, path constraints include bandwidth constraints, delay constraints, and cost constraints.

[0077] Optionally, the routing planning device for the fiber optic communication network further includes: The monitoring unit is used to monitor the real-time status of the fiber optic communication network. The update unit is used to update the optimal path planning scheme based on the real-time status of the optical fiber communication network when there is an anomaly in the target node of the optimal path planning scheme, so as to obtain the updated path planning scheme.

[0078] It should be noted that the routing planning device for optical fiber communication networks provided in this embodiment of the invention can implement all the method steps implemented in the above-mentioned routing planning method embodiment of optical fiber communication networks, and can achieve the same technical effect. Therefore, the parts and beneficial effects that are the same as those in the method embodiment will not be described in detail here.

[0079] Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention, such as... Figure 4 As shown, the electronic device may include a processor 410, a communications interface 420, a memory 430, and a communication bus 440. The processor 410, communications interface 420, and memory 430 communicate with each other via the communication bus 440. The processor 410 can call logical instructions in the memory 430 to execute a routing planning method for the optical fiber communication network. This method includes: obtaining a routing request from the optical fiber communication network; parsing the routing request to determine the source node, target node, and path constraints; under the path constraints, employing a bidirectional search strategy, based on a pre-constructed multi-level resource topology graph, simultaneously starting path search from both the source and target nodes; using an adaptive Bloom filter to record searched nodes; prioritizing the nodes to be searched; and searching the nodes to be searched according to the priority ranking results to obtain the optimal path planning scheme. The multi-level resource topology graph includes a multi-level mesh structure, with multiple physical resources of the optical fiber communication network as nodes and the relationships between these physical resources as edges.

[0080] Furthermore, the logical instructions in the aforementioned memory 430 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0081] On the other hand, the present invention also provides a computer program product, which includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the routing planning method for the optical fiber communication network provided by the above methods. The method includes: obtaining a routing request from the optical fiber communication network; parsing the routing request to determine the source node, the target node, and path constraints; under the path constraints, adopting a bidirectional search strategy, simultaneously starting path search from the source node and the target node based on a pre-constructed multi-level resource topology graph, using an adaptive Bloom filter to record the searched nodes, prioritizing the nodes to be searched, and searching the nodes to be searched according to the priority ranking result to obtain the optimal path planning scheme; wherein, the multi-level resource topology graph includes a multi-level mesh structure, with multiple physical resources of the optical fiber communication network as nodes and the relationships between multiple physical resources as edges.

[0082] In another aspect, the present invention also provides a non-transitory computer-readable storage medium storing a computer program thereon. When executed by a processor, the computer program implements a routing planning method for an optical fiber communication network provided by the methods described above. The method includes: obtaining a routing request from the optical fiber communication network; parsing the routing request to determine the source node, the target node, and path constraints; under the path constraints, employing a bidirectional search strategy, simultaneously starting path search from the source node and the target node based on a pre-constructed multi-level resource topology graph, using an adaptive Bloom filter to record searched nodes, prioritizing the nodes to be searched, and searching the nodes to be searched according to the priority ranking result to obtain the optimal path planning scheme; wherein the multi-level resource topology graph includes a multi-level mesh structure, with multiple physical resources of the optical fiber communication network as nodes and the relationships between multiple physical resources as edges.

[0083] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0084] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0085] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A routing planning method for an optical fiber communication network, characterized in that, include: Obtain routing requests from the fiber optic communication network; The routing request is parsed to determine the source node, target node, and path constraints; Under the path constraints, a bidirectional search strategy is adopted. Based on a pre-constructed multi-level resource topology graph, the path search starts simultaneously from the source node and the target node. An adaptive Bloom filter is used to record the searched nodes, and the nodes to be searched are prioritized. Based on the priority ranking results, the nodes to be searched are searched to obtain the optimal path planning scheme. The multi-level resource topology graph includes a multi-level grid structure, with multiple physical resources of the optical fiber communication network as nodes and the relationships between these multiple physical resources as edges.

2. The routing planning method for an optical fiber communication network according to claim 1, characterized in that, The multi-level resource topology map is constructed based on the following steps: The geographical area corresponding to the optical fiber communication network is divided into multi-level grids to construct a multi-level grid structure. Space-filling curves are used to encode each layer of the multi-layered grid structure, generating a unique identifier for each layer of the grid. Based on the unique identifier of each layer of the grid, the mapping relationship between multiple physical resources of the optical fiber communication network and each layer of the grid is determined, and the multiple physical resources are mapped to the multi-level grid structure to obtain the multi-level resource topology map.

3. The routing planning method for an optical fiber communication network according to claim 2, characterized in that, The space-filling curve is a Morton curve.

4. The routing planning method for an optical fiber communication network according to claim 1, characterized in that, The multi-layered grid structure includes a global grid layer, a regional grid layer, a city grid layer, and a building grid layer.

5. The routing planning method for an optical fiber communication network according to claim 1, characterized in that, The step of searching the nodes to be searched according to the priority ranking results to obtain the optimal path planning scheme includes: Based on the priority sorting results, a priority queue is generated, and the nodes to be searched are searched based on the priority queue to obtain an initial path planning scheme. Based on multiple objectives, the initial path planning scheme is optimized to obtain the optimal path planning scheme. The multiple objectives include at least two of path cost minimization, performance optimization, and load balancing; the optimal path planning scheme includes the primary path and alternative paths.

6. The routing planning method for an optical fiber communication network according to claim 1, characterized in that, The path constraints include bandwidth constraints, delay constraints, and cost constraints.

7. The routing planning method for an optical fiber communication network according to claim 1, characterized in that, After obtaining the optimal path planning scheme, the process also includes: Monitor the real-time status of the fiber optic communication network; If it is determined that there is an anomaly in the target node of the optimal path planning scheme, the optimal path planning scheme is updated according to the real-time status of the optical fiber communication network to obtain the updated path planning scheme.

8. A routing planning device for an optical fiber communication network, characterized in that, include: The acquisition unit is used to acquire routing requests from the optical fiber communication network. The parsing unit is used to parse the routing request and determine the source node, target node, and path constraints. The search unit is used to employ a bidirectional search strategy under the path constraints, and based on a pre-constructed multi-level resource topology graph, simultaneously start path search from the source node and the target node. It uses an adaptive Bloom filter to record the searched nodes, prioritizes the nodes to be searched, and searches the nodes to be searched according to the priority ranking results to obtain the optimal path planning scheme. The multi-level resource topology graph includes a multi-level grid structure, with multiple physical resources of the optical fiber communication network as nodes and the relationships between these multiple physical resources as edges.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that, When the processor executes the computer program, it implements the routing planning method for the optical fiber communication network as described in any one of claims 1 to 7.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the routing planning method for the optical fiber communication network as described in any one of claims 1 to 7.

Images