Routing scheme determination method and device, equipment and storage medium

By obtaining associated starting nodes in complex networks and building and evaluating multiple routing solutions, the problems of low routing planning efficiency and poor accuracy in the prior art are solved, and efficient routing solutions for complex networks are determined.

CN118945107APending Publication Date: 2024-11-12CHINA UNITED NETWORK COMM GRP CO LTD
View PDF 0 Cites 2 Cited by

Patent Information

Application Number
CN202310525297.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-10
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

The prior art cannot effectively analyze and determine branch routing schemes in complex networks, resulting in low routing planning efficiency and poor accuracy, unable to automatically search and determine the routing scheme of mesh structures, and can only return one routing scheme.

Method used

By obtaining the starting nodes associated with the target building, multiple routing schemes are built based on the breadth-first algorithm, and each routing scheme is qualityly analyzed, including the same number of routes, number of nodes, routing attenuation, routing distance and resource occupancy rate , evaluate and select an optimized routing scheme.

Benefits of technology

It improves the determination efficiency and accuracy of routing solutions, can handle multiple routing solutions in complex networks, automatically analyze and select the optimal routing solutions, and solves the efficiency and accuracy of routing planning in the prior art.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118945107A_ABST
    Figure CN118945107A_ABST
Patent Text Reader

Abstract

The invention discloses a routing scheme determination method and device, equipment and a storage medium, relates to the technical field of communication, and is used for improving the efficiency and accuracy of determining a routing scheme. Comprising the following steps: acquiring at least one starting node corresponding to a target building, and constructing a plurality of routing schemes based on the at least one starting node; for any starting node in the at least one starting node, determining at least one routing node corresponding to any starting node based on a breadth-first algorithm; according to a connection relationship between the at least one routing node and any starting node, taking each routing node in the at least one routing node as a node in at least one routing scheme corresponding to any starting node; and performing quality analysis on each routing scheme in the plurality of routing schemes to obtain a quality evaluation parameter corresponding to each routing scheme, and determining a to-be-constructed target routing scheme according to the quality evaluation parameter corresponding to each routing scheme.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method, device, equipment and storage medium for determining a routing solution. Background Art

[0002] With the development of information technology, in the process of optical cable resource construction and laying, it is necessary to use computer-assisted routing plan planning. The current planning of routing plan can analyze routing plan for trunk route. Specifically, according to the known locations of two network devices, the routing plan between the two network devices is analyzed, and a routing line (i.e. a routing plan) obtained by analysis is returned through the minimum path calculation method.

[0003] In the above method, only the trunk routes can be analyzed, and the branch routes that account for a larger proportion in actual production activities cannot be analyzed, which affects the user experience. At the same time, it is impossible to plan and design a routing plan based on only one network device, and it is impossible to automatically search, automatically analyze and automatically determine the routing plan of the mesh structure. The search time for routing plans with more network devices is too long, and it is impossible to process routing plans with special points (such as must-pass points). In addition, only one routing plan can be returned, so the efficiency and accuracy of determining the routing plan for the network device are poor. Summary of the invention

[0004] The present application provides a routing solution determination method, apparatus, device and storage medium, which are used to solve the problem that a routing solution can only be determined based on two network devices and only one routing solution can be returned, thereby improving the efficiency and accuracy of determining routing solutions for network devices.

[0005] In order to achieve the above objectives, this application adopts the following technical solutions:

[0006] In a first aspect, a method for determining a routing scheme is provided, the method comprising: obtaining at least one starting node corresponding to a target building, and constructing multiple routing schemes based on the at least one starting node, wherein one starting node corresponds to at least one routing scheme, and the starting node is a network device whose distance from the target building is less than a preset distance and has an associated relationship with the target building; for any starting node among the at least one starting node, determining at least one routing node corresponding to any starting node based on a breadth-first algorithm, wherein each routing node among the at least one routing node has a connection relationship with any starting node; according to the connection relationship between the at least one routing node and any starting node, taking each routing node among the at least one routing node as a node in at least one routing scheme corresponding to any starting node, wherein one routing node corresponds to at least one routing scheme; performing quality analysis on each routing scheme among the multiple routing schemes to obtain a quality evaluation parameter corresponding to each routing scheme, and determining a target routing scheme to be constructed according to the quality evaluation parameter corresponding to each routing scheme, wherein the quality analysis comprises at least one of the following: determining the number of identical routes, determining the number of nodes, determining routing attenuation, determining routing distance, and determining resource occupancy.

[0007] In a possible implementation, at least one routing node includes: at least one intermediate node and at least one end node, the intermediate node has a data forwarding function, the end node has a signal receiving and sending function, and one end node corresponds to a routing plan; at least one routing node corresponding to any starting node is determined based on a breadth-first algorithm, including: determining at least one target node connected to any starting node based on a breadth-first algorithm, and judging whether each of the at least one target node has a signal receiving and sending function; for any target node among the at least one target node, when it is determined that any target node does not have a signal receiving and sending function, any target node is determined as an intermediate node corresponding to any starting node; when it is determined that any target node has a signal receiving and sending function, any target node is determined as an end node corresponding to any starting node.

[0008] In one possible implementation, when any target node is an intermediate node, a target operation is performed on any target node; the target operation includes: determining at least one first node directly connected to any target node based on a breadth-first algorithm, and determining whether each of the at least one first node has a signal receiving and sending function; for any first node among the at least one first node, when it is determined that any first node does not have a signal receiving and sending function, determining any first node as an intermediate node corresponding to any starting node; when it is determined that any first node has a signal receiving and sending function, determining any first node as an end node corresponding to any starting node.

[0009] In a possible implementation, it is determined whether the number of routing nodes included in each of the multiple routing schemes is greater than a preset threshold; when it is determined that the number of routing nodes included in any routing scheme is greater than the preset threshold, any routing scheme is deleted.

[0010] In a possible implementation, it is determined whether the routing nodes included in each of the multiple routing schemes include a second node, where the second node is a preset intermediate node; when it is determined that the routing nodes included in any routing scheme do not include the second node, any routing scheme is deleted.

[0011] In a possible implementation, a quality analysis is performed on each of a plurality of routing schemes to obtain a quality assessment parameter corresponding to each routing scheme, including: for any routing scheme among the plurality of routing schemes, a plurality of target parameters corresponding to any routing scheme are determined, the plurality of target parameters including at least one of the following: the number of identical routes, the number of nodes, routing attenuation, routing distance, and resource occupancy rate; and a quality assessment parameter corresponding to any routing scheme is determined based on the plurality of target parameters corresponding to any routing scheme and a weight parameter corresponding to each of the plurality of target parameters.

[0012] In a second aspect, a routing scheme determination device is provided, the routing scheme determination device comprising: an acquisition unit, a processing unit and a determination unit; the acquisition unit is used to acquire at least one starting node corresponding to a target building; the processing unit is used to construct multiple routing schemes based on the at least one starting node, one starting node corresponds to at least one routing scheme, and the starting node is a network device that is less than a preset distance from the target building and has an associated relationship with the target building; the determination unit is used to determine, for any starting node of the at least one starting node, at least one routing node corresponding to any starting node based on a breadth-first algorithm, each routing node of the at least one routing node has a certain distance from any starting node. The processing unit is further used to use each routing node in the at least one routing node as a node in at least one routing scheme corresponding to any starting node according to the connection relationship between the at least one routing node and any starting node, and one routing node corresponds to at least one routing scheme; the processing unit is further used to perform quality analysis on each routing scheme in the multiple routing schemes to obtain a quality evaluation parameter corresponding to each routing scheme, and the quality analysis includes at least one of the following: determining the number of identical routes, determining the number of nodes, determining routing attenuation, determining routing distance, and determining resource occupancy; the determination unit is further used to determine the target routing scheme to be constructed according to the quality evaluation parameter corresponding to each routing scheme.

[0013] In one possible implementation, at least one routing node includes: at least one intermediate node and at least one end node, the intermediate node has a data forwarding function, the end node has a signal receiving and sending function, and one end node corresponds to one routing plan; the determination unit is also used to determine at least one target node connected to any starting node based on a breadth-first algorithm, and to determine whether each of the at least one target node has a signal receiving and sending function; the determination unit is also used to determine any target node among the at least one target node as an intermediate node corresponding to any starting node when it is determined that any target node does not have a signal receiving and sending function; the determination unit is also used to determine any target node as an end node corresponding to any starting node when it is determined that any target node has a signal receiving and sending function.

[0014] In one possible implementation, the processing unit is further used to perform a target operation on any target node when any target node is an intermediate node; the determination unit is further used to determine at least one first node directly connected to any target node based on a breadth-first algorithm, and to determine whether each of the at least one first node has a signal receiving and sending function; the determination unit is further used to, for any first node among the at least one first node, when it is determined that any first node does not have a signal receiving and sending function, determine any first node as an intermediate node corresponding to any starting node; the determination unit is further used to determine any first node as an end node corresponding to any starting node when it is determined that any first node has a signal receiving and sending function.

[0015] In a possible implementation, the determination unit is further used to determine whether the number of routing nodes included in each of the multiple routing schemes is greater than a preset threshold; the processing unit is further used to delete any routing scheme when it is determined that the number of routing nodes included in any routing scheme is greater than the preset threshold.

[0016] In a possible implementation, the determination unit is further used to determine whether the routing nodes included in each of the multiple routing schemes include a second node, where the second node is a preset intermediate node; the processing unit is further used to delete any routing scheme when it is determined that the routing nodes included in any routing scheme do not include the second node.

[0017] In a possible implementation, the determination unit is further used to determine, for any routing scheme among the multiple routing schemes, multiple target parameters corresponding to any routing scheme, where the multiple target parameters include at least one of the following: number of identical routes, number of nodes, routing attenuation, routing distance, and resource occupancy rate; the determination unit is further used to determine a quality assessment parameter corresponding to any routing scheme based on the multiple target parameters corresponding to any routing scheme and a weight parameter corresponding to each of the multiple target parameters.

[0018] In a third aspect, an electronic device comprises: a processor and a memory; wherein the memory is used to store one or more programs, and the one or more programs include computer execution instructions. When the electronic device is running, the processor executes the computer execution instructions stored in the memory to enable the electronic device to perform a routing solution determination method as in the first aspect.

[0019] In a fourth aspect, a computer-readable storage medium storing one or more programs is provided. The one or more programs include instructions. When the instructions are executed by a computer, the computer executes a routing solution determination method as described in the first aspect.

[0020] The present application provides a method, device, equipment and storage medium for determining a routing scheme, which are applied to a scenario for determining a routing scheme. When it is necessary to determine a routing scheme, at least one starting node whose distance from a target building is less than a preset distance and has an associated relationship with the target building can be obtained, and multiple routing schemes can be constructed based on the at least one starting node obtained. Furthermore, at least one routing node having a connection relationship with any starting node is determined based on a breadth-first algorithm, and then each routing node in the at least one routing node is used as a node in at least one routing scheme corresponding to any starting node. Thus, a quality analysis is performed on at least one of the same routing number, the number of nodes, the routing attenuation, the routing distance, and the resource occupancy rate of each routing scheme in the multiple routing schemes to obtain a quality evaluation parameter corresponding to each routing scheme, and the target routing scheme to be constructed is determined according to the quality evaluation parameter corresponding to each routing scheme.

[0021] Through the above method, for a starting node, other routing nodes connected to the starting node can be traversed based on the breadth-first algorithm, and multiple routing schemes can be constructed based on the starting node, other routing nodes and the connection relationship between each node to solve the problem that only the routing scheme can be determined based on two nodes and only one routing scheme can be returned. At the same time, by performing quality analysis on each routing scheme, the quality evaluation parameters corresponding to each routing scheme can be obtained, and the target routing scheme to be constructed can be determined based on the quality evaluation parameters corresponding to each routing scheme, thereby improving the accuracy and rationality of determining the routing scheme to be constructed, and improving the efficiency and accuracy of determining the routing scheme. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] Figure 1 A schematic diagram of the structure of a routing solution determination system provided in an embodiment of the present application;

[0023] Figure 2 A schematic diagram of a method for determining a routing solution provided in an embodiment of the present application Figure 1 ;

[0024] Figure 3 An operation diagram of presenting a routing solution provided in an embodiment of the present application;

[0025] Figure 4 A schematic diagram showing a routing solution provided in an embodiment of the present application;

[0026] Figure 5 A schematic diagram of a GIS map presenting a routing solution provided in an embodiment of the present application;

[0027] Figure 6 A schematic diagram of a method for determining a routing solution provided in an embodiment of the present application Figure 2 ;

[0028] Figure 7 A schematic diagram of a method for determining a routing solution provided in an embodiment of the present application Figure 3 ;

[0029] Figure 8 A schematic diagram of a method for determining a routing solution provided in an embodiment of the present application Figure 4 ;

[0030] Fig. 9 A schematic diagram of a method for determining a routing solution provided in an embodiment of the present application Figure 5 ;

[0031] Fig.10 A schematic diagram of a method for determining a routing solution provided in an embodiment of the present application Figure 6 ;

[0032] Fig.11 A schematic diagram of a process for presenting a routing solution provided in an embodiment of the present application;

[0033] Fig.12 A schematic diagram of the number of routing solutions provided for an embodiment of the present application;

[0034] Fig.13 A schematic diagram of determining a routing solution provided in an embodiment of the present application;

[0035] Fig.14 A schematic diagram of the structure of a routing solution determination device provided in an embodiment of the present application;

[0036] Fig.15 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0037] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0038] In the description of this application, unless otherwise specified, " / " means "or", for example, A / B can mean A or B. "And / or" in this article is merely a description of the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, "at least one" and "plurality" refer to two or more. The words "first", "second", etc. do not limit the quantity and execution order, and the words "first", "second", etc. do not limit them to be different.

[0039] With the vigorous development of information technology, in the process of optical cable resource construction and laying, it is inevitable to use computers to assist in the planning of routing solutions. When using computers to assist in the planning of routing solutions, the current planning of routing solutions is mainly aimed at trunk route analysis routing solutions. Specifically, according to the known locations of two network devices, the routing solution between the two network devices is analyzed, and a routing solution obtained by the analysis is returned through the minimum path calculation method. This leads to problems such as confusion in the output routing solution, non-optimal routing solution, and unreasonable actual execution of the routing solution. At the same time, the analysis methods used to ensure the accuracy, precision and rationality of the routing solution are scattered and unsystematic, and cannot accurately analyze the routing solution for complex routing environments.

[0040] In the above method, when analyzing the routing scheme for the trunk route, the branch route, which accounts for the largest proportion in actual production activities and is directly related to the user, is ignored, and the routing scheme cannot be implemented for each user, affecting the user experience. The routing scheme between two locations can only be analyzed for the locations of two known locations (i.e., two network devices), and the routing scheme cannot be analyzed for the situation of a known location, which affects the richness and diversity of routing planning and design, and is not conducive to the business expansion and construction of new optical cable lines by operators. It is impossible to automatically search, automatically analyze and automatically determine the routing scheme of the mesh structure, and thus it is impossible to determine whether the routing scheme of the mesh structure is correct. The search time for the routing scheme with more network devices is too long, resulting in low efficiency in analyzing the routing scheme, which hinders the progress of the project. At the same time, the routing scheme can only be returned by the minimum path calculation method, that is, the routing scheme cannot be compared and analyzed to determine the optimal routing scheme, which puts pressure on the operator to plan the route and affects the formulation of subsequent routing schemes. In addition, the current analysis method of the routing scheme cannot handle the routing scheme with special points.

[0041] The present application provides a method, device, equipment and storage medium for determining a routing scheme. When it is necessary to determine a routing scheme, at least one starting node whose distance from a target building is less than a preset distance and has an associated relationship with the target building can be obtained, and multiple routing schemes can be constructed based on the at least one starting node obtained. Further, at least one routing node having a connection relationship with any starting node is determined based on a breadth-first algorithm, and then each routing node in the at least one routing node is used as a node in at least one routing scheme corresponding to any starting node. Thus, a quality analysis is performed on at least one of the same routing number, the number of nodes, the routing attenuation, the routing distance, and the resource occupancy rate of each routing scheme in the multiple routing schemes to obtain a quality evaluation parameter corresponding to each routing scheme, and the target routing scheme to be constructed is determined according to the quality evaluation parameter corresponding to each routing scheme.

[0042] Through the above method, for a starting node, other routing nodes connected to the starting node can be traversed based on the breadth-first algorithm, and multiple routing schemes can be constructed based on the starting node, other routing nodes, and the connection relationship between each node to solve the problem that only two nodes can determine the routing scheme and only one routing scheme can be returned. At the same time, by performing quality analysis on each routing scheme, the quality evaluation parameters corresponding to each routing scheme can be obtained, and the target routing scheme to be constructed can be determined according to the quality evaluation parameters corresponding to each routing scheme, thereby improving the accuracy and rationality of determining the routing scheme to be constructed, and improving the efficiency and accuracy of determining the routing scheme.

[0043] A routing solution determination method provided in an embodiment of the present application may be applicable to a routing solution determination system. Figure 1 FIG. 2 shows a schematic diagram of the structure of a routing solution determination system. Figure 1 As shown, the routing scheme determination system 10 includes: a server 11 and a terminal device 12. The server 11 is used to obtain the starting node 111 corresponding to the target building through the terminal device 12, construct a routing scheme based on the starting node 111, determine the routing node 112 and the routing node 113 corresponding to the starting node 111 based on the breadth-first algorithm, use the routing node 112 and the routing node 113 as nodes in the routing scheme corresponding to the starting node 111 according to the connection relationship between the routing node 112 and the routing node 113 and the starting node 111, perform quality analysis on the routing scheme to obtain corresponding quality evaluation parameters, and determine the target routing scheme to be constructed according to the quality evaluation parameters corresponding to the routing scheme; the terminal device 12 is used to obtain and store the starting node 111 corresponding to the target building, send the starting node 111 corresponding to the target building to the server 11, and realize the determination of the routing scheme through the server 11 and the terminal device 12.

[0044] A method for determining a routing solution provided by an embodiment of the present application is described below in conjunction with the accompanying drawings. Figure 2 As shown, a method for determining a routing solution provided in an embodiment of the present application is applied to an electronic device, and the method includes S201-S205:

[0045] S201. Acquire at least one starting node corresponding to a target building, and construct multiple routing solutions based on the at least one starting node.

[0046] Among them, one starting node corresponds to at least one routing solution, and the starting node is a network device whose distance from the target building is less than a preset distance and has an associated relationship with the target building.

[0047] It can be understood that the electronic device can obtain at least one starting node corresponding to the target building, the distance between the target building and the target building is less than a preset distance and has an associated relationship with the target building, and construct multiple routing solutions based on the at least one starting node.

[0048] Optionally, the building (ie, the target building) can be bound to nearby network devices to introduce the building into the optical cable management system. Further, network devices with a distance from the building less than a preset distance and associated with the building are obtained according to the location information corresponding to the building.

[0049] For example, the building can be a building, and the network equipment can be a site (i.e., access room) of the pipeline resource system and an optical cross-connection box resource object (i.e., optical equipment). The buildings connected by three cables in the park can be bound to the site of the pipeline resource system and the optical cross-connection box resource object, and the routes in the park can be managed in a virtual routing manner.

[0050] It should be noted that the access room includes a room with signal transceiver function and a room with data forwarding function, and the optical equipment is a device with data forwarding function. Nodes represent network equipment.

[0051] S202: For any starting node among the at least one starting node, determine at least one routing node corresponding to the any starting node based on a breadth-first algorithm.

[0052] Each routing node in the at least one routing node has a connection relationship with any starting node.

[0053] It can be understood that the electronic device can determine, for any of the at least one starting node, at least one routing node corresponding to any of the at least one starting node and having a connection relationship with any of the starting nodes based on a breadth-first algorithm.

[0054] Optionally, any starting node can be used as the starting point, and a new node can be searched outward based on the breadth-first algorithm through the graph computing engine. If the new node has a direct connection relationship with the starting node or the previous routing node (that is, the two nodes are not directly connected to other nodes), the new node is a routing node. The new node can be searched for with the new node as the starting point. If the searched new node is the starting node or any routing node between the starting node and the new node, the search will not continue with the new node as the starting point, and the routing scheme corresponding to the new node will be deleted from at least one routing scheme corresponding to any starting node.

[0055] It should be noted that the direct connection relationship can be a resource association relationship or a routing relationship. The resource association relationship means that there is no other network device connected between the two nodes in the electronic device, and the routing relationship means that there is other network device connected between the two nodes in the electronic device.

[0056] S203: Based on the connection relationship between the at least one routing node and any starting node, use each routing node in the at least one routing node as a node in at least one routing solution corresponding to any starting node.

[0057] Among them, one routing node corresponds to at least one routing solution.

[0058] It can be understood that the electronic device can use a graph computing engine to use each routing node in at least one routing node as a node in at least one routing solution corresponding to any starting node according to the connection relationship between at least one routing node and any starting node.

[0059] S204: Perform quality analysis on each of the multiple routing solutions to obtain quality evaluation parameters corresponding to each routing solution.

[0060] S205: Determine the target routing scheme to be constructed according to the quality evaluation parameters corresponding to each routing scheme.

[0061] The quality analysis includes at least one of the following: determining the number of identical routes, determining the number of nodes, determining route attenuation, determining route distance, and determining resource occupancy.

[0062] It can be understood that the electronic device can perform a quality analysis on each of the multiple routing schemes, including determining the number of identical routes, determining the number of nodes, determining the routing attenuation, determining the routing distance, and determining at least one of the resource occupancy rates, to obtain the quality assessment parameters corresponding to each routing scheme, and determine the target routing scheme to be constructed based on the quality assessment parameters corresponding to each routing scheme.

[0063] Optionally, the number of same routes corresponding to each of the multiple routing schemes can be determined based on the routing conditions and pipeline resources in the routing scheme, and the quality of the number of same routes corresponding to each routing scheme can be calculated to obtain a quality evaluation parameter of the number of same routes corresponding to each routing scheme.

[0064] Exemplarily, the initial quality assessment parameter of the number of same routes of each routing scheme in multiple routing schemes can be set to 100. Assuming that the number of same routes corresponding to any routing scheme is a, the quality assessment parameter of the number of same routes corresponding to each routing scheme is 100-a*10 (a is an integer greater than or equal to zero).

[0065] It should be noted that any two nodes included in a routing scheme are connected by a line, a routing scheme includes at least one line, a line includes at least one optical cable, the number of same routes includes the sum of the number of same trenches and the number of same cables, the number of same trenches is the number of lines laid together with the pipeline in the routing scheme, and the number of same cables is the number of lines in the routing scheme that transmit signals through the same optical cable.

[0066] Optionally, the number of nodes corresponding to each of the multiple routing schemes may be determined by an electronic device, and the quality of the number of nodes corresponding to each routing scheme may be calculated to obtain a quality evaluation parameter of the number of nodes corresponding to each routing scheme.

[0067] Exemplarily, the initial node number score of each routing scheme in multiple routing schemes can be set to 100. Assuming that the number of nodes corresponding to any routing scheme is b, the node number quality evaluation parameter corresponding to each routing scheme is 100-b*0.1 (b is an integer greater than or equal to zero).

[0068] It should be noted that the number of nodes includes the number of jumpers and the number of joints.

[0069] Optionally, the electronic device may determine the routing loss corresponding to each routing scheme among the multiple routing schemes, and perform quality calculation on the routing loss corresponding to each routing scheme to obtain a routing loss quality evaluation parameter corresponding to each routing scheme.

[0070] It should be noted that the routing loss corresponding to the routing scheme is the routing loss corresponding to the line with the largest loss among at least one line included in the routing scheme. The larger the routing loss corresponding to the routing scheme, the lower the routing loss quality evaluation parameter corresponding to the routing scheme.

[0071] Optionally, the electronic device may determine the routing distance corresponding to each of the multiple routing schemes, and perform quality calculation on the routing distance corresponding to each routing scheme to obtain a routing distance quality evaluation parameter corresponding to each routing scheme.

[0072] Exemplarily, the initial routing distance score of each routing scheme in multiple routing schemes can be set to 100. Assuming that the routing distance corresponding to any routing scheme is c, the routing distance quality evaluation parameter corresponding to each routing scheme is 100-c / 1000 (c is an integer greater than or equal to zero).

[0073] It should be noted that the routing distance corresponding to the routing scheme is the sum of the distances corresponding to each of the at least one route included in the routing scheme.

[0074] Optionally, the resource occupancy rate (i.e., fiber core utilization rate) corresponding to each of the multiple routing schemes can be determined by an electronic device, and the quality of the resource occupancy rate corresponding to each routing scheme can be calculated to obtain a resource occupancy rate quality evaluation parameter corresponding to each routing scheme.

[0075] Exemplarily, it can be assumed that the resource occupancy rate corresponding to any routing scheme is d (d is a percentage greater than zero percent and less than one hundred percent). If d is less than fifty percent, the resource occupancy rate evaluation parameter corresponding to the routing scheme is 100; if d is greater than fifty percent and less than seventy percent, the resource occupancy rate evaluation parameter corresponding to the routing scheme is 99; if d is greater than seventy percent and less than eighty percent, the resource occupancy rate evaluation parameter corresponding to the routing scheme is 95; if d is greater than eighty percent and less than one hundred percent, the resource occupancy rate evaluation parameter corresponding to the routing scheme is 90.

[0076] It should be noted that an optical cable includes multiple fiber cores.

[0077] Optionally, the routing solutions may be presented in the form of a list.

[0078] For example, Figure 3 As shown, an operation schematic diagram of presenting a routing scheme is shown, by selecting a starting facility and an ending facility, and selecting a routing scheme with the highest quality assessment parameter of the same route number (i.e., selecting protection), a routing scheme with the highest quality assessment parameter of the number of nodes (i.e., the least nodes), a routing scheme with the highest quality assessment parameter of the route loss (i.e., the lowest loss), a routing scheme with the highest route distance assessment parameter (i.e., the shortest path), or a routing scheme with the highest resource occupancy rate route distance assessment parameter (i.e., the lowest occupancy rate or the maximum number of idle nodes), and then presenting the connections of each node in the routing scheme in the form of a list.

[0079] For example, Figure 4 As shown, a schematic diagram of presenting a routing solution is shown, in which the routing solution includes node 1, node 3 and node 4, and node 1, node 3 and node 4 are connected by an optical cable 2.

[0080] Optionally, the routing solutions may be presented through a geographic information system (GIS) map, and a mouse may be placed on each routing solution to present the quality status corresponding to each routing solution.

[0081] For example, Figure 5 As shown, a schematic diagram of a routing solution presented on a GIS map is shown. In the figure, the blocks on the line are the starting nodes, the dots are the intermediate nodes, the position indicated by the arrow is the ending node, the starting node and the intermediate nodes can be optical cross-connection boxes, optical fiber distribution boxes, optical terminal boxes, optical joint boxes, electric poles, manholes, and the ending node can be a site.

[0082] In a possible implementation, the building where the user is located can be combined with the nearby network resources (i.e., network equipment), and then the network resources near the building can be analyzed with the user as the center, and the branch route can be analyzed to solve the problem that the "last mile" resources cannot be obtained, and the trunk route and the branch route can be analyzed using the same set of standards. Preferably, the routing scheme is evaluated by additional conditions, which effectively solves the problem that small routing schemes cannot be accurately analyzed. For a starting node, other routing nodes connected to the starting node can be traversed based on the breadth-first algorithm, and multiple routing schemes can be constructed based on the connection relationship between the starting node, other routing nodes, and each node, to solve the problem that the routing scheme can only be determined based on two nodes and only one routing scheme can be returned. At the same time, by performing quality analysis on each routing scheme, the quality evaluation parameters corresponding to each routing scheme can be obtained, and the target routing scheme to be constructed can be determined according to the quality evaluation parameters corresponding to each routing scheme, so that the accuracy and rationality of determining the routing scheme to be constructed can be improved, and the efficiency and accuracy of determining the routing scheme can be improved.

[0083] In one design, Figure 6 As shown, a method for determining a routing scheme provided in an embodiment of the present application, at least one routing node includes: at least one intermediate node and at least one end node, the intermediate node has a data forwarding function, the end node has a signal transceiver function, and one end node corresponds to one routing scheme. The method in the above step S202 specifically includes S301-S303:

[0084] S301. For any starting node among at least one starting node, determine at least one target node connected to any starting node based on a breadth-first algorithm, and determine whether each of the at least one target node has a signal receiving and sending function.

[0085] It can be understood that for any one of the at least one starting node, at least one target node connected to any one of the starting nodes can be determined based on the breadth-first algorithm, and whether each of the at least one target node has a signal receiving and sending function can be determined.

[0086] Optionally, any starting node can be taken as the starting point, and any starting node can be added to the routing plan queue corresponding to any starting node, and then based on the breadth-first algorithm, an outward search is performed for at least one target node connected to any starting node, and it is determined whether each of the at least one target node has the function of sending and receiving signals.

[0087] It should be noted that the routing scheme queue corresponding to any starting node includes at least one routing scheme corresponding to any starting node.

[0088] S302: For any target node among the at least one target node, when it is determined that any target node does not have a signal receiving and sending function, determine any target node as an intermediate node corresponding to any starting node.

[0089] It can be understood that, for any target node among the at least one target node, when it is determined that any target node does not have a signal receiving and sending function, any target node can be determined as an intermediate node corresponding to any starting node.

[0090] Optionally, if any of the at least one target node does not have a signal receiving and sending function, any target node is determined as an intermediate node corresponding to any starting node, and the intermediate node is added to the routing plan corresponding to the intermediate node in the routing plan queue corresponding to any starting node.

[0091] S303: When it is determined that any target node has a signal receiving and sending function, any target node is determined as an end node corresponding to any start node.

[0092] It can be understood that when it is determined that any target node has a signal receiving and sending function, any target node can be determined as an end node corresponding to any start node.

[0093] Optionally, if any target node is the end node corresponding to any starting node, the end node is added to the routing plan corresponding to the end node in the routing plan queue corresponding to any starting node, and the routing plan corresponding to the end node is composed of any starting node, the end node and any intermediate node between the starting node and the end node.

[0094] It should be noted that if there is only one target node and the target node is the end node, there is no intermediate node between any starting node and the end node, and then any starting node and the end node constitute the routing solution corresponding to the end node.

[0095] In one possible implementation, only one starting node can be targeted, and the intermediate nodes and the end nodes connected to the starting node can be traversed based on the breadth-first algorithm, and at least one routing plan can be constructed based on the starting node, the intermediate nodes, the end node, and the connection relationship between each node, so as to solve the problem in the background technology that the routing plan can only be determined based on two nodes and only one routing plan can be returned.

[0096] In one design, Figure 7 As shown, a method for determining a routing solution provided in an embodiment of the present application further includes S401-S404:

[0097] S401: When any target node is an intermediate node, perform a target operation on any target node.

[0098] It can be understood that when any target node is an intermediate node, the target operation can be performed on any target node.

[0099] It should be noted that the “target operation” in the above step S401 specifically includes S402-S404:

[0100] S402: Determine at least one first node directly connected to any target node based on a breadth-first algorithm, and determine whether each of the at least one first node has a signal receiving and sending function.

[0101] It can be understood that at least one first node directly connected to any target node can be determined based on the breadth-first algorithm, and whether each of the at least one first node has a signal receiving and sending function can be determined.

[0102] S403: For any first node among the at least one first node, when it is determined that any first node does not have a signal receiving and sending function, determine any first node as an intermediate node corresponding to any starting node.

[0103] It can be understood that, for any first node among the at least one first node, when it is determined that any first node does not have a signal receiving and sending function, any first node can be determined as an intermediate node corresponding to any starting node.

[0104] S404: When it is determined that any first node has a signal receiving and sending function, any first node is determined as an end node corresponding to any start node.

[0105] It can be understood that when it is determined that any first node has a signal receiving and sending function, any first node can be determined as an end node corresponding to any start node.

[0106] In one possible implementation, an undirected scatter graph corresponding to all network devices within a preset range can be constructed based on a graph computing engine (i.e., one network device corresponds to one node), and a starting point (i.e., the start node) and an end point (i.e., the end node) can be manually set in all nodes. Then, an electronic device is used to traverse from the position corresponding to the starting point to find a node connected to the starting point. If the target point (i.e., the end point) is found during the traversal process, the traversal path (i.e., a routing plan) is automatically backtracked and recorded by the electronic device to achieve uninterrupted return of reachable paths, forming a path set (i.e., multiple routing plans), thereby solving the problem of being unable to search for routing plans with a mesh structure, increasing the number of route planning items that can be processed per unit time, increasing the number of routing plans that can be analyzed, and solving the problem of being unable to accurately analyze important and complex routing plans.

[0107] In one design, Figure 8 In a method for determining a routing solution provided in an embodiment of the present application, the method further includes S501-S502:

[0108] S501: Determine whether the number of routing nodes included in each of a plurality of routing solutions is greater than a preset threshold.

[0109] It can be understood that it can be determined whether the number of routing nodes included in each of the multiple routing solutions is greater than a preset threshold.

[0110] Optionally, the traversal level of the graph computing engine can be set according to the network structure through the rule engine. Specifically, a preset threshold value can be set for the number of routing nodes included in the traversed routing solution.

[0111] Exemplarily, the number of access rooms in the routing nodes included in the routing solution can be set to 3, 4 or 5, and the number of optical devices in the routing nodes included in the routing solution can be set to 10, 15 or 20.

[0112] S502: When it is determined that the number of routing nodes included in any routing solution is greater than a preset threshold, delete any routing solution.

[0113] It can be understood that when it is determined that the number of routing nodes included in any routing solution is greater than a preset threshold, any routing solution can be deleted.

[0114] Optionally, if the number of routing nodes in any routing scheme obtained by traversing the graph computing engine has exceeded a preset threshold, but the computer room with a signal (i.e., the end node) has not been found, the current search is abandoned, the traversal path can be discarded (i.e., no further search for routing nodes), and the routing scheme is deleted from the routing scheme queue where the routing scheme is located.

[0115] In one design, Fig. 9 As shown, a method for determining a routing solution provided in an embodiment of the present application further includes S601-S602:

[0116] S601: Determine whether the routing nodes included in each of the multiple routing schemes include a second node.

[0117] Among them, the second node is a preset intermediate node.

[0118] It can be understood that it can be determined whether the routing nodes included in each of the multiple routing schemes include the second node.

[0119] Optionally, a preset node (ie, the second node) may be set for the intermediate nodes included in the plurality of routing solutions through a rule engine.

[0120] Exemplarily, the preset node may be a necessary point.

[0121] S602: When it is determined that the routing nodes included in any routing scheme do not include the second node, delete any routing scheme.

[0122] It can be understood that when it is determined that any routing scheme includes no second node in the routing nodes, any routing scheme can be deleted.

[0123] Optionally, a plurality of routing schemes may be traversed by a graph computing engine, and if any of the plurality of routing schemes does not include a preset node, the routing scheme is deleted from the plurality of routing schemes.

[0124] In a possible implementation, the mandatory points may be set to selectively filter the routing solutions in the routing solution queue that do not pass through the mandatory points, so as to process the routing solutions with special requirements.

[0125] In one design, Fig.10 As shown, a method for determining a routing solution provided in an embodiment of the present application, the method in the above step S204 specifically includes S701-S702:

[0126] S701: For any routing scheme among multiple routing schemes, determine multiple target parameters corresponding to any routing scheme.

[0127] The multiple target parameters include at least one of the following: the number of identical routes, the number of nodes, route attenuation, route distance, and resource occupancy rate.

[0128] It can be understood that for any routing scheme among the multiple routing schemes, multiple target parameters corresponding to any routing scheme can be determined.

[0129] S702: Determine a quality evaluation parameter corresponding to any routing solution according to multiple target parameters corresponding to any routing solution and a weight parameter corresponding to each of the multiple target parameters.

[0130] It can be understood that the quality evaluation parameter corresponding to any routing scheme can be determined according to multiple target parameters corresponding to any routing scheme and a weight parameter corresponding to each of the multiple target parameters.

[0131] Optionally, a weight parameter corresponding to each of the multiple target parameters may be set by a rule engine, and then a quality evaluation parameter corresponding to any routing solution may be obtained by a weighted average formula.

[0132] Exemplarily, the weight parameter corresponding to the number of routes can be 0.3, the weight parameter corresponding to the number of nodes can be 0.2, the weight parameter corresponding to the routing loss can be 0.1, the weight parameter corresponding to the routing distance can be 0.1, and the weight parameter corresponding to the resource occupancy rate can be 0.3. Then the quality assessment parameter corresponding to any routing scheme can be: number of routes*0.3+number of nodes*0.2+routing loss*0.1+routing distance*0.1+resource occupancy rate*0.3.

[0133] In one implementation, the condition combination corresponding to the routing scheme can be obtained by adjusting the weight value of each target parameter, so as to determine the priority of each routing scheme among multiple routing schemes through the condition combination, and the optimal and most accurate routing scheme can be determined from multiple routing schemes by optimizing the condition combination corresponding to the routing scheme.

[0134] In one implementation, Fig.11 As shown, a flow chart of presenting a routing solution is shown, which can obtain building information, obtain resource information based on the building information, set the starting point according to the resource information, and search for associated resources based on the starting point to determine whether the associated resources have a resource association relationship with the starting point. If it is determined that the associated resource has a resource association relationship with the starting point, the associated resource is determined as an intermediate node; if it is determined that the associated resource has no resource association relationship with the starting point, it is further determined whether the associated resource has a routing relationship with the starting point. If it is determined that the associated resource has a routing relationship with the starting point, the associated resource is determined as an intermediate node; if it is determined that the associated resource has no routing relationship with the starting point, the associated resource is cleared from the routing queue and the path search is terminated.

[0135] Further, the intermediate node is added to the routing queue, and it is determined whether the intermediate node is an end node. If it is determined that the intermediate node is an end node, the end node is added to the routing queue, and the routing queue is added to the routing plan list, and it is further determined whether there are necessary points in the routing plan included in the routing plan list; if it is determined that the intermediate node is not an end node, it is further determined whether the number of intermediate nodes reaches the upper limit of the search level. If it is determined that there are necessary points in the routing plan list, the same route analysis, node number analysis, attenuation analysis, occupancy analysis and distance analysis are performed, and then the plan priority is determined, and finally the routing plan is presented; if it is determined that there are necessary points in the routing plan list, the routing plan without necessary points is deleted. If it is determined that the number of intermediate nodes reaches the upper limit of the search level, the intermediate node is cleared from the routing queue and the path search is terminated; if it is determined that the number of intermediate nodes does not reach the upper limit of the search level, the search for associated resources based on the intermediate node continues.

[0136] In one implementation, Fig.12 As shown, a schematic diagram of the number of routing solutions is shown, in which the horizontal axis represents the sampling points, the vertical axis represents the number of routing solutions, the first line of the first figure is a line graph of the number of routing solutions completed per unit time when the automatic routing solution is used, the second line graph of the first figure is a line graph of the number of routing solutions completed per unit time in the traditional routing design solution, the first line graph of the second figure is a line graph of the number of routing solutions that need to be repeatedly adjusted in the traditional routing design solution, and the second line graph of the second figure is a line graph that needs to be repeatedly adjusted when the automatic routing solution is used. In the traditional routing design solution, the routing solution needs to be designed and corrected manually, resulting in a small number of routing solutions that can be completed per unit time, and a large number of routing solutions that need to be adjusted, which is not conducive to improving the efficiency of engineering construction. The automatic routing solution can significantly increase the number of routing solutions that can be completed per unit time, and significantly reduce the number of routing solutions that need to be repeatedly adjusted.

[0137] The embodiment of the present application provides a method for automatically analyzing a routing solution and determining a routing solution system. On the one hand, the present application uses GIS visualization technology to present the routing solution analysis results, and intuitively and clearly displays the routing solution and the revised routing solution; on the other hand, based on the image calculation and recognition engine (i.e., the graph calculation engine), combined with the breadth-first analysis algorithm, the complex routing solution is judged, and according to the established routing solution scoring standard, by comparing multiple routing solutions, the routing solution is automatically and intelligently judged to select the optimal routing solution from multiple routing solutions. The present application mainly performs intelligent analysis on complex routing solutions, single-point routing solutions, and network-like routing solutions, and analyzes the corresponding optimal routing solutions to serve the front-line production.

[0138] Specifically, Fig.13 As shown, a schematic diagram of determining a routing solution is shown. This application takes the graph calculation engine and the rule engine in the routing analysis engine as the leading ones. By injecting the algorithms in the graph calculation engine and the rule engine into the routing solution, it enables the building access network resources, necessary points, traversal levels, multi-path solutions and GIS presentation of the solution. Finally, the solution quality is analyzed based on the comprehensive evaluation rules. The comprehensive evaluation rules of the solution quality include same-route calculation, attenuation calculation, distance calculation and node number calculation, so as to realize all-round and multi-angle intelligent analysis and presentation of the routing solution.

[0139] The above mainly introduces the solution provided by the embodiment of the present application from the perspective of the method. In order to realize the above functions, it includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of each example described in the embodiment disclosed herein, the embodiment of the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present application.

[0140] The embodiment of the present application can divide the functional modules of a routing scheme determination method according to the above method example. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules. Optionally, the division of modules in the embodiment of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation.

[0141] Fig.14 A schematic diagram of the structure of a routing solution determination device provided in an embodiment of the present application. Fig.14 As shown, a routing solution determining device 40 is used to improve the efficiency and accuracy of determining a routing solution, for example, for executing Figure 2 A method for determining a routing solution is shown. The routing solution determining device 40 comprises: an acquiring unit 401, a processing unit 402 and a determining unit 403;

[0142] An acquisition unit 401 is used to acquire at least one starting node corresponding to a target building;

[0143] The processing unit 402 is used to construct multiple routing schemes based on at least one starting node, where one starting node corresponds to at least one routing scheme, and the starting node is a network device that is less than a preset distance from a target building and has an associated relationship with the target building;

[0144] A determining unit 403 is configured to determine, for any starting node among the at least one starting node, at least one routing node corresponding to any starting node based on a breadth-first algorithm, wherein each routing node among the at least one routing node has a connection relationship with any starting node;

[0145] The processing unit 402 is further configured to use each routing node in the at least one routing node as a node in at least one routing scheme corresponding to any starting node according to the connection relationship between the at least one routing node and any starting node, and one routing node corresponds to at least one routing scheme;

[0146] The processing unit 402 is further configured to perform a quality analysis on each of the plurality of routing schemes to obtain a quality evaluation parameter corresponding to each routing scheme, wherein the quality analysis includes at least one of the following: determining the number of identical routes, determining the number of nodes, determining routing attenuation, determining routing distance, and determining resource occupancy;

[0147] The determining unit 403 is further configured to determine the target routing scheme to be constructed according to the quality evaluation parameters corresponding to each routing scheme.

[0148] In one possible implementation, at least one routing node includes: at least one intermediate node and at least one end node, the intermediate node has a data forwarding function, the end node has a signal receiving and sending function, and one end node corresponds to one routing plan; the determination unit 403 is also used to determine at least one target node connected to any starting node based on a breadth-first algorithm, and to determine whether each target node in at least one target node has a signal receiving and sending function; the determination unit 403 is also used to, for any target node in at least one target node, when it is determined that any target node does not have a signal receiving and sending function, determine any target node as an intermediate node corresponding to any starting node; the determination unit 403 is also used to determine any target node as an end node corresponding to any starting node when it is determined that any target node has a signal receiving and sending function.

[0149] In one possible implementation, the processing unit 402 is further used to perform a target operation on any target node when any target node is an intermediate node; the determination unit 403 is further used to determine at least one first node directly connected to any target node based on a breadth-first algorithm, and to determine whether each of the at least one first node has a signal receiving and sending function; the determination unit 403 is further used to, for any first node among the at least one first node, determine any first node as an intermediate node corresponding to any starting node when it is determined that any first node does not have a signal receiving and sending function; the determination unit 403 is further used to determine any first node as an end node corresponding to any starting node when it is determined that any first node has a signal receiving and sending function.

[0150] In a possible implementation, the determination unit 403 is further used to determine whether the number of routing nodes included in each of the multiple routing schemes is greater than a preset threshold; the processing unit 402 is further used to delete any routing scheme when it is determined that the number of routing nodes included in any routing scheme is greater than the preset threshold.

[0151] In a possible implementation, the determination unit 403 is further used to determine whether the routing nodes included in each of the multiple routing schemes include a second node, where the second node is a preset intermediate node; the processing unit 402 is further used to delete any routing scheme when it is determined that the routing nodes included in any routing scheme do not include the second node.

[0152] In a possible implementation, the determination unit 403 is further used to determine, for any routing scheme among the multiple routing schemes, multiple target parameters corresponding to any routing scheme, where the multiple target parameters include at least one of the following: the number of identical routes, the number of nodes, routing attenuation, routing distance, and resource occupancy rate; the determination unit 403 is further used to determine the quality assessment parameter corresponding to any routing scheme based on the multiple target parameters corresponding to any routing scheme and the weight parameter corresponding to each of the multiple target parameters.

[0153] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, the embodiment of the present application provides a possible structural diagram of the electronic device involved in the above-mentioned embodiment. Fig.15 As shown, an electronic device 60 is used to improve the efficiency and accuracy of determining a routing solution, for example, for performing Figure 2 A method for determining a routing solution is shown. The electronic device 60 includes a processor 601, a memory 602, and a bus 603. The processor 601 and the memory 602 may be connected via a bus 603.

[0154] The processor 601 is the control center of the communication device, which can be a processor or a general term for multiple processing elements. For example, the processor 601 can be a general-purpose central processing unit (CPU) or other general-purpose processors. Among them, the general-purpose processor can be a microprocessor or any conventional processor.

[0155] As an embodiment, the processor 601 may include one or more CPUs, such as Fig.15 CPU 0 and CPU 1 are shown in .

[0156] The memory 602 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited to these.

[0157] As a possible implementation, the memory 602 can exist independently of the processor 601, and the memory 602 can be connected to the processor 601 via a bus 603 to store instructions or program codes. When the processor 601 calls and executes the instructions or program codes stored in the memory 602, a method for determining a routing solution provided in an embodiment of the present application can be implemented.

[0158] In another possible implementation, the memory 602 may also be integrated with the processor 601 .

[0159] The bus 603 may be an industry standard architecture (ISA) bus, a peripheral component interconnect (PCI) bus, or an extended industry standard architecture (EISA) bus. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.15 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0160] It should be pointed out that Fig.15 The structure shown does not constitute a limitation on the electronic device 60. Fig.15 In addition to the components shown, the electronic device 60 may include more or fewer components than shown, or combine certain components, or arrange the components differently.

[0161] As an example, combining Fig.14 The functions implemented by the acquisition unit 401, the processing unit 402 and the determination unit 403 in the routing solution determination device 40 are similar to those Fig.15 The function of processor 601 in is the same.

[0162] Optional, such as Fig.15 As shown, the electronic device 60 provided in the embodiment of the present application may further include a communication interface 604 .

[0163] The communication interface 604 is used to connect with other devices through a communication network. The communication network may be Ethernet, wireless access network, wireless local area network (WLAN), etc. The communication interface 604 may include a receiving unit for receiving data and a sending unit for sending data.

[0164] In one design, in the electronic device provided in the embodiment of the present application, the communication interface can also be integrated into the processor.

[0165] Through the description of the above implementation methods, those skilled in the art can clearly understand that for the convenience and simplicity of description, only the division of the above functional units is used as an example. In practical applications, the above functions can be assigned to different functional units as needed, that is, the internal structure of the device can be divided into different functional units to complete all or part of the functions described above. The specific working process of the system, device and unit described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0166] An embodiment of the present application also provides a computer-readable storage medium, in which instructions are stored. When a computer executes the instructions, the computer executes each step in the method flow shown in the above method embodiment.

[0167] An embodiment of the present application provides a computer program product including instructions. When the instructions are executed on a computer, the computer is enabled to execute a routing solution determination method in the above method embodiment.

[0168] Among them, the computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection with one or more wires, a portable computer disk, a hard disk. Random access memory (random access memory, RAM), read-only memory (read-only memory, ROM), erasable programmable read only memory (erasable programmable read only memory, EPROM), registers, hard disks, optical fibers, portable compact disc read-only memory (compact disc read-only memory, CD-ROM), optical storage devices, magnetic storage devices, or the above in a suitable combination, or any other form of computer-readable storage medium known in the art.

[0169] An exemplary storage medium is coupled to a processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an application specific integrated circuit (ASIC).

[0170] In the embodiments of the present application, a computer-readable storage medium may be any tangible medium that contains or stores a program, which may be used by or in conjunction with an instruction execution system, apparatus, or device.

[0171] Since the electronic device, computer-readable storage medium, and computer program product in the embodiments of the present application can be applied to the above-mentioned method, the technical effects that can be obtained can also refer to the above-mentioned method embodiments, and the embodiments of the present application will not be repeated here.

[0172] The above are only specific implementation methods of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application.

Claims

1. A method for determining a routing solution, characterized in that: The method comprises: Acquire at least one starting node corresponding to the target building, and construct multiple routing schemes based on the at least one starting node, one starting node corresponding to at least one routing scheme, the starting node being a network device that is less than a preset distance from the target building and has an associated relationship with the target building; For any one of the at least one starting node, determine at least one routing node corresponding to the any one of the starting nodes based on a breadth-first algorithm, each of the at least one routing node having a connection relationship with the any one of the starting nodes; According to the connection relationship between the at least one routing node and the any starting node, each routing node in the at least one routing node is used as a node in at least one routing scheme corresponding to the any starting node, and one routing node corresponds to at least one routing scheme; Perform a quality analysis on each of the multiple routing schemes to obtain a quality assessment parameter corresponding to each routing scheme, and determine a target routing scheme to be constructed based on the quality assessment parameter corresponding to each routing scheme, wherein the quality analysis includes at least one of the following: determining the number of identical routes, determining the number of nodes, determining routing attenuation, determining routing distance, and determining resource occupancy.

2. The method according to claim 1, characterized in that: The at least one routing node includes: at least one intermediate node and at least one end node, the intermediate node has a data forwarding function, the end node has a signal transceiver function, and one end node corresponds to one routing solution; The determining at least one routing node corresponding to any starting node based on a breadth-first algorithm includes: Determine at least one target node connected to any one of the starting nodes based on the breadth-first algorithm, and determine whether each of the at least one target node has a signal receiving and sending function; For any target node among the at least one target node, when it is determined that the any target node does not have a signal receiving and sending function, determining the any target node as an intermediate node corresponding to the any starting node; When it is determined that any of the target nodes has a signal receiving and sending function, the any of the target nodes is determined as an end node corresponding to any of the start nodes.

3. The method according to claim 2, characterized in that The method further comprises: When any of the target nodes is an intermediate node, performing a target operation on the any of the target nodes; The target operations include: Determine at least one first node directly connected to any target node based on the breadth-first algorithm, and determine whether each of the at least one first node has a signal receiving and sending function; For any first node among the at least one first node, when it is determined that the any first node does not have a signal receiving and sending function, determining the any first node as an intermediate node corresponding to the any starting node; When it is determined that any of the first nodes has a signal receiving and sending function, the any of the first nodes is determined as an end node corresponding to any of the start nodes.

4. The method according to any one of claims 1 to 3, characterized in that The method further comprises: Determining whether the number of routing nodes included in each of the multiple routing solutions is greater than a preset threshold; When it is determined that the number of routing nodes included in any routing solution is greater than the preset threshold, the any routing solution is deleted.

5. The method according to any one of claims 1 to 3, characterized in that The method further comprises: Determining whether the routing nodes included in each of the plurality of routing schemes include a second node, where the second node is a preset intermediate node; When it is determined that the routing nodes included in any routing scheme do not include the second node, the any routing scheme is deleted.

6. The method according to any one of claims 1 to 3, characterized in that The performing of quality analysis on each of the plurality of routing schemes to obtain a quality evaluation parameter corresponding to each routing scheme includes: For any routing scheme among the multiple routing schemes, determine multiple target parameters corresponding to the any routing scheme, the multiple target parameters including at least one of the following: number of same routes, number of nodes, routing attenuation, routing distance, and resource occupancy rate; The quality evaluation parameter corresponding to any routing scheme is determined according to the multiple target parameters corresponding to any routing scheme and the weight parameter corresponding to each of the multiple target parameters.

7. A routing solution determination device, characterized in that: The routing solution determination device comprises: an acquisition unit, a processing unit and a determination unit; The acquisition unit is used to acquire at least one starting node corresponding to the target building; The processing unit is used to construct multiple routing schemes based on the at least one starting node, one starting node corresponds to at least one routing scheme, and the starting node is a network device that is less than a preset distance from the target building and has an associated relationship with the target building; The determining unit is configured to determine, for any one of the at least one starting node, at least one routing node corresponding to the any one starting node based on a breadth-first algorithm, wherein each of the at least one routing node has a connection relationship with the any one of the starting nodes; The processing unit is further configured to use, according to a connection relationship between the at least one routing node and the any starting node, each routing node in the at least one routing node as a node in at least one routing scheme corresponding to the any starting node, wherein one routing node corresponds to at least one routing scheme; The processing unit is further used to perform quality analysis on each of the multiple routing schemes to obtain a quality evaluation parameter corresponding to each routing scheme, wherein the quality analysis includes at least one of the following: determining the number of identical routes, determining the number of nodes, determining routing attenuation, determining routing distance, and determining resource occupancy; The determining unit is further configured to determine the target routing scheme to be constructed according to the quality evaluation parameters corresponding to each routing scheme.

8. The routing solution determination device according to claim 7, characterized in that: The at least one routing node includes: at least one intermediate node and at least one end node, the intermediate node has a data forwarding function, the end node has a signal transceiver function, and one end node corresponds to one routing solution; The determining unit is further configured to determine at least one target node connected to any one of the starting nodes based on the breadth-first algorithm, and determine whether each of the at least one target node has a signal transceiver function; The determining unit is further configured to, for any target node among the at least one target node, determine the any target node as an intermediate node corresponding to the any starting node when it is determined that the any target node does not have a signal receiving and sending function; The determining unit is further configured to determine the any target node as an end node corresponding to the any start node when it is determined that the any target node has a signal receiving and sending function.

9. The routing solution determination device according to claim 8, characterized in that: The processing unit is further configured to, when any of the target nodes is an intermediate node, perform a target operation on the any of the target nodes; The determining unit is further configured to determine at least one first node directly connected to any target node based on the breadth-first algorithm, and determine whether each of the at least one first node has a signal receiving and sending function; The determining unit is further configured to, for any first node among the at least one first node, determine the any first node as an intermediate node corresponding to the any starting node when it is determined that the any first node does not have a signal receiving and sending function; The determining unit is further configured to determine the any first node as an end node corresponding to the any starting node when it is determined that the any first node has a signal receiving and sending function.

10. The routing solution determination device according to any one of claims 7 to 9, characterized in that: The determining unit is further configured to determine whether the number of routing nodes included in each of the plurality of routing schemes is greater than a preset threshold; The processing unit is further configured to delete any routing scheme when it is determined that the number of routing nodes included in any routing scheme is greater than the preset threshold.

11. The routing solution determination device according to any one of claims 7 to 9, characterized in that: The determining unit is further configured to determine whether the routing nodes included in each of the plurality of routing schemes include a second node, where the second node is a preset intermediate node; The processing unit is further configured to delete any routing scheme when it is determined that the routing nodes included in any routing scheme do not include the second node.

12. The routing solution determination device according to any one of claims 7 to 9, characterized in that: The determining unit is further configured to determine, for any one of the multiple routing schemes, a plurality of target parameters corresponding to the any one of the multiple routing schemes, wherein the plurality of target parameters include at least one of the following: the number of identical routes, the number of nodes, routing attenuation, routing distance, and resource occupancy rate; The determining unit is further configured to determine a quality evaluation parameter corresponding to any routing scheme according to the multiple target parameters corresponding to any routing scheme and a weight parameter corresponding to each of the multiple target parameters.

13. An electronic device, characterized in that: include: A processor and a memory; wherein the memory is used to store one or more programs, and the one or more programs include computer-executable instructions. When the electronic device is running, the processor executes the computer-executable instructions stored in the memory to enable the electronic device to perform a routing solution determination method described in any one of claims 1-6.

14. A computer-readable storage medium storing one or more programs, characterized in that: The one or more programs include instructions, which, when executed by a computer, enable the computer to perform a routing solution determination method according to any one of claims 1 to 6.

Citation Information

Cited By

  • Linkage communication path optimization method for multi-stage cascaded wireless fire fighting system

    CN121442310A

  • A method for optimizing the linkage communication path of a multi-level cascaded wireless fire protection system

    CN121442310B