WO2022012576A1 - 路径规划方法、装置、路径规划设备及存储介质 - Google Patents
路径规划方法、装置、路径规划设备及存储介质 Download PDFInfo
- Publication number
- WO2022012576A1 WO2022012576A1 PCT/CN2021/106211 CN2021106211W WO2022012576A1 WO 2022012576 A1 WO2022012576 A1 WO 2022012576A1 CN 2021106211 W CN2021106211 W CN 2021106211W WO 2022012576 A1 WO2022012576 A1 WO 2022012576A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- planned
- path planning
- data
- information
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 75
- 230000005540 biological transmission Effects 0.000 claims abstract description 193
- 239000011159 matrix material Substances 0.000 claims description 54
- 238000012546 transfer Methods 0.000 claims description 31
- 230000008569 process Effects 0.000 claims description 22
- 238000010586 diagram Methods 0.000 description 16
- 238000004590 computer program Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 6
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 229920006395 saturated elastomer Polymers 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/30—Routing of multiclass traffic
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Definitions
- Embodiments of the present invention relate to the technical field of network communications, and in particular, to a path planning method, apparatus, path planning device, and storage medium.
- One object of the embodiments of the present invention is to provide a path planning method, device, path planning device and storage medium, so as to effectively solve the problem of how to balance the load of each routing section.
- an embodiment of the present invention provides a path planning method.
- the path planning method includes: for currently to-be-planned routing information, where the routing information includes information of a source node and information of a target node, the following path planning process is performed: Determine the transferable direction from the source node to the target node according to the information of the source node and the target node; take the source node as the current node, according to the current node and the adjacent nodes in the transferable direction The amount of data that has been planned to be transmitted between, and the next transmission node is determined from all nodes adjacent in the transmittable direction; in the case that the next transmission node is the target node, according to the source The node, the target node, and the transmission node between the source node and the target node determine a planned transmission path from the source node to the target node.
- an embodiment of the present invention provides a path planning apparatus, where the path planning apparatus includes: a transmission direction determination module, which is configured to: for currently to-be-planned routing information, the routing information includes source node information and a destination the information of the node, according to the information of the source node and the information of the target node, to determine the transmittable direction from the source node to the target node; the node selection module, which is configured to: take the source node as the current node, according to the current node and the amount of data that has been planned to be transmitted between the adjacent nodes in the transmittable direction, determine the next transmission node from all the adjacent nodes in the transmittable direction; a path generation module, which is configured is: in the case that the next transmission node determined by the node selection module is the target node, according to the source node, the target node, and the relationship between the source node and the target node The transmission node determines a planned transmission path from the source node to the target node.
- a transmission direction determination module which
- an embodiment of the present invention provides a path planning device, including: a processor, a memory, and a program stored on the memory and executable on the processor, when the program is executed by the processor The steps of implementing the path planning method described in the first aspect.
- an embodiment of the present invention provides a readable storage medium, where a program is stored on the readable storage medium, and when the program is executed by a processor, the steps of the path planning method according to the first aspect are implemented.
- FIG. 1 is a flowchart of a path planning method provided by an embodiment of the present invention.
- FIG. 2 is a flow chart of a manner of determining a transmittable direction from a source node to a target node.
- FIG. 3 is a schematic diagram of a topology structure of a transmission network.
- FIG. 4 is a flowchart of another path planning method provided by an embodiment of the present invention.
- FIG. 5 is a flowchart of still another path planning method provided by an embodiment of the present invention.
- FIG. 6 is a schematic structural diagram of a path planning apparatus according to an embodiment of the present invention.
- FIG. 7 is a schematic structural diagram of another path planning apparatus according to an embodiment of the present invention.
- FIG. 8 is a schematic structural diagram of still another path planning apparatus according to an embodiment of the present invention.
- FIG. 9 is a schematic structural diagram of a path planning device according to an embodiment of the present invention.
- words such as “exemplary” or “for example” are used to mean serving as an example, illustration or illustration. Any embodiments or designs described as “exemplary” or “such as” in the embodiments of the present invention should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as “exemplary” or “such as” is intended to present the related concepts in a specific manner.
- FIG. 1 is a flowchart of a path planning method provided by an embodiment of the present invention.
- an embodiment of the present invention provides a path planning method.
- the path planning method includes: for currently to-be-planned routing information, perform the following path Planning process: Steps 101 to 105.
- Step 101 Determine the transmittable direction from the source node to the target node according to the information of the source node and the information of the target node.
- the routing information to be planned includes the information of the source node to be planned, the information of the target node, and the amount of data to be transmitted.
- the information of the source node includes but is not limited to: the identity and location information of the source node
- the information of the target node includes but is not limited to: the identity and location information of the target node.
- the path planning method is applied to a transmission network
- the nodes in the transmission network are routing nodes
- the nodes are used to transmit data through routing
- the source node refers to the routing node corresponding to the sending end of the data
- the target node is the routing node. Refers to the routing node corresponding to the receiving end of the data.
- the transmission network may be an on-chip network of many-core chips.
- the many-core chip includes an on-chip network and multiple cores.
- the on-chip network includes multiple routing nodes.
- the routing nodes and cores are set in one-to-one correspondence.
- the corresponding routing node performs data transmission with other cores.
- the node of the transmission network can be the routing node corresponding to the core in the on-chip network.
- One of the cores that is, the path planning method in the embodiment of the present invention can be used to plan a data transmission path between cores on a many-core chip.
- the transmission network is a network composed of routing nodes corresponding to chips or devices, the nodes of the transmission network are routing nodes corresponding to the chips or devices, and any chip or device can communicate with other chips or devices through the corresponding routing nodes.
- the sending end and the receiving end may both be a single chip or device, that is, the path planning method in the embodiment of the present invention may be used to plan a data transmission path between chips or between devices.
- the transferable direction from the source node to the target node refers to all optional data transfer directions from the source node to the target node. Starting from the source node, the data to be transferred is transmitted along the transferable direction. A transfer is made to reach the destination node.
- FIG. 2 is a flow chart of a method for determining a transmittable direction from a source node to a target node. Referring to FIG. 2 , in some embodiments, step 101 may further include step 1011 and step 1012 .
- Step 1011 Determine the relative positional relationship between the target node and the source node according to the location information of the source node and the location information of the target node.
- Step 1012 Determine the transmittable direction from the source node to the target node according to the relative positional relationship between the target node and the source node.
- the location information of the source node and the location information of the target node determine the direction in which the target node is located below the right side of the source node, so as to determine the transferable direction from the source node to the target node, including the left-to-right transfer direction and the self-transmitting direction. Up and down transfer direction.
- FIG. 3 is a schematic diagram of a topology structure of a transmission network.
- the routing information to be planned currently includes: the information of the source node a1, the information of the target node a2, and the amount of data A to be transmitted.
- the network topology structure, the target node a2 is located at the lower right side of the source node a1, therefore, in step 101, it is determined that the transferable direction from the source node a1 to the target node a2 is the direction of the right transfer and the downward transfer direction. direction.
- the topology of the transmission network shown in FIG. 3 is a two-dimensional network topology (for example, a 2D mesh network), and the path planning method in the embodiment of the present invention can also be applied to a transmission network with a multi-dimensional network topology, such as Three-dimensional network, four-dimensional network, five-dimensional network, etc.
- Step 102 Take the source node as the current node, and determine the next transmission from all the nodes adjacent to the transmittable direction according to the amount of data that has been planned to be transmitted between the current node and the adjacent nodes in the transmittable direction. node.
- step 102 from all nodes adjacent to the current node in the transmittable direction, the corresponding node with the smallest amount of data planned to transmit is used as the next transmission node.
- the next transmission node is the planned next-hop node of the current node.
- the amount of data planned to be transmitted between the current node and the adjacent node in the transmittable direction refers to the amount of data planned to be transmitted for the road segment from the current node to the adjacent node, that is, the current node and the adjacent node The amount of data that is planned to be transmitted between the nodes, but is not actually transmitted.
- the next transmission node can effectively avoid data detour transmission in the predetermined transmittable direction, and effectively avoid the transmission efficiency being affected by the long data transmission distance;
- a transmission node it is determined according to the minimum amount of data that has been planned to transmit, so that when path planning is performed for multiple routing information, each planned road segment (the road segment from the current node to the next transmission node) needs to be transmitted.
- the amount of data can be balanced, that is, the load balance of each planned road section can be achieved, which can effectively solve the problem that some road sections are overloaded and some road sections are not saturated in the prior art.
- the transmittable direction from the source node a1 to the target node a2 includes the right transmit direction and the down transmit direction.
- step 102 when the source node a1 is the current node, all nodes adjacent to the current node a1 in the transmittable direction include The node c1 adjacent to the current node a1 in the direction of transmission to the right, and the node d adjacent to the current node a1 in the direction of downward transmission; after determining that the current node a1 is adjacent in all transmittable directions All nodes, that is, after determining node c1 and node d, obtain the amount of data planned to be transmitted between the current node a1 and the adjacent node c1, and the amount of data planned to be transmitted between the current node a1 and the adjacent node d ; Compare the amount of data that has been planned to be transmitted between the current node a1 and the adjacent node c1, and the amount of data that has been planned to be transmitted between the current node a1 and the adjacent node
- any node with the smallest amount of data planned to be transmitted is used as the current node's next transport node.
- the transferable directions include the direction of transmission to the right and the direction of downward transmission.
- the adjacent nodes of the source node a1 in the direction of transmission to the right are node c1, and the source node The adjacent node of a1 in the downward transmission direction is node d, the amount of data planned to be transmitted between node a1 and node c1 is 0, and the amount of data planned to be transmitted between node a1 and node d is also 0, then Either node d or node c1 can be selected as the next transit node for node a1.
- the corresponding node with the smallest amount of data planned to be transmitted is compared with the previous node of the current node.
- a transit node is a node located in the same transmittable direction as the next transit node of the current node. It can be understood that the current node is the next transfer node of the previous transfer node.
- the next transfer node of source node b1 is node a1, and node a1 is the current node.
- the transferable directions include the direction of right transfer and the direction of downward transfer.
- node a1 is transferring to the right
- the adjacent node in the direction of transmission is node c1
- the adjacent node of source node a1 in the downward transmission direction is node d
- the amount of data planned to be transmitted between node a1 and node c1 is 0, and node a1 and node d
- the amount of data planned to be transmitted between them is also 0, then first determine that the previous transmission node of node a1 is the source node b1, the transmission direction from the previous transmission node b1 to node a1 is the downward transmission direction, and the transmission direction from node a1 to node a1
- the transmission direction of d is the downward transmission direction, that is, node d and the previous transmission node b1 of node
- Step 103 determine whether the next transmission node is the target node, if yes, go to step 105 , otherwise go to step 104 .
- step 104 determine whether the identifier or location of the next transit node is the identifier or location of the target node in the routing information to be planned currently, if so, determine that the next transit node is the target node, and execute step 105, otherwise, determine the next transit node is the transit node between the source node and the target node, that is, the next transit node is not the destination node, and step 104 is executed.
- Step 104 In the case that the next transmission node is not the target node, the next transmission node is used as the current node, and the execution is returned according to the amount of data that has been planned to be transmitted between the current node and the adjacent nodes in the transmittable direction, from The step of determining the next transit node among all nodes adjacent in the transmittable direction.
- step 104 in the case that the next transmission node is not the target node, the next transmission node is used as the current node, and the execution is returned according to the amount of data that has been planned to be transmitted between the current node and the adjacent nodes in the transmittable direction, The step of determining the next transit node from all the adjacent nodes in the transmittable direction, so as to continue to determine and plan the next transit node of the current node, and continue to perform step 103 until the final determined next transit node is to the target node.
- step 102 the next transfer node of the source node a1 is node d
- step 104 the next transfer node d is taken as the current node d
- the execution returns according to the current node and the available
- the amount of data planned to be transmitted between adjacent nodes in the transmission direction the steps of determining the next transmission node from all the adjacent nodes in the transmission direction, to determine the next transmission node of the current node d
- the next transmission node of the current node d is node b2
- the next transmission node b2 is regarded as the current node b2
- the execution returns according to the amount of data planned to be transmitted between the current node and the adjacent nodes in the transmittable direction, from The step of determining the next transit node among all the adjacent nodes in the transmittable direction, so as to determine the next transit node of the current node b2, at this time, the next transit node of the current node b2 is the node
- Step 105 In the case that the next transmission node is the target node, determine the planned transmission path from the source node to the target node according to the source node, the target node, and the transmission nodes between the source node and the target node.
- step 105 when the next transfer node is the target node, according to the source node, all the determined and planned transfer nodes and the target node between the determined source node and the target node, determine from the source node to the target node. planned transmission path. It should be noted that when there is no definite and planned transmission node between the source node and the target node, that is, when the next transmission node of the source node is the target node, in step 105, the source node and the target node can be directly Generate the planned transmission path from the source node to the destination node.
- the planned transmission path from the source node to the target node is a transmission path composed of the source node a1, the node d, the node b2, and the target node a2.
- data transmission can be performed according to the planned planned transmission path from the source node to the target node during subsequent data transmission for the source node and the target node.
- the current node and the adjacent nodes in the transmission direction are determined according to the current node.
- the amount of data that has been planned to be transmitted between them is determined, so that the planned load balance of each road segment from the source node to the target node (the road segment from the current node to the next transmission node of the current node) can effectively solve the existing problem.
- the load of some road sections is too large, while the load of some road sections is not saturated.
- FIG. 4 is a flowchart of another path planning method provided by an embodiment of the present invention. As shown in FIG. 4 , in some embodiments, before the above path planning process is performed for the currently to-be-planned routing information, the path planning method It also includes steps 1001 to 1003 .
- Step 1001 Acquire all routing information to be planned.
- the routing information to be planned refers to a transmission task or a routing task to be planned, and each routing information to be planned includes information of the corresponding source node, information of the corresponding target node, and corresponding information of the to-be-transmitted The amount of data.
- Step 1002 Sort all the routing information to be planned according to the descending order of the amount of data to be transmitted in each routing information, and determine the path planning sequence of each routing information.
- the path planning sequence may include the priority of each routing information, and the priority of each routing information is set in descending order according to the corresponding data volume to be transmitted. The priority is the highest, and the routing information corresponding to the smallest amount of data to be transmitted has the lowest priority.
- Step 1003 sequentially determine each routing information as the routing information to be planned currently, so as to perform a path planning process for each routing information.
- step 1003 according to the path planning sequence, routing information corresponding to a larger amount of data to be transmitted is prioritized for path planning, which can effectively improve the overall transmission efficiency of the transmission network.
- FIG. 5 is a flowchart of another path planning method provided by an embodiment of the present invention.
- the path planning method before the step of acquiring all routing information to be planned, that is, step 1001, the path planning method It also includes step S0: constructing an initial routing cost matrix according to the information of each node in the transmission network.
- the information of the node may include, but is not limited to, the identification of the node, location information, etc., and the location information may include location coordinates.
- the network topology type of the transmission network can be determined according to the information of the node. For example, if the location coordinates of the nodes are two-dimensional location coordinates, it can be determined that the transmission network is a two-dimensional network topology; the location coordinates of the nodes are three-dimensional location coordinates, then it can be determined that the transmission network has a three-dimensional network topology.
- an initial routing cost matrix of the corresponding dimension is constructed according to the network topology structure type of the transmission network. For example, if the network topology type of the transmission network is a two-dimensional network, the initial routing cost matrix is a two-dimensional matrix.
- the routing cost matrix includes the amount of data planned to be transmitted between any two adjacent nodes in the transmission network. Initially, in the initial routing cost matrix, the data planned to be transmitted between any two adjacent nodes The amount is zero.
- each element in the routing cost matrix may be a binary array, and for a two-dimensional transmission network, the binary array may be represented by (w1, w2), and each element of the routing cost matrix corresponds to the transmission
- w1 in the binary array can be used to indicate the amount of data that has been planned to be transmitted between the corresponding node and its adjacent nodes in the first transmission direction (such as the direction from left to right).
- the w2 in the tuple can be used to represent the amount of data planned to be transmitted between the corresponding node and the node adjacent to the node in the second transmission direction (eg, the top-down direction).
- an exemplary initial routing cost matrix is:
- the path planning method further includes step S1 : obtaining, according to the current routing cost matrix, the amount of data planned to be transmitted between the current node and adjacent nodes in the transmittable direction.
- the current routing cost matrix is the initial routing cost matrix.
- the amount of data planned to be transmitted between adjacent nodes in the transmission direction is all zero.
- the path planning method further includes step S2: according to the current to-be-planned The amount of data to be transmitted in the routing information is updated, and the amount of data planned to be transmitted between the current node and the next transmission node in the current routing cost matrix is updated.
- the amount of data to be transmitted is compared with the binary array (w1, w2) corresponding to the current node. ) in the w1 value is accumulated to update the binary array corresponding to the current node in the routing cost matrix.
- the amount of data to be transmitted is 10MB
- the binary array (w1, w2) corresponding to the current node is (0, 0), that is, the current value of w1 is 0, then the amount of data to be transmitted 10MB is compared with the current w1
- the values are accumulated, the updated w1 value is 10, and the binary array (w1, w2) corresponding to the current node is (10, 0).
- step S2 is performed once to update in real time the data used to record the planned transmission between any two adjacent nodes. Routing cost matrix for data volume. For the next routing information to be planned, based on the routing cost matrix updated during the path planning process for the previous routing information to be planned, perform path planning for the next routing information to be planned, and then perform path planning for the next routing information to be planned. In the process of path planning for a to-be-planned routing information, the routing cost matrix is updated in real time.
- taking the current routing information 1 to be planned includes the information of the source node a1, the information of the target node a2, and the amount of data A to be transmitted as an example, for the routing information 1 currently to be planned in the process of path planning
- the way to update the routing cost matrix is explained and explained.
- the routing information 1 currently to be planned is the routing information that is located at the first position in the above path planning sequence, and the binary arrays (w1, w2) corresponding to each element in the initial path cost matrix are both (0 , 0), after it is determined that the next transmission node of source node a1 is node d, the amount of data to be transmitted A and the current value of w2 in the binary array (w1, w2) corresponding to source node a1 in the routing cost matrix That is, 0 is accumulated to update the binary array corresponding to the source node a1 in the routing cost matrix, and the binary array corresponding to the source node a1 in the routing cost matrix is updated from (0, 0) to (0, A); After the next transmission node of node d is node b2, the amount of data to be transmitted A and the current value of w1 in the binary array (w1, w2) corresponding to node d in the routing cost matrix are accumulated to update the routing cost.
- the binary array corresponding to node d in the matrix, the binary array corresponding to node d in the routing cost matrix is updated from (0, 0) to (A, 0); the next transmission node after determining the source node b2 is the target node a2 Then, the amount of data to be transmitted A is accumulated with the current w1 value in the binary array (w1, w2) corresponding to node b2 in the routing cost matrix, that is, 0, to update the binary array corresponding to node b2 in the routing cost matrix, The binary array corresponding to node b2 in the routing cost matrix is updated from (0, 0) to (A, 0).
- the planned transmission path from the source node a1 to the target node a2 is a path composed of the node a1, the node d, the node b2 and the node a2, and, in the path planning process for the above routing information 1, the updated
- the routing cost matrix is:
- the above is an exemplary illustration and explanation of updating the routing cost matrix of the transmission network in the process of path planning for a piece of routing information to be planned.
- the path planning can be performed on the next routing information to be planned based on the routing cost matrix updated in the process of performing the path planning on the previous routing information to be planned, In the process of path planning for the next routing information to be planned, the routing cost matrix is continuously updated.
- routing information 1 includes the information of the source node a1, the information of the target node a2, and the amount of data to be transmitted A
- routing information 2 includes The information of the source node b1, the information of the target node b2, and the amount of data to be transmitted B, prioritize routing information 1 and routing information 2 according to the amount of data to be transmitted. Routing information 2 performs path planning.
- path planning is performed for the routing information 1, and the transmittable directions from the source node a1 to the target node a2 include a right transmit direction and a downward transmit direction.
- the adjacent node of node a1 in the right transmission direction is node c1
- the adjacent node in the downward transmission direction is node d
- the amount of data planned to be transmitted between node a1 and node c1 the amount of data planned to be transmitted between node a1 and node c1
- the amount of data planned to be transmitted between node a1 and node d are all 0.
- the adjacent node d in the direction of downward transmission or the adjacent node c1 in the direction of right transmission can be selected as the next transmission node of node a1, for example, node d is selected as the node in Figure 3
- the next transmission node of a1 and update the binary array corresponding to node a1 in the routing cost matrix to (0, A).
- next transmission node d of node a1 there is only adjacent node b2 in the direction of right transmission, so node b2 is selected as the next transmission node of node d, and the corresponding node d in the routing cost matrix is updated.
- the binary array of is (A, 0).
- the adjacent node in the direction of right transmission is the target node a2, select node a2 as the next transmission node of node b2, and update the binary array corresponding to node b2 in the routing cost matrix as: (A, 0).
- the planned transmission path from the source node a1 to the target node a2 is generated according to the source node a1, node d, node b2 and target node a2.
- the path of the transmission in the direction of the line arrow.
- path planning is performed for the routing information 2, and the transmittable directions from the source node b1 to the target node b2 include a right transmit direction and a downward transmit direction.
- the transmittable directions from the source node b1 to the target node b2 include a right transmit direction and a downward transmit direction.
- the adjacent node of node b1 in the right transmission direction is node e1
- the adjacent node in the downward transmission direction is node a1
- the amount of data planned to be transmitted between node b1 and node e1 the amount of data planned to be transmitted between node b1 and node a1 are all 0.
- the adjacent node a1 in the direction of downward transmission or the adjacent node e1 in the direction of right transmission can be selected as the next transmission node of node b1, for example, node a1 is selected as the node in Figure 3
- the next transmission node of b1 and update the binary array corresponding to node b1 in the routing cost matrix to (0, B).
- node c1 is selected as the next transmission node of node a1, and the binary array corresponding to node a1 in the routing cost matrix is updated to be (B, A).
- the adjacent node in the downward transmission direction is the target node b2, select node b2 as the next transmission node of node c1, and update the binary array corresponding to node c1 in the routing cost matrix as: (0, B).
- the planned transmission path from the source node b1 to the target node b2 is generated according to the source node b1, the node c1 and the target node b2, which is indicated by the arrow along the dotted line in FIG. 3 . the direction of the transmission path.
- FIG. 6 is a schematic structural diagram of a path planning apparatus provided by an embodiment of the present invention. As shown in FIG. 6 , an embodiment of the present invention provides a path planning apparatus 200.
- the path planning apparatus 200 includes: a transmission direction determination module 201, a node Selection module 202 and path generation module 203 .
- the transmission direction determining module 201 is configured to: according to the routing information to be planned currently, according to the information of the source node and the information of the target node, determine the transmission direction from the source node to the target node.
- the routing information includes the information of the source node, the information of the target node and the amount of data to be transmitted.
- the node selection module 202 is configured to: take the source node as the current node, according to the amount of data that has been planned to be transmitted between the current node and each node adjacent to the transmittable direction, select from all the adjacent nodes in the transmittable direction. Determine the next transfer node; if the next transfer node is not the target node, take the next transfer node as the current node, and return to execute the planned transfer between the current node and the adjacent nodes in the transferable direction. The amount of data, the step of determining the next transfer node from all nodes adjacent in the transferable direction.
- the path generation module 203 is configured to: in the case that the next transmission node determined by the node selection module 202 is the target node, according to the source node, the target node, and the transmission node between the source node and the target node, determine the source node from the source node. The planned transmission path from the node to the target node.
- the node selection module 202 is configured to: from all nodes adjacent to the current node in the transmittable direction, select the node with the smallest amount of data planned to transmit as the next transmission node of the current node .
- the node selection module 202 is configured to: in the case that the current node is the source node and the corresponding nodes with the smallest amount of data planned to transmit are multiple, select the corresponding node with the smallest amount of data planned to transmit. Any node is used as the next transmission node; if the current node is not the source node and there are multiple nodes with the smallest amount of data planned to be transmitted, the corresponding node with the smallest amount of data planned to be transmitted is compared with the current node. The node whose last transit node is located in the same transmittable direction is used as the next transit node of the current node.
- the information of the source node includes location information of the source node
- the information of the target node includes location information of the target node.
- the transmission direction determination module 201 is configured to: determine the relative position relationship between the target node and the source node according to the position information of the source node and the position information of the target node; according to the relative position relationship between the target node and the source node, determine from the source node to the target The transmittable direction of the node.
- FIG. 7 is a schematic structural diagram of another path planning apparatus according to an embodiment of the present invention.
- the path planning apparatus 200 may further include: a first obtaining module 204 , a sorting module 205 and The planning control module 206 .
- the first obtaining module 204 is configured to obtain all routing information to be planned; the sorting module 205 is configured to sort all routing information to be planned in descending order of the amount of data to be transmitted in each routing information , determine the path planning sequence of each routing information; the planning control module 206 is configured to sequentially determine each routing information as the currently planned routing information according to the path planning sequence, so as to control the above-mentioned transmission direction determination module 201 and node selection module 202 And the path generation module 203 performs a path planning process for each routing information.
- FIG. 8 is a schematic structural diagram of another path planning apparatus provided by an embodiment of the present invention.
- the path planning apparatus 200 may further include: a building module 207, and the building module 207 is configured as According to the information of each node in the transmission network, an initial routing cost matrix is constructed.
- the routing cost matrix includes the amount of data planned to be transmitted between any two adjacent nodes in the transmission network. In the initial routing cost matrix, the amount of data planned to be transmitted between any two adjacent nodes is zero.
- the path planning apparatus 200 may further include: a second obtaining module 208 .
- the second obtaining module 208 is configured to obtain, according to the current routing cost matrix, the amount of data planned to be transmitted between the current node and each node adjacent to the transmittable direction.
- the path planning apparatus 200 may further include: an update module 209, where the update module 209 is configured to, after the node selection module 202 determines the next transmission node of the current node, The amount of data to be transmitted in the planned routing information, and the amount of data planned to be transmitted between the current node and the next transmission node in the current routing cost matrix is updated.
- Each functional module of the path planning apparatus provided by the embodiment of the present invention is used to implement the path planning method provided by the above-mentioned embodiment.
- For the specific related description of each functional module please refer to the specific description of the above-mentioned embodiment for the path planning method, here No longer.
- FIG. 9 is a schematic structural diagram of a path planning device according to an embodiment of the present invention. As shown in FIG. 9 , an embodiment of the present invention further provides a path planning device.
- the path planning device 600 includes a processor 601 , a memory 602 and a storage A program or instruction on the memory 602 that can be run on the processor 601, when the program or instruction is executed by the processor 601, each process in the above-mentioned embodiment of the path planning method can be realized, and the same technical effect can be achieved, In order to avoid repetition, details are not repeated here. .
- Embodiments of the present invention further provide a readable storage medium, where a program or an instruction is stored on the readable storage medium, and when the program or instruction is executed by a processor, each process in the above path planning method embodiment is implemented, and can achieve The same technical effect, in order to avoid repetition, will not be repeated here.
- the functions described in the present invention may be implemented in hardware, software, firmware, or any combination thereof.
- the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium.
- Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another.
- a storage medium can be any available medium that can be accessed by a general purpose or special purpose computer.
- embodiments of the present invention may be provided as a method, a system, or a computer program product. Accordingly, embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present invention may take the form of a computer program product implemented on one or more computer-usable storage media having computer-usable program code embodied therein, including but not limited to disk storage, CD-ROM, optical storage, and the like.
- Embodiments of the present invention are described with reference to flowcharts and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present invention. It will be understood that each flow and/or block in the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to the processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.
- These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions
- the apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明提供一种路径规划方法、装置、路径规划设备及存储介质，该方法包括：根据源节点的信息和目标节点的信息，确定从源节点到目标节点的可传输方向；将源节点作为当前节点，根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从在可传输方向上相邻的所有节点中确定出下一个传输节点；在下一个传输节点不是目标节点的情况下，将下一个传输节点作为当前节点，返回根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从相邻的所有节点中确定出下一个传输节点的步骤；在下一个传输节点为目标节点的情况下，根据源节点、目标节点及源节点和目标节点之间的传输节点，确定出从源节点到目标节点的规划传输路径。
Description
本发明实施例涉及网络通信技术领域，具体涉及一种路径规划方法、装置、路径规划设备及存储介质。
在静态传输网络中，如果不提前进行路径规划，容易造成某些路由路段负载过大，而其他路由路段负载不饱和的问题。
发明内容
本发明实施例的一个目的在于提供一种路径规划方法、装置、路径规划设备及存储介质，以有效解决如何使各个路由路段的负载均衡的问题。
第一方面，本发明实施例提供一种路径规划方法，该路径规划方法包括：针对当前待规划的路由信息，所述路由信息包括源节点的信息和目标节点的信息，进行以下路径规划过程：根据源节点的信息和目标节点的信息，确定从所述源节点到所述目标节点的可传输方向；将源节点作为当前节点，根据当前节点与在所述可传输方向上相邻的各节点之间已规划传输的数据量，从在所述可传输方向上相邻的所有节点中确定出下一个传输节点；在所述下一个传输节点为所述目标节点的情况下，根据所述源节点、所述目标节点、以及所述源节点和所述目标节点之间的所述传输节点，确定出从所述源节点到所述目标节点的规划传输路径。
第二方面，本发明实施例提供一种路径规划装置，该路径规划装置包括：传输方向确定模块，其被配置为：针对当前待规划的路由信息，所述路由信息包括源节点的信息和目标节点的信息，根据源节点的信息和目标节点的信息，确定从所述源节点到所述目标节点的可传输方向；节点选择模块，其被配置为：将源节点作为当前节点，根据当前节点与在所述可传输方向上相邻的各节点之间已规划传输的数据量，从在所述可传输方向上相邻的所有节点中确定出下一个传输节点；路径生成模块，其被配置为：在所述节点选择模块确定出的所述下一个传输节点为所述目标节点的情况下，根据所述源节点、所述目标节点、以及所述源节点和所述目标节点之间的所述传输节点，确定出从所述源节点到所述目标节点的规划传输路径。
第三方面，本发明实施例提供一种路径规划设备，包括：处理器、 存储器及存储在所述存储器上并可在所述处理器上运行的程序，所述程序被所述处理器执行时实现如第一方面所述的路径规划方法的步骤。
第四方面，本发明实施例提供一种可读存储介质，所述可读存储介质上存储有程序，所述程序被处理器执行时实现如第一方面所述的路径规划方法的步骤。
通过阅读下文优选实施方式的详细描述，各种其他的优点和益处对于本领域普通技术人员将变得清楚明了。附图仅用于示出优选实施方式的目的，而并不认为是对本发明的限制。而且在整个附图中，用相同的参考符号表示相同的部件。在附图中：
图1为本发明实施例提供的一种路径规划方法的流程图。
图2为一种确定从源节点到目标节点的可传输方向的方式的流程图。
图3为一种传输网络的拓扑结构示意图。
图4为本发明实施例提供的另一种路径规划方法的流程图。
图5为本发明实施例提供的又一种路径规划方法的流程图。
图6为本发明实施例提供的一种路径规划装置的结构示意图。
图7为本发明实施例提供的另一种路径规划装置的结构示意图。
图8为本发明实施例提供的又一种路径规划装置的结构示意图。
图9为本发明实施例提供的一种路径规划设备的结构示意图。
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护的范围。
本发明的说明书和权利要求书中的术语“包括”以及它的任何变形，意图在于覆盖不排他的包含，例如，包含了一系列步骤或单元的过程、方法、系统、产品或设备不必限于清楚地列出的那些步骤或单元，而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它步骤或单元。此外，说明书以及权利要求中使用“和/或”表示所连接对象的至少其中之一，例如A和/或B，表示包含单独A，单独B，以及A和B都存在三种情况。
在本发明实施例中，“示例性的”或者“例如”等词用于表示作例子、例证或说明。本发明实施例中被描述为“示例性的”或者“例如”的任何 实施例或设计方案不应被解释为比其它实施例或设计方案更优选或更具优势。确切而言，使用“示例性的”或者“例如”等词旨在以具体方式呈现相关概念。
图1为本发明实施例提供的一种路径规划方法的流程图，参见图1，本发明实施例提供一种路径规划方法，该路径规划方法包括：针对当前待规划的路由信息，进行以下路径规划过程：步骤101～步骤105。
步骤101、根据源节点的信息和目标节点的信息，确定从源节点到目标节点的可传输方向。
在本发明实施例中，待规划的路由信息包括待规划的源节点的信息、目标节点的信息以及待传输的数据量。其中，源节点的信息包括但不限于：源节点的标识、位置信息等，目标节点的信息包括但不限于：目标节点的标识、位置信息等。
在本发明实施例中，路径规划方法应用于传输网络，传输网络中的节点为路由节点，节点用于通过路由进行数据的传输，源节点是指数据的发送端所对应的路由节点，目标节点是指数据的接收端所对应的路由节点。
在一些实施例中，传输网络可以是众核芯片的片上网络，众核芯片包括片上网络和多个核，片上网络包括多个路由节点，路由节点与核一一对应设置，任一个核可以通过对应的路由节点与其他核进行数据传输，传输网络的节点可以是核在片上网络中所对应的路由节点，上述发送端和上述接收端均可以是众核芯片(或者称为众核处理器)中的一个核，即本发明实施例的路径规划方法可以用于规划众核芯片上核间的数据传输路径。
在一些实施例中，传输网络为由芯片或设备所对应的路由节点组成的网络，传输网络的节点为芯片或设备对应的路由节点，任一个芯片或设备可以通过对应的路由节点与其他芯片或设备进行数据传输，上述发送端和上述接收端均可以是单一的芯片或设备，即本发明实施例的路径规划方法可以用于规划芯片间或设备间的数据传输路径。
在本发明实施例中，从源节点到目标节点的可传输方向是指从源节点到目标节点的所有的可以选择使用的数据传输方向，自源节点开始，将待传输的数据沿可传输方向进行传输能够到达目标节点。图2为一种确定从源节点到目标节点的可传输方向的方式的流程图，参见图2，在一些实施例中，步骤101可以进一步包括步骤1011和步骤1012。
步骤1011、根据源节点的位置信息和目标节点的位置信息，确定目标节点与源节点的相对位置关系。
步骤1012、根据目标节点与源节点的相对位置关系，确定从源节点到目标节点的可传输方向。
例如，根据源节点的位置信息和目标节点的位置信息，确定目标 节点位于源节点的右侧下方的方向，从而确定从源节点到目标节点的可传输方向包括自左向右的传输方向以及自上向下的传输方向。
示例性的，图3为一种传输网络的拓扑结构示意图，例如，当前待规划的路由信息包括：源节点a1的信息、目标节点a2的信息以及待传输的数据量A，根据图3所示的网络拓扑结构，目标节点a2位于源节点a1的右侧下方的位置，因此，在步骤101中，确定从源节点a1到目标节点a2的可传输方向为向右传输的方向以及向下传输的方向。
可以理解的是，图3所示的传输网络的拓扑结构为二维网络拓扑结构(例如，2D mesh网络)，本发明实施例的路径规划方法还可以适用于多维网络拓扑结构的传输网络，比如三维网络、四维网络、五维网络等。
步骤102、将源节点作为当前节点，根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从在可传输方向上相邻的所有节点中确定出下一个传输节点。
在本发明实施例中，在步骤102中，从与当前节点在可传输方向上相邻的所有节点中，将对应的已规划传输的数据量最小的节点作为下一个传输节点。
在本发明实施例中，下一个传输节点即为规划的当前节点的下一跳节点。当前节点与在可传输方向上相邻的节点之间已规划传输的数据量是指已规划给从当前节点至该相邻的节点的路段所需要传输的数据量，即当前节点与该相邻的节点之间被规划需要传输的、但实际未传输的数据量。
在一方面，下一个传输节点在预先确定的可传输方向上，可以有效避免数据绕道传输，有效避免因数据传输距离过长而影响传输效率；在另一方面，在每次确定当前节点的下一个传输节点时，均依据最小的已规划传输的数据量进行确定，从而在针对多个路由信息进行路径规划时，使得每个规划的路段(当前节点至下一个传输节点的路段)需传输的数据量能够达到均衡，即实现规划的每个路段的负载均衡，可以有效解决现有技术中部分路段负载过大，而部分路段负载不饱和的问题。
如图3所示，以源节点a1、目标节点a2为例，通过上述步骤101可以确定从源节点a1到目标节点a2的可传输方向包括向右传输的方向以及向下传输的方向。
在确定从源节点a1到目标节点a2的可传输方向之后，如图3所示，在步骤102中，源节点a1作为当前节点时，与当前节点a1在可传输方向上相邻的所有节点包括与当前节点a1在向右传输的方向上相邻的节点c1，以及与当前节点a1在向下传输的方向上相邻的节点d；在确定出当前节点a1在所有可传输方向上相邻的所有节点，即确定出 节点c1和节点d后，获取当前节点a1与相邻的节点c1之间已规划传输的数据量，以及当前节点a1与相邻的节点d之间已规划传输的数据量；比较当前节点a1与相邻的节点c1之间已规划传输的数据量、当前节点a1与相邻的节点d之间已规划传输的数据量；当节点c1对应的已规划传输的数据量大于节点d对应的已规划传输的数据量时，则将节点d确定为当前节点a1的下一个传输节点；当节点c1对应的已规划传输的数据量小于节点d对应的已规划传输的数据量时，则将节点c1确定为当前节点a1的下一个传输节点；当节点c1对应的已规划传输的数据量等于节点d对应的已规划传输的数据量时，则可以从节点d、节点c1中选择其中任意一个节点作为下一个传输节点，或者可以按照预定策略进行选择。
在一些实施例中，在当前节点为源节点，且对应的已规划传输的数据量最小的节点为多个的情况下，将对应的已规划传输的数据量最小的任一节点作为当前节点的下一个传输节点。例如，参见图3，对于源节点a1，可传输方向包括向右传输的方向以及向下传输的方向，相应的，源节点a1在向右传输的方向上相邻的节点为节点c1，源节点a1在向下传输的方向上相邻的节点为节点d，节点a1与节点c1之间已规划传输的数据量为0，节点a1与节点d之间已规划传输的数据量亦为0，则可以选择节点d或者节点c1作为节点a1的下一个传输节点。
在一些实施例中，在当前节点不是源节点，且对应的已规划传输的数据量最小的节点为多个的情况下，将对应的已规划传输的数据量最小的、与当前节点的上一个传输节点位于同一可传输方向上的节点，作为当前节点的下一个传输节点。可以理解的是，当前节点是上一个传输节点的下一个传输节点。
例如，参见图3，假设源节点b1的下一个传输节点为节点a1，节点a1为当前节点，可传输方向包括向右传输的方向以及向下传输的方向，相应的，节点a1在向右传输的方向上相邻的节点为节点c1，源节点a1在向下传输的方向上相邻的节点为节点d，节点a1与节点c1之间已规划传输的数据量为0，节点a1与节点d之间已规划传输的数据量亦为0，则首先确定节点a1的上一个传输节点为源节点b1，上一个传输节点b1至节点a1的传输方向为向下传输的方向，而节点a1至节点d的传输方向为向下传输的方向，也即节点d与节点a1的上一个传输节点b1位于同一传输方向上，故可以选择节点d作为节点a1的下一个传输节点。
步骤103、判断下一个传输节点是否为目标节点，若是，则执行步骤105，否则执行步骤104。
例如，判断下一个传输节点的标识或位置是否为当前待规划的路由信息中目标节点的标识或位置，若是，则确定下一个传输节点为目 标节点，并执行步骤105，否则确定下一个传输节点为源节点与目标节点之间的传输节点，即下一个传输节点不是目标节点，并执行步骤104。
步骤104、在下一个传输节点不是目标节点的情况下，将下一个传输节点作为当前节点，并返回执行根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从在可传输方向上相邻的所有节点中确定出下一个传输节点的步骤。
在步骤104中，在下一个传输节点不是目标节点的情况下，将下一个传输节点作为当前节点，返回执行根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从在可传输方向上相邻的所有节点中确定出下一个传输节点的步骤，以继续确定、规划当前节点的下一个传输节点，并继续执行步骤103，直至最终确定出的下一个传输节点为目标节点为止。
例如，如图3所示，在步骤102中，源节点a1的下一个传输节点为节点d，则在步骤104中，将下一个传输节点d作为当前节点d，返回执行根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从在可传输方向上相邻的所有节点中确定出下一个传输节点的步骤，以确定出当前节点d的下一个传输节点，例如当前节点d的下一个传输节点为节点b2，将下一个传输节点b2作为当前节点b2，返回执行根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从在可传输方向上相邻的所有节点中确定出下一个传输节点的步骤，以确定出当前节点b2的下一个传输节点，此时，当前节点b2的下一个传输节点为节点a2，即目标节点a2。
步骤105、在下一个传输节点为目标节点的情况下，根据源节点、目标节点、以及源节点和目标节点之间的传输节点，确定出从源节点到目标节点的规划传输路径。
在步骤105中，在下一个传输节点为目标节点的情况下，根据源节点、确定出的源节点与目标节点之间的所有确定、规划的传输节点、目标节点，确定出从源节点到目标节点的规划传输路径。需要说明的是，当源节点与目标节点之间不具有确定、规划的传输节点，即源节点的下一个传输节点即是目标节点时，则在步骤105中，可以直接根据源节点和目标节点生成从源节点到目标节点的规划传输路径。
例如，如图3所示，通过上述步骤102至104，确定出源节点a1的下一个传输节点为节点d，节点d的下一个传输节点为节点b2，节点b2的下一个传输节点为目标节点a2，则从源节点到目标节点的规划传输路径为源节点a1、节点d、节点b2、目标节点a2所组成的传输路径。
在确定从源节点到目标节点的规划传输路径之后，可以在后续针 对源节点和目标节点进行数据传输时，可以按照规划好的从源节点到目标节点的规划传输路径进行数据传输。
本发明实施例所提供的路径规划方法，在针对路由信息进行路径规划时，自源节点起，在每次确定下一个传输节点时，均依据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量进行确定，使得规划的从源节点到目标节点之间的每一个路段(从当前节点至当前节点的下一个传输节点的路段)的负载均衡，以有效解决现有技术中部分路段负载过大，而部分路段负载不饱和的问题。
图4为本发明实施例提供的另一种路径规划方法的流程图，如图4所示，在一些实施例中，在针对当前待规划的路由信息，进行上述路径规划过程之前，路径规划方法还包括步骤1001～步骤1003。
步骤1001、获取所有待规划的路由信息。
在本发明实施例中，待规划的路由信息是指待规划的传输任务或路由任务，每个待规划的路由信息包括对应的源节点的信息、对应的目标节点的信息以及对应的待传输的数据量。
步骤1002、按照各路由信息中待传输的数据量从大到小的顺序，对所有待规划的路由信息进行排序，确定出各路由信息的路径规划顺序。
其中，路径规划顺序可以包括各路由信息的优先级，各路由信息的优先级根据对应的待传输的数据量从大到小的顺序依次设置，最大的待传输的数据量所对应的路由信息的优先级最高，最小的待传输的数据量所对应的路由信息的优先级最低。
步骤1003、按照路径规划顺序，依次将各路由信息确定为当前待规划的路由信息，以对各路由信息进行路径规划过程。
在步骤1003中，按照路径规划顺序，较大的待传输的数据量所对应的路由信息优先进行路径规划，可以有效提高传输网络整体的传输效率。
图5为本发明实施例提供的又一种路径规划方法的流程图，在一些实施例中，如图5所示，在获取所有待规划的路由信息的步骤，即步骤1001之前，路径规划方法还包括步骤S0：根据传输网络中各节点的信息，构建初始的路由代价矩阵。
其中，节点的信息可以包括但不限于：节点的标识、位置信息等，位置信息可以包括位置坐标。
在步骤S0中，根据节点的信息可以确定传输网络的网络拓扑结构类型。例如，节点的位置坐标为二维的位置坐标，则可以确定传输网络为二维网络拓扑结构；节点的位置坐标为三维的位置坐标，则可以确定传输网络为三维网络拓扑结构。
在步骤S0中，根据传输网络的网络拓扑结构类型，构建相应维度 的初始的路由代价矩阵。例如，传输网络的网络拓扑结构类型为二维网络，则初始的路由代价矩阵为二维矩阵。
其中，路由代价矩阵包括传输网络中任意相邻的两个节点之间已规划传输的数据量，初始时，在初始的路由代价矩阵中，任意相邻的两个节点之间已规划传输的数据量均为零。
示例性的，路由代价矩阵中的每一个元素可以是一个二元数组，对于二维的传输网络而言，该二元数组可以用(w1，w2)表示，路由代价矩阵的每个元素对应传输网络的一个节点，二元数组中的w1可以用于表示对应的节点与该节点在第一传输方向(如自左向右的方向)上相邻的节点之间已规划传输的数据量，二元数组中的w2可以用于表示对应的节点与该节点在第二传输方向(如自上向下的方向)上相邻的节点之间已规划传输的数据量。
以图3所示的传输网络为例，示例性的，初始路由代价矩阵为：
在一些实施例中，如图5所示，在根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从在可传输方向上相邻的所有节点中确定出下一个传输节点的步骤之前，路径规划方法还包括步骤S1：根据当前的路由代价矩阵，获取当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量。
在当前待规划的路由信息为在上述路径规划顺序中位于第一位的路由信息，且当前节点为源节点时，当前的路由代价矩阵为初始的路由代价矩阵，此时，当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量均为0。
在一些实施例中，如图5所示，在从与当前节点在可传输方向上相邻的所有节点中确定出下一个传输节点的步骤之后，路径规划方法还包括步骤S2：根据当前待规划的路由信息中待传输的数据量，更新当前的路由代价矩阵中当前节点与下一个传输节点之间已规划传输的数据量。
示例性的，如果下一个传输节点为当前节点在自左向右的方向上相邻的节点，则在路由代价矩阵中，将待传输的数据量与当前节点对应的二元数组(w1，w2)中的w1值进行累加，以更新路由代价矩阵中当前节点对应的二元数组。例如，待传输的数据量为10MB，而当前节点对应的二元数组(w1，w2)为(0，0)，即当前的w1值为0，则将待传输的数据量10MB与当前的w1值进行累加，更新后的w1值为10，当前节点对应的二元数组(w1，w2)为(10，0)。
在一些实施例中，对于当前待规划的路由信息而言，每规划确定出一个下一个传输节点，则进行一次步骤S2，以实时更新用于记录任意相邻两个节点之间已规划传输的数据量的路由代价矩阵。对于下一个待规划的路由信息而言，基于在对上一个待规划的路由信息进行路径规划过程中更新后的路由代价矩阵，对该下一个待规划的路由信息进行路径规划，在对该下一个待规划的路由信息进行路径规划的过程中，实时更新路由代价矩阵。
示例性的，以当前待规划的路由信息1包括源节点a1的信息、目标节点a2的信息以及待传输的数据量A为例，对于在针对当前待规划的路由信息1进行路径规划的过程中更新路由代价矩阵的方式进行解释和说明。
结合图3，假设当前待规划的路由信息1为上述路径规划顺序中位于第一位的路由信息，且初始的路径代价矩阵中每个元素对应的二元数组(w1，w2)均为(0，0)，在确定出源节点a1的下一个传输节点为节点d后，将待传输的数据量A与路由代价矩阵中源节点a1对应的二元数组(w1，w2)中当前的w2值即0进行累加，以更新路由代价矩阵中源节点a1对应的二元数组，路由代价矩阵中源节点a1对应的二元数组从(0，0)更新为(0，A)；在确定出源节点d的下一个传输节点为节点b2后，将待传输的数据量A与路由代价矩阵中节点d对应的二元数组(w1，w2)中当前的w1值即0进行累加，以更新路由代价矩阵中节点d对应的二元数组，路由代价矩阵中节点d对应的二元数组从(0，0)更新为(A，0)；在确定出源节点b2的下一个传输节点为目标节点a2后，将待传输的数据量A与路由代价矩阵中节点b2对应的二元数组(w1，w2)中当前的w1值即0进行累加，以更新路由代价矩阵中节点b2对应的二元数组，路由代价矩阵中节点b2对应的二元数组从(0，0)更新为(A，0)。
此时，确定出源节点a1到目标节点a2的规划传输路径为由节点a1、节点d、节点b2和节点a2组成的路径，并且，在针对上述路由信息1的路径规划过程中，更新后的路由代价矩阵为：
以上是在针对一个待规划的路由信息进行路径规划过程中更新传输网络的路由代价矩阵的示例性说明和解释。当对下一个待规划的路由信息进行路径规划时，可以基于在对上一个待规划的路由信息进行路径规划过程中更新后的路由代价矩阵，对该下一个待规划的路由信息进行路径规划，在对该下一个待规划的路由信息进行路径规划的过 程中，继续更新路由代价矩阵。
示例性的，结合图3，假设存在两个路由信息：路由信息1和路由信息2，路由信息1包括源节点a1的信息、目标节点a2的信息以及待传输的数据量A，路由信息2包括源节点b1的信息、目标节点b2的信息以及待传输的数据量B，按照待传输的数据量对路由信息1和路由信息2进行优先级排序，确定先对路由信息1进行路径规划，后对路由信息2进行路径规划。
首先，针对路由信息1进行路径规划，从源节点a1至目标节点a2的可传输方向包括向右传输的方向和向下传输的方向。在源节点a1上，具有两个可传输方向可以选择，可以按照向右传输的方向进行传输或按照向下传输的方向进行传输，节点a1在向右传输的方向上相邻的节点为节点c1，在向下传输的方向上相邻的节点为节点d，节点a1与节点c1之间已规划传输的数据量、节点a1与节点d之间已规划传输的数据量均为0，因此，在节点a1上，可选择在向下传输的方向上相邻的节点d或在向右传输的方向上相邻的节点c1作为节点a1的下一个传输节点，例如在图3中选择节点d作为节点a1的下一个传输节点，并更新路由代价矩阵中节点a1对应的二元数组为(0，A)。
同理，在节点a1的下一个传输节点d上，只有在向右传输的方向上相邻的节点b2，故选择节点b2作为节点d的下一个传输节点，并更新路由代价矩阵中节点d对应的二元数组为(A，0)。同理，在节点b2上，在向右传输的方向上相邻的节点为目标节点a2，选择节点a2作为节点b2的下一个传输节点，并更新路由代价矩阵中节点b2对应的二元数组为(A，0)。
由于节点b2的下一个传输节点即是目标节点a2，故根据源节点a1、节点d、节点b2和目标节点a2，生成从源节点a1至目标节点a2的规划传输路径，即图3中沿实线箭头所指的方向传输的路径。
然后，针对路由信息2进行路径规划，从源节点b1至目标节点b2的可传输方向包括向右传输的方向和向下传输的方向。在源节点b1上，具有两个可传输方向可以选择，可以按照向右传输的方向进行传输或按照向下传输的方向进行传输，节点b1在向右传输的方向上相邻的节点为节点e1，在向下传输的方向上相邻的节点为节点a1，节点b1与节点e1之间已规划传输的数据量、节点b1与节点a1之间已规划传输的数据量均为0，因此，在节点b1上，可选择在向下传输的方向上相邻的节点a1或在向右传输的方向上相邻的节点e1作为节点b1的下一个传输节点，例如在图3中选择节点a1作为节点b1的下一个传输节点，并更新路由代价矩阵中节点b1对应的二元数组为(0，B)。
同理，在节点b1的下一个传输节点a1上，在向右传输的方向上相邻的节点为节点c1，在向下传输的方向上相邻的节点为节点d，由 于在规划路由信息1的路径时，已规划从节点a1至节点d的路段，节点a1与节点d之间已规划传输的数据量为A，而节点a1与节点c1之间已规划传输的数据量仍为0,，故选择节点c1作为节点a1的下一个传输节点，并更新路由代价矩阵中节点a1对应的二元数组为(B，A)。同理，在节点c1上，在向下传输的方向上相邻的节点为目标节点b2，选择节点b2作为节点c1的下一个传输节点，并更新路由代价矩阵中节点c1对应的二元数组为(0，B)。
由于节点c1的下一个传输节点即是目标节点b2，故根据源节点b1、节点c1和目标节点b2，生成从源节点b1至目标节点b2的规划传输路径，即图3中沿虚线箭头所指的方向传输的路径。
图6为本发明实施例提供的一种路径规划装置的结构示意图，如图6所示，本发明实施例提供一种路径规划装置200，该路径规划装置200包括：传输方向确定模块201、节点选择模块202和路径生成模块203。
其中，传输方向确定模块201被配置为：针对当前待规划的路由信息，根据源节点的信息和目标节点的信息，确定从源节点到所述目标节点的可传输方向。其中，路由信息包括源节点的信息、目标节点的信息以及待传输的数据量。
节点选择模块202被配置为：将源节点作为当前节点，根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从在可传输方向上相邻的所有节点中确定出下一个传输节点；在下一个传输节点不是目标节点的情况下，将下一个传输节点作为当前节点，并返回执行根据当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量，从在可传输方向上相邻的所有节点中确定出下一个传输节点的步骤。
路径生成模块203被配置为：在节点选择模块202确定出的下一个传输节点为目标节点的情况下，根据源节点、目标节点、以及源节点和目标节点之间的传输节点，确定出从源节点到目标节点的规划传输路径。
在一些实施例中，节点选择模块202被配置为：从与当前节点在可传输方向上相邻的所有节点中，将对应的已规划传输的数据量最小的节点作为当前节点的下一个传输节点。
在一些实施例中，节点选择模块202被配置为：在当前节点为源节点，对应的已规划传输的数据量最小的节点为多个的情况下，将对应的已规划传输的数据量最小的任一节点作为下一个传输节点；在当前节点不是源节点，对应的已规划传输的数据量最小的节点为多个的情况下，将对应的已规划传输的数据量最小的、与当前节点的上一个传输节点位于同一可传输方向上的节点，作为当前节点的下一个传输 节点。
在一些实施例中，源节点的信息包括源节点的位置信息，目标节点的信息包括目标节点的位置信息。传输方向确定模块201被配置为：根据源节点的位置信息和目标节点的位置信息，确定目标节点与源节点的相对位置关系；根据目标节点与源节点的相对位置关系，确定从源节点到目标节点的可传输方向。
图7为本发明实施例提供的另一种路径规划装置的结构示意图，在一些实施例中，如图7所示，路径规划装置200还可以进一步包括：第一获取模块204、排序模块205和规划控制模块206。
其中，第一获取模块204被配置为获取所有待规划的路由信息；排序模块205被配置为按照各路由信息中待传输的数据量从大到小的顺序，对所有待规划的路由信息进行排序，确定出各路由信息的路径规划顺序；规划控制模块206被配置为按照路径规划顺序，依次将各路由信息确定为当前待规划的路由信息，以控制上述传输方向确定模块201、节点选择模块202和路径生成模块203对各路由信息进行路径规划过程。
图8为本发明实施例提供的又一种路径规划装置的结构示意图，如图8所示，在一些实施例中，路径规划装置200还可以进一步包括：构建模块207，构建模块207被配置为根据传输网络中各节点的信息，构建初始的路由代价矩阵。
其中，路由代价矩阵包括传输网络中任意相邻的两个节点之间已规划传输的数据量，在初始的路由代价矩阵中，任意相邻的两个节点之间已规划传输的数据量均为零。
如图8所示，在一些实施例中，路径规划装置200还可以进一步包括：第二获取模块208。第二获取模块208被配置为根据当前的路由代价矩阵，获取当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量。
如图8所示，在一些实施例中，路径规划装置200还可以进一步包括：更新模块209，更新模块209被配置为在节点选择模块202确定出当前节点的下一个传输节点之后，根据当前待规划的路由信息中待传输的数据量，更新当前的路由代价矩阵中当前节点与下一个传输节点之间已规划传输的数据量。
本发明实施例所提供的路径规划装置的各个功能模块，用于实现上述实施例提供的路径规划方法，关于各个功能模块的具体相关描述可参见上述实施例对于路径规划方法的具体描述，此处不再赘述。
图9为本发明实施例提供的一种路径规划设备的结构示意图，如图9所示，本发明实施例还提供一种路径规划设备，该路径规划设备600包括处理器601、存储器602以及存储在存储器602上并可在所述 处理器601上运行的程序或指令，该程序或指令被处理器601执行时实现上述的路径规划方法实施例中的各个过程，且能达到相同的技术效果，为避免重复，这里不再赘述。。
本发明实施例还提供一种可读存储介质，所述可读存储介质上存储有程序或指令，该程序或指令被处理器执行时实现上述路径规划方法实施例中的各个过程，且能达到相同的技术效果，为避免重复，这里不再赘述。
本领域技术人员应该可以意识到，在上述一个或多个示例中，本发明所描述的功能可以用硬件、软件、固件或它们的任意组合来实现。当使用软件实现时，可以将这些功能存储在计算机可读介质中或者作为计算机可读介质上的一个或多个指令或代码进行传输。计算机可读介质包括计算机存储介质和通信介质，其中通信介质包括便于从一个地方向另一个地方传送计算机程序的任何介质。存储介质可以是通用或专用计算机能存取的任何可用介质。
以上所述的具体实施方式，对本发明的目的、技术方案和有益效果进行了进一步详细说明，所应理解的是，以上所述仅为本发明的具体实施方式而已，并不用于限定本发明的保护范围，凡在本发明的技术方案的基础之上，所做的任何修改、等同替换、改进等，均应包括在本发明的保护范围之内。
本领域内的技术人员应明白，本发明实施例可提供为方法、系统、或计算机程序产品。因此，本发明实施例可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明实施例可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本发明实施例是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
显然，本领域的技术人员可以对本发明实施例进行各种改动和变型而不脱离本发明的精神和范围。这样，倘若本发明实施例的这些修改和变型属于本发明权利要求及其等同技术的范围之内，则本发明也意图包含这些改动和变型在内。
Claims (20)
- 一种路径规划方法，其特征在于，包括：针对当前待规划的路由信息，所述路由信息包括源节点的信息和目标节点的信息，进行以下路径规划过程：根据源节点的信息和目标节点的信息，确定从所述源节点到所述目标节点的可传输方向；将源节点作为当前节点，根据当前节点与在所述可传输方向上相邻的各节点之间已规划传输的数据量，从在所述可传输方向上相邻的所有节点中确定出下一个传输节点；在所述下一个传输节点为所述目标节点的情况下，根据所述源节点、所述目标节点、以及所述源节点和所述目标节点之间的所述传输节点，确定出从所述源节点到所述目标节点的规划传输路径。
- 根据权利要求1所述的路径规划方法，其特征在于，在确定出下一个传输节点之后，所述路径规划方法还包括：在所述下一个传输节点不是目标节点的情况下，将所述下一个传输节点作为当前节点，并返回所述根据当前节点与在所述可传输方向上相邻的各节点之间已规划传输的数据量，从在所述可传输方向上相邻的所有节点中确定出下一个传输节点的步骤。
- 根据权利要求1所述的路径规划方法，其特征在于，所述根据当前节点与在所述可传输方向上相邻的各节点之间已规划传输的数据量，从在所述可传输方向上相邻的所有节点中确定出下一个传输节点，包括：从在所述可传输方向上相邻的所有节点中，将对应的已规划传输的数据量最小的节点作为所述下一个传输节点。
- 根据权利要求1所述的路径规划方法，其特征在于，所述路由信息还包括待传输的数据量；在针对当前待规划的路由信息，进行所述路径规划过程之前，所述路径规划方法还包括：获取所有待规划的路由信息；按照各所述路由信息中待传输的数据量从大到小的顺序，对所有待规划的路由信息进行排序，确定出各所述路由信息的路径规划顺序；按照所述路径规划顺序，依次将各所述路由信息确定为当前待规划的路由信息，以对各所述路由信息进行所述路径规划过程。
- 根据权利要求4所述的路径规划方法，其特征在于，在所述根据当前节点与在所述可传输方向上相邻的各节点之间已规划传输的数据量，从在所述可传输方向上相邻的所有节点中确定出下一个传输节点的步骤之前，所述路径规划方法还包括：根据当前的路由代价矩阵，获取所述当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量；其中，所述路由代价矩阵包括传输网络中任意相邻的两个节点之间已规划传输的数据量。
- 根据权利要求5所述的路径规划方法，其特征在于，在所述获取所有待规划的路由信息的步骤之前，所述路径规划方法还包括：根据传输网络中各节点的信息，构建初始的路由代价矩阵；其中，在初始的路由代价矩阵中，任意相邻的两个节点之间已规划传输的数据量均为零。
- 根据权利要求5所述的路径规划方法，其特征在于，在所述从在所述可传输方向上相邻的所有节点中确定出下一个传输节点的步骤之后，所述路径规划方法还包括：根据当前待规划的路由信息中待传输的数据量，更新当前的路由代价矩阵中所述当前节点与所述下一个传输节点之间已规划传输的数据量。
- 根据权利要求3所述的路径规划方法，其特征在于，所述从在所述可传输方向上相邻的所有节点中，将对应的已规划传输的数据量最小的节点作为所述下一个传输节点的步骤包括：在所述当前节点为源节点，对应的已规划传输的数据量最小的节点为多个的情况下，将对应的已规划传输的数据量最小的任一节点作为所述下一个传输节点；在所述当前节点不是源节点，对应的已规划传输的数据量最小的节点为多个的情况下，将对应的已规划传输的数据量最小的、与当前节点的上一个传输节点位于同一可传输方向上的节点，作为所述下一个传输节点。
- 根据权利要求1所述的路径规划方法，其特征在于，所述源节点的信息包括所述源节点的位置信息，所述目标节点的信息包括所述目标节点的位置信息；所述根据源节点的信息和目标节点的信息，确定从所述源节点到所述目标节点的可传输方向的步骤，包括：根据所述源节点的位置信息和所述目标节点的位置信息，确定所述目标节点与所述源节点的相对位置关系；根据所述目标节点与所述源节点的相对位置关系，确定从所述源节点到所述目标节点的可传输方向。
- 一种路径规划装置，其特征在于，包括：传输方向确定模块，其被配置为：针对当前待规划的路由信息，所述路由信息包括源节点的信息和目标节点的信息，根据源节点的信息和目标节点的信息，确定从所述源节点到所述目标节点的可传输方 向；节点选择模块，其被配置为：将源节点作为当前节点，根据当前节点与在所述可传输方向上相邻的各节点之间已规划传输的数据量，从在所述可传输方向上相邻的所有节点中确定出下一个传输节点；路径生成模块，其被配置为：在所述节点选择模块确定出的所述下一个传输节点为所述目标节点的情况下，根据所述源节点、所述目标节点、以及所述源节点和所述目标节点之间的所述传输节点，确定出从所述源节点到所述目标节点的规划传输路径。
- 根据权利要求10所述的路径规划装置，其特征在于，所述节点选择模块还被配置为：在所述下一个传输节点不是目标节点的情况下，将所述下一个传输节点作为当前节点，并返回执行所述根据当前节点与在所述可传输方向上相邻的各节点之间已规划传输的数据量，从在所述可传输方向上相邻的所有节点中确定出下一个传输节点的步骤。
- 根据权利要求10所述的路径规划装置，其特征在于，所述节点选择模块被配置为：从在所述可传输方向上相邻的所有节点中，将对应的已规划传输的数据量最小的节点作为所述下一个传输节点。
- 根据权利要求10所述的路径规划装置，其特征在于，所述路由信息还包括待传输的数据量；所述路径规划装置还包括：第一获取模块，其被配置为获取所有待规划的路由信息；排序模块，其被配置为按照各所述路由信息中待传输的数据量从大到小的顺序，对所有待规划的路由信息进行排序，确定出各所述路由信息的路径规划顺序；规划控制模块，其被配置为按照所述路径规划顺序，依次将各所述路由信息确定为当前待规划的路由信息，以对各所述路由信息进行路径规划过程。
- 根据权利要求13所述的路径规划装置，其特征在于，所述路径规划装置还包括：第二获取模块，其被配置为根据当前的路由代价矩阵，获取所述当前节点与在可传输方向上相邻的各节点之间已规划传输的数据量；其中，所述路由代价矩阵包括传输网络中任意相邻的两个节点之间已规划传输的数据量。
- 根据权利要求14所述的路径规划装置，其特征在于，所述路径规划装置还包括：构建模块，其被配置为根据传输网络中各节点的信息，构建初始的路由代价矩阵；其中，在初始的路由代价矩阵中，任意相邻的两个节点之间已规划传输的数据量均为零。
- 根据权利要求14所述的路径规划装置，其特征在于，所述路 径规划装置还包括：更新模块，其被配置为根据当前待规划的路由信息中待传输的数据量，更新当前的路由代价矩阵中所述当前节点与所述下一个传输节点之间已规划传输的数据量。
- 根据权利要求12所述的路径规划装置，其特征在于，所述节点选择模块被配置为：在所述当前节点为源节点，对应的已规划传输的数据量最小的节点为多个的情况下，将对应的已规划传输的数据量最小的任一节点作为所述下一个传输节点；在所述当前节点不是源节点，对应的已规划传输的数据量最小的节点为多个的情况下，将对应的已规划传输的数据量最小的、与当前节点的上一个传输节点位于同一可传输方向上的节点，作为所述下一个传输节点。
- 根据权利要求10所述的路径规划装置，其特征在于，所述源节点的信息包括所述源节点的位置信息，所述目标节点的信息包括所述目标节点的位置信息；所述传输方向确定模块被配置为：根据所述源节点的位置信息和所述目标节点的位置信息，确定所述目标节点与所述源节点的相对位置关系；根据所述目标节点与所述源节点的相对位置关系，确定从所述源节点到所述目标节点的可传输方向。
- 一种路径规划设备，其特征在于，包括：处理器、存储器及存储在所述存储器上并可在所述处理器上运行的程序，所述程序被所述处理器执行时实现如权利要求1至9中任一项所述的路径规划方法的步骤。
- 一种可读存储介质，其特征在于，所述可读存储介质上存储有程序，所述程序被处理器执行时实现如权利要求1至9中任一项所述的路径规划方法的步骤。
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010674319.8 | 2020-07-14 | ||
| CN202010674319.8A CN111865799B (zh) | 2020-07-14 | 2020-07-14 | 路径规划方法、装置、路径规划设备及存储介质 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2022012576A1 true WO2022012576A1 (zh) | 2022-01-20 |
Family
ID=72983361
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2021/106211 WO2022012576A1 (zh) | 2020-07-14 | 2021-07-14 | 路径规划方法、装置、路径规划设备及存储介质 |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111865799B (zh) |
| WO (1) | WO2022012576A1 (zh) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114500355A (zh) * | 2022-02-16 | 2022-05-13 | 上海壁仞智能科技有限公司 | 路由方法、片上网络、路由节点和路由装置 |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111865799B (zh) * | 2020-07-14 | 2023-09-05 | 北京灵汐科技有限公司 | 路径规划方法、装置、路径规划设备及存储介质 |
| CN113806270B (zh) * | 2021-09-23 | 2023-10-20 | 北京润科通用技术有限公司 | RapidIO网络的路径规划方法、装置、电子设备及存储介质 |
| CN114172895A (zh) * | 2021-12-07 | 2022-03-11 | 中国建设银行股份有限公司 | 一种路由方法、装置、计算机设备及存储介质 |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101382608B1 (ko) * | 2012-09-28 | 2014-04-07 | 성균관대학교산학협력단 | 무선 센서 네트워크의 패킷 전송 방법 |
| CN103986653A (zh) * | 2014-05-29 | 2014-08-13 | 苏州大学 | 一种网络节点及数据传输方法和系统 |
| CN105897584A (zh) * | 2014-06-09 | 2016-08-24 | 华为技术有限公司 | 路径规划方法和控制器 |
| CN106895846A (zh) * | 2017-05-05 | 2017-06-27 | 中国联合网络通信集团有限公司 | 一种路径规划方法及路径规划装置 |
| CN108770031A (zh) * | 2018-03-21 | 2018-11-06 | 深圳市海司恩科技有限公司 | 动态路径规划方法、动态路径规划系统及存储介质 |
| CN111865799A (zh) * | 2020-07-14 | 2020-10-30 | 北京灵汐科技有限公司 | 路径规划方法、装置、路径规划设备及存储介质 |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3546764B2 (ja) * | 1999-07-02 | 2004-07-28 | 日本電気株式会社 | ネットワークに備えられた負荷分散サーバ及び負荷分散サーバを備えるノード |
| US10182385B2 (en) * | 2014-06-09 | 2019-01-15 | Site Pro, LLC | Multi-path wireless mesh networks |
| CN105392173B (zh) * | 2015-10-13 | 2018-09-11 | 山东大学 | 一种多跳网络的中继选择方法及其系统 |
| CN107547365A (zh) * | 2017-08-29 | 2018-01-05 | 新华三技术有限公司 | 一种报文传输路径选择方法及装置 |
| CN107889183B (zh) * | 2017-10-27 | 2021-05-14 | 深圳友讯达科技股份有限公司 | 数据传输方法及装置 |
| CN108540876A (zh) * | 2018-03-12 | 2018-09-14 | 上海欣诺通信技术股份有限公司 | 业务路径选取方法、sdn控制器、存储介质及电子设备 |
| CN110779524A (zh) * | 2018-07-31 | 2020-02-11 | 阿里巴巴集团控股有限公司 | 路径规划方法、装置、设备及存储介质 |
-
2020
- 2020-07-14 CN CN202010674319.8A patent/CN111865799B/zh active Active
-
2021
- 2021-07-14 WO PCT/CN2021/106211 patent/WO2022012576A1/zh active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101382608B1 (ko) * | 2012-09-28 | 2014-04-07 | 성균관대학교산학협력단 | 무선 센서 네트워크의 패킷 전송 방법 |
| CN103986653A (zh) * | 2014-05-29 | 2014-08-13 | 苏州大学 | 一种网络节点及数据传输方法和系统 |
| CN105897584A (zh) * | 2014-06-09 | 2016-08-24 | 华为技术有限公司 | 路径规划方法和控制器 |
| CN106895846A (zh) * | 2017-05-05 | 2017-06-27 | 中国联合网络通信集团有限公司 | 一种路径规划方法及路径规划装置 |
| CN108770031A (zh) * | 2018-03-21 | 2018-11-06 | 深圳市海司恩科技有限公司 | 动态路径规划方法、动态路径规划系统及存储介质 |
| CN111865799A (zh) * | 2020-07-14 | 2020-10-30 | 北京灵汐科技有限公司 | 路径规划方法、装置、路径规划设备及存储介质 |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114500355A (zh) * | 2022-02-16 | 2022-05-13 | 上海壁仞智能科技有限公司 | 路由方法、片上网络、路由节点和路由装置 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111865799B (zh) | 2023-09-05 |
| CN111865799A (zh) | 2020-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2022012576A1 (zh) | 路径规划方法、装置、路径规划设备及存储介质 | |
| US10594591B2 (en) | Information processing apparatus, method and non-transitory computer-readable storage medium | |
| CN110636007B (zh) | 边缘计算网络的路由编排方法、路由编排器及系统 | |
| JPWO2011148583A1 (ja) | バス制御装置およびバス制御装置に指示を出力する制御装置 | |
| US20160065449A1 (en) | Bandwidth-Weighted Equal Cost Multi-Path Routing | |
| CN105634974A (zh) | 软件定义网络中的路由确定方法和装置 | |
| CN108111335A (zh) | 一种调度和链接虚拟网络功能的方法及系统 | |
| US20080222303A1 (en) | Latency hiding message passing protocol | |
| CN103914556A (zh) | 大规模图数据处理方法 | |
| CN117135108B (zh) | 路由路径规划方法、路由请求处理方法、设备及介质 | |
| CN108347377B (zh) | 数据转发方法及装置 | |
| US9749219B2 (en) | Method of optimizing routing in a cluster comprising static communication links and computer program implementing that method | |
| US10805241B2 (en) | Database functions-defined network switch and database system | |
| CN106776014B (zh) | 异构计算中的并行加速方法及系统 | |
| CN114003775A (zh) | 图数据处理、查询方法及其系统 | |
| EP3442172B1 (en) | Network topology system and building methods for topologies and routing tables thereof | |
| CN116915708A (zh) | 路由数据包的方法、处理器及可读存储介质 | |
| KR102153814B1 (ko) | 로드 균형을 위한 확률 기반 적응형 라우팅 알고리즘 | |
| CN105740249A (zh) | 一种大数据作业并行调度过程中的处理方法及其系统 | |
| CN115587222B (zh) | 分布式图计算方法、系统及设备 | |
| US8549259B2 (en) | Performing a vector collective operation on a parallel computer having a plurality of compute nodes | |
| CN110958666A (zh) | 基于强化学习的网络切片资源映射方法 | |
| CN106657333B (zh) | 一种基于云服务模式的集中式目录数据交换系统及方法 | |
| US9203733B2 (en) | Method of pseudo-dynamic routing in a cluster comprising static communication links and computer program implementing that method | |
| CN110138670B (zh) | 一种基于动态路径的负载迁移方法 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 08/05/2023) |
|
| 32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 08/05/2023) |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 21842987 Country of ref document: EP Kind code of ref document: A1 |