CN112822105A - Path planning method and device and data transmission system - Google Patents
Path planning method and device and data transmission system Download PDFInfo
- Publication number
- CN112822105A CN112822105A CN201911119744.4A CN201911119744A CN112822105A CN 112822105 A CN112822105 A CN 112822105A CN 201911119744 A CN201911119744 A CN 201911119744A CN 112822105 A CN112822105 A CN 112822105A
- Authority
- CN
- China
- Prior art keywords
- path
- virtual
- nodes
- sub
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- 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/302—Route determination based on requested QoS
-
- 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/12—Shortest path evaluation
-
- 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/34—Source routing
-
- 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/42—Centralised routing
Abstract
The application discloses a path planning method and device and a data transmission system, and belongs to the technical field of communication. The method comprises the following steps: determining a transmission parameter condition of a path to be planned between a head node and a tail node of a flow; in at least one virtual path between a head node and a tail node, searching a target virtual path with transmission parameters meeting transmission parameter conditions, wherein the transmission parameters of the virtual path are as follows: the transmission parameters of the physical path corresponding to the virtual path, and each node on the virtual path is positioned on the corresponding physical path; and sending path planning information to the head node, wherein the path planning information is used for indicating the labels and the sequence of the nodes in the target virtual path. The method and the device solve the problem that the current controller planning path is single, enrich the path planning mode, and are used for path planning.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a path planning method and apparatus, and a data transmission system.
Background
SRv6 is a network forwarding technology suitable for internet protocol version 6 (IPv 6), SR is also called segment routing.
At SRv6, the controller may generally plan a path for the plurality of nodes based on the physical path between the plurality of nodes and issue information (e.g., labels and sequences) for the nodes in the planned path to a head node of the plurality of nodes. After receiving the data to be forwarded sent by the terminal, the head node encapsulates the data to be forwarded into a data packet based on the information of the nodes in the path issued before the controller. The data packet includes a Segment Routing Header (SRH) carrying information of a node in the path, and a load portion carrying the data to be forwarded.
However, the current way of planning the path by the controller is single.
Disclosure of Invention
The application provides a path planning method and device and a data transmission system, which can solve the problem that the current controller has a single path planning mode, and the technical scheme is as follows:
in one aspect, a method for path planning is provided, where the method includes: determining a transmission parameter condition of a path to be planned between a head node and a tail node of a flow; in at least one virtual path between the head node and the tail node, searching a target virtual path whose transmission parameters meet the transmission parameter condition, where the transmission parameters of the virtual path are: each node on the virtual path is located on the corresponding physical path; and sending path planning information to the head node, wherein the path planning information is used for indicating labels and sequences of the nodes in the target virtual path.
In the path planning method, the controller may search, based on the transmission parameter condition, a target virtual path for which the transmission parameter satisfies the transmission parameter condition, in at least one virtual path between the head node and the tail node. And then the controller sends the label used for indicating the node in the target virtual path and the sequential path planning information to the head node. It can be seen that the embodiment of the application provides a brand-new path planning method, so that the path planning modes are enriched.
Optionally, the target virtual path is: and in the at least one virtual path, the virtual path with the least number of nodes in the virtual path with the transmission parameters meeting the transmission parameter conditions. It can be seen that the target virtual path searched by the path planning apparatus is the path with the least number of nodes in the virtual path satisfying the transmission parameter condition in the at least one virtual path. At this time, the number of labels of nodes required to be carried in the SRH is small, so that the SRH is short, the duty ratio of the load in the data packet where the SRH is located is large, and the load rate of the data packet is improved.
Optionally, the searching, in at least one virtual path between the head node and the tail node, a target virtual path whose transmission parameter satisfies the transmission parameter condition includes: sequentially detecting whether a virtual path with transmission parameters meeting the transmission parameter conditions exists in the at least one virtual path according to the sequence that the number of nodes on the virtual path is sequentially increased; when detecting that a virtual path with transmission parameters meeting the transmission parameter conditions exists in the at least one virtual path, determining the virtual path with the transmission parameters meeting the transmission parameter conditions as the target virtual path. It can be seen that, in order to increase the speed at which the controller finds the target virtual path and ensure that the found target virtual path is the path with the least number of nodes in the at least one virtual path, the controller may sequentially detect whether a virtual path whose transmission parameters satisfy the transmission parameter conditions exists in the at least one virtual path according to the sequence in which the number of nodes in the virtual path is sequentially increased. For example, the controller may first sequentially detect whether transmission parameters of a virtual path including i (i ≧ 2) nodes satisfy a transmission parameter condition. If it is detected that the transmission parameter of a virtual path including i nodes satisfies the transmission parameter condition, the controller may directly determine the virtual path as a target virtual path. If the transmission parameters of all the virtual paths including the i nodes do not satisfy the transmission parameter conditions, the controller needs to further detect whether the transmission parameters of the virtual paths including the i +1 nodes satisfy the transmission parameter conditions until the controller finds the virtual path whose transmission parameters satisfy the transmission parameter conditions.
It should be noted that, in the present application, the controller sequentially detects whether there is a virtual path in the at least one virtual path whose transmission parameters satisfy the transmission parameter condition according to the order in which the number of nodes on the virtual path sequentially increases. Optionally, the controller may find a part of the virtual paths in which the transmission parameters satisfy the transmission parameter conditions in the at least one virtual path, and then determine a path with the minimum number of nodes in the part of the virtual paths as the target virtual path. The embodiments of the present application do not limit this. For example, the transmission parameter is a time delay, and the transmission parameter condition is that the time delay is less than 30 seconds. Assuming that the portion of the at least one virtual path includes: virtual path x (node 1-node 5-node 4-node 3) with a delay of 25 seconds, and virtual path y (node 1-node 2-node 3) with a delay of 28 seconds. The controller may determine the virtual path y as the target virtual path.
Optionally, the virtual path includes: at least one directly connected virtual sub-path; the physical path corresponding to the virtual path comprises: at least one physical sub-path; the at least one directly connected virtual sub-path corresponds to the at least one physical sub-path one to one, and the physical sub-path corresponding to the directly connected virtual sub-path is: and an Interior Gateway Protocol (IGP) physical sub-path between two nodes directly connected by the direct connection virtual sub-path. It should be noted that, in the embodiment of the present application, a virtual path is determined based on a direct-connected virtual sub-path, and of course, the virtual path may not be determined based on the direct-connected virtual sub-path. For example, the virtual path may include at least one virtual sub-path, and all of the at least one virtual sub-path may not be direct-connected virtual sub-paths, or one part of the at least one virtual sub-path may be direct-connected virtual sub-paths and the other part of the at least one virtual sub-path is not direct-connected virtual sub-paths.
Optionally, before the determining a transmission parameter condition of a path to be planned between a head node and a tail node of a flow, the method further includes: acquiring transmission parameters of the direct connection virtual sub-path between any two nodes in the plurality of nodes; the searching, in at least one virtual path between the head node and the tail node, a target virtual path whose transmission parameters satisfy the transmission parameter condition includes: determining a transmission parameter of each of the direct connection virtual sub-paths of the at least one virtual path based on a transmission parameter of the direct connection virtual sub-path between any two nodes of the plurality of nodes; determining a transmission parameter of each virtual path based on a transmission parameter of a directly connected virtual sub-path of each virtual path in the at least one virtual path; and searching the target virtual path in the at least one virtual path based on the transmission parameters of the at least one virtual path. In the embodiment of the present application, for example, the controller obtains the transmission parameters of the directly connected virtual sub-path in advance before planning the path, and certainly, the transmission parameters of the directly connected virtual sub-path may be obtained only when the path is planned, which is not limited in the embodiment of the present application.
Optionally, after the obtaining of the transmission parameter of the direct connection virtual sub-path between any two nodes in the plurality of nodes, the method further includes: establishing a virtual topology of the plurality of nodes based on transmission parameters of the direct connection virtual sub-path between any two of the plurality of nodes, wherein the virtual topology comprises the plurality of nodes, the direct connection virtual sub-path between any two of the plurality of nodes, and the transmission parameters of the direct connection virtual sub-path; the determining, based on the transmission parameters of the direct connection virtual sub-path between any two nodes in the plurality of nodes, the transmission parameters of each virtual sub-path of the at least one virtual path includes: determining transmission parameters of each of the directly connected virtual sub-paths of the at least one virtual path based on the virtual topology.
Optionally, the path planning information is further used to indicate: an identification of the target virtual path.
Optionally, the transmission parameters include: service level agreement SLA parameters.
In a second aspect, a path planning apparatus is provided, which includes: and the modules are used for realizing the path planning method provided by the first aspect.
In a third aspect, a path planning apparatus is provided, which includes: a processor and a memory, the memory having a program stored therein, the processor being configured to execute the program stored in the memory to implement the path planning method of the first aspect.
In a fourth aspect, a computer storage medium is provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the path planning method according to the first aspect.
In a fifth aspect, there is provided a computer program product comprising instructions which, when run on a computer, cause the computer to perform the path planning method of the first aspect.
In a sixth aspect, there is provided a data transmission system comprising: a controller and a plurality of nodes, the controller comprising the path planning apparatus of the second aspect or the third aspect.
Drawings
Fig. 1 is a schematic structural diagram of a data transmission system according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a path planning apparatus according to an embodiment of the present application;
fig. 3 is a flowchart of a path planning method according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a virtual sub-path provided by an embodiment of the present application;
FIG. 5 is a schematic diagram of a physical sub-path provided in an embodiment of the present application;
fig. 6 is a schematic structural diagram of another path planning apparatus according to an embodiment of the present application.
Detailed Description
To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
An embodiment of the present application provides a data transmission system, as shown in fig. 1, the data transmission system may include: a controller 101 and a plurality of nodes 102. Further, the data transmission system may further include a transmitting end (not shown in fig. 1) and a receiving end (not shown in fig. 1). It should be noted that, in the embodiment of the present application, the number of the nodes 102, the sending end, and the receiving end is not limited, and the data transmission system in fig. 1 includes 12 nodes 102.
For example, the controller 101 may be referred to as a network cloud engine-internet protocol (NCE-IP) controller, and the controller 101 may be a server or a server cluster composed of a plurality of servers. The node 102 may be referred to as a forwarding node or a forwarding device, and the node 102 may be a switch, a router, or the like for forwarding data. The sending end and the receiving end can be terminals such as mobile phones and computers. A physical path exists between the plurality of nodes 102, for example, a physical path may exist between some nodes in the plurality of nodes, and no physical path exists between some nodes. The controller 101 may establish a communication connection with at least some of the plurality of nodes 102 (fig. 1 illustrates an example in which the controller establishes a communication connection with some nodes), and the communication connection may be referred to as a border gateway protocol link (BGP-LS).
In the data transmission system, the controller 101 may plan a path between the plurality of nodes 102, and then, after the plurality of nodes 102 receive data transmitted from the transmitting end, the data may be transmitted to the receiving end based on the path planned in advance by the controller 101.
Illustratively, both controller 101 and node 102 may be devices employing SRv6 technology. In the related art, when the controller 101 plans a path for two nodes (one of the nodes is referred to as a head node and the other node is referred to as a tail node) of the plurality of nodes 102, the controller 101 may first determine a plurality of physical paths between the head node and the tail node. Then, the controller 101 needs to constrain and calculate a path with the minimum cost among the multiple physical paths according to a Service Level Agreement (SLA), and compress the path by combining an Interior Gateway Protocol (IGP) route, so as to reduce nodes in the path. Finally, the controller may send the compressed information (such as labels and sequences) of each node in the path to the head node. In the subsequent process, if the head node receives the data to be forwarded sent by the sending end, the head node encapsulates the data to be forwarded into a data packet based on the information of each node in the path sent by the controller before, and forwards the data packet based on the SRH in the data packet. Wherein, the data packet includes: SRH carrying information of nodes in the forwarding path, and a load part carrying the data to be forwarded.
However, the current way of planning the path by the controller is single. The embodiment of the application provides a brand-new path planning scheme, and the path planning modes can be enriched.
The path planning method provided by the embodiment of the application can be used for a path planning device (the path planning device can be used for the controller). For example, fig. 2 is a schematic structural diagram of a path planning apparatus provided in an embodiment of the present application, and as shown in fig. 2, the path planning apparatus may include: the path planning system comprises a memory 201 and a processor 202, wherein the memory 201 stores programs, and the processor 202 is configured to execute the programs stored in the memory 201 to implement the operations performed by the path planning method and/or the controller, such as the controller 101, provided by the embodiments of the present application. A and/or B may represent A and B, or may represent A or B. Optionally, the path planning apparatus may further include: at least one interface 203 (one interface is shown in fig. 2) and at least one communication bus 204 (one communication bus is shown in fig. 2). The interface 203 is used for communication with other storage devices or network devices. The memory 202 and the interface 203 are connected to the processor 201 via a communication bus 204, respectively.
For example, fig. 3 is a flowchart of a path planning method provided in an embodiment of the present application, where the path planning method may be used in the controller 101 in the data transmission system shown in fig. 1, and as shown in fig. 3, the path planning method includes:
Illustratively, the plurality of nodes in operation 301 may be the plurality of nodes 102 in the data transmission system shown in fig. 1. In operation 301, the controller needs to determine a direct connection virtual sub-path between any two nodes of the plurality of nodes. It should be noted that the direct-connection virtual sub-path is not a real path, but a path virtualized by the controller, and the direct-connection virtual sub-path between two nodes does not include other nodes except the two nodes.
For example, as shown in fig. 4, assuming that the plurality of nodes includes nodes 1, 2, 3, 4, 5 and 6, the controller needs to determine in operation 301: a direct connection virtual sub-path between nodes 1 and 2, a direct connection virtual sub-path between nodes 1 and 3, a direct connection virtual sub-path between nodes 1 and 4, a direct connection virtual sub-path between nodes 1 and 5, a direct connection virtual sub-path between nodes 1 and 6, a direct connection virtual sub-path between nodes 2 and 3, a direct connection virtual sub-path between nodes 2 and 4, a direct connection virtual sub-path between nodes 2 and 5, a direct connection virtual sub-path between nodes 2 and 6, a direct connection virtual sub-path between nodes 3 and 4, a direct connection virtual sub-path between nodes 3 and 5, a direct connection virtual sub-path between nodes 3 and 6, a direct connection virtual sub-path between nodes 4 and 5, a direct connection virtual sub-path between nodes 4 and 6, and a direct connection virtual sub-path between nodes 5 and 6.
In this embodiment of the present application, for example, the controller needs to determine a direct connection virtual sub-path between any two nodes in the plurality of nodes, optionally, the controller may only determine a direct connection virtual sub-path between some nodes in the plurality of nodes, which is not limited in this embodiment of the present application.
After determining the direct connection virtual sub-paths between each two nodes in the plurality of nodes, the controller needs to further determine transmission parameters of each direct connection virtual sub-path. Illustratively, for a direct connection virtual sub-path between every two nodes, the direct connection virtual sub-path corresponds to a physical sub-path. Accordingly, the transmission parameter of the direct connection virtual sub-path may be a transmission parameter of a physical sub-path corresponding to the direct connection virtual sub-path. When determining the transmission parameters of the directly connected virtual sub-path, the controller needs to first determine an IGP physical sub-path between two nodes directly connected to the directly connected virtual sub-path, and then determine the transmission parameters of the IPG physical sub-path as the transmission parameters of the directly connected virtual sub-path. It should be noted that the physical sub-path is an IGP physical sub-path between two nodes directly connected to the directly connected virtual sub-path. For example, if a data packet starts from the head node, the data packet may reach the other node of the two nodes through a unique physical path according to the IPG, where the physical path may be referred to as an IGP physical sub-path between the two nodes.
For example, assuming that the physical paths actually existing between the six nodes in fig. 4 are as shown in fig. 5, it can be seen that a physical sub-path exists between the node 1 and the node 2, a physical sub-path exists between the node 2 and the node 3, a physical sub-path exists between the node 1 and the node 5, a physical sub-path exists between the node 5 and the node 4, a physical sub-path exists between the node 4 and the node 3, a physical sub-path exists between the node 5 and the node 6, and a physical sub-path exists between the node 6 and the node 4. When the controller determines the transmission parameters of the virtual sub-path between the node 1 and the node 3, if the IGP physical sub-path between the node 1 and the node 3 is: physical sub-path 1 (node 1-node 2-node 3). The controller may determine the transmission parameters of the physical sub-path 1 as the transmission parameters of the virtual sub-path between node 1 and node 3.
Further, the transmission parameter may be an SLA parameter, such as a time delay or a packet loss rate, and in this embodiment, the time delay is taken as an example. The physical sub-path may be formed by connecting at least one direct physical path, and the latency of the physical sub-path may be the sum of the latencies of the at least one direct physical path. For example, physical sub-path 1 (node 1-node 2-node 3) includes: a direct connection physical path 1.1 (node 1-node 2), and a direct connection physical path 1.2 (node 2-node 3), and if the latency of the direct connection physical path 1.1 is 0.1 second and the latency of the direct connection physical path 1.1 is 0.2 second, the latency of the physical sub-path 1 is 0.1 second +0.2 second, which is 0.3 second.
The virtual topology comprises the plurality of nodes, a direct connection virtual sub-path between any two nodes in the plurality of nodes, and transmission parameters of the direct connection virtual sub-path. For example, the virtual topology may be a topology obtained by labeling transmission parameters on each directly connected virtual sub-path in fig. 4.
The controller typically plans the forwarding path for at least one flow (data flow), and each flow may correspond to a head node and a tail node. One flow in operation 303 may be any flow for which the controller needs to plan a path. Moreover, each stream has certain requirements on transmission parameters, such as the requirement on time delay lower than 3 seconds. The controller needs to determine the transmission parameter condition of the path to be planned between the head node and the tail node of the flow (corresponding to the requirement of the flow for the transmission parameter) in operation 303.
After obtaining the virtual topology and the transmission parameter conditions of the path to be planned between the head node and the tail node, the controller may first determine at least one virtual path between the head node and the tail node based on the virtual topology. It should be noted that the virtual path may be determined based on the directly connected virtual sub-paths in operation 301, where the virtual path includes at least one directly connected virtual sub-path.
For example, when the head node is node 1 in fig. 4 and the tail node is node 3 in fig. 4, at least one virtual path between node 1 and node 3 includes: the virtual path 1 (node 1-node 3), the virtual path 2 (node 1-node 2-node 3), and the virtual path 3 (node 1-node 4-node 3), at least one virtual path between the node 1 and the node 3 may further include other virtual paths, which are not listed herein in this embodiment of the application. Wherein, the virtual path 1 comprises a direct connection virtual sub-path (a direct connection virtual sub-path between the node 1 and the node 3); virtual path 2 comprises two directly connected virtual sub-paths (a directly connected virtual sub-path between node 1 and node 2, and a directly connected virtual sub-path between node 2 and node 3); virtual path 3 includes two directly connected virtual sub-paths (a directly connected virtual sub-path between node 1 and node 4, and a directly connected virtual sub-path between node 4 and node 3).
After determining at least one virtual path between the head node and the tail node, the controller needs to determine transmission parameters for each virtual path. For example, when determining the transmission parameters of the virtual path, the controller may first determine the transmission parameters of each directly connected virtual sub-path in the virtual path, and then determine the transmission parameters of the virtual path based on the transmission parameters of all directly connected virtual sub-paths in the virtual path.
And each node on the virtual path is positioned on the corresponding physical path. For example, the virtual path includes at least one direct connection virtual sub-path, and the physical path corresponding to the virtual path includes: at least one physical sub-path; the at least one directly connected virtual sub-path corresponds to the at least one physical sub-path one to one, and the physical sub-path corresponding to each directly connected virtual sub-path is as follows: an IGP physical sub-path between two nodes directly connected by the directly connected virtual sub-path. At this time, the transmission parameters of each virtual path can be regarded as: and the transmission parameters of the physical path corresponding to the virtual path.
Further, the controller may further search for a target virtual path, of which transmission parameters satisfy the transmission parameter condition, in at least one virtual path between the head node and the tail node. For example, in order to increase the speed at which the controller finds the target virtual path and ensure that the found target virtual path is the path with the least number of nodes in the at least one virtual path, the controller may sequentially detect whether a virtual path whose transmission parameters satisfy the transmission parameter conditions exists in the at least one virtual path according to the sequence in which the number of nodes in the virtual path is sequentially increased. For example, the controller may first sequentially detect whether transmission parameters of a virtual path including i (i ≧ 2) nodes satisfy a transmission parameter condition. If it is detected that the transmission parameter of a virtual path including i nodes satisfies the transmission parameter condition, the controller may directly determine the virtual path as a target virtual path. If the transmission parameters of all the virtual paths including the i nodes do not satisfy the transmission parameter conditions, the controller needs to further detect whether the transmission parameters of the virtual paths including the i +1 nodes satisfy the transmission parameter conditions until the controller finds the virtual path whose transmission parameters satisfy the transmission parameter conditions.
For example, continuing with the above example in operation 304, there are two nodes on virtual path 1 and three nodes on virtual paths 2 and 3. The controller may first detect whether the transmission parameter of the virtual path 1 satisfies the transmission parameter condition, and if the transmission parameter of the virtual path 1 satisfies the transmission parameter condition, directly determine the virtual path 1 as the target virtual path. If the transmission parameter of the virtual path 1 does not satisfy the transmission parameter condition, the controller may sequentially detect whether the transmission parameters of the virtual path 2 and the virtual path 3 satisfy the transmission parameter condition; if the transmission parameter of the virtual path 2 meets the transmission parameter condition, directly determining the virtual path 2 as the target virtual path; if the transmission parameter of the virtual path 3 satisfies the transmission parameter condition, the virtual path 3 is directly determined as the target virtual path. It should be noted that, when detecting whether the transmission parameters of the virtual path 2 and the virtual path 3 satisfy the transmission parameter conditions, the controller may first detect whether the transmission parameters of the virtual path 2 satisfy the transmission parameter conditions, and then detect whether the transmission parameters of the virtual path 3 satisfy the transmission parameter conditions; or, it may be that, first, it is detected whether the transmission parameter of the virtual path 3 satisfies the transmission parameter condition, and then, it is detected whether the transmission parameter of the virtual path 2 satisfies the transmission parameter condition; or, it may be detected whether the transmission parameters of the virtual paths 2 and 3 satisfy the transmission parameter condition, and when the transmission parameters of the virtual paths 2 and 3 both satisfy the transmission parameter condition, the virtual path 2 or 3 is determined as the target virtual path, which is not limited in this embodiment of the application.
It should be noted that, since the number of nodes on the virtual path is usually equal to the hop count between the start node and the end node in the virtual path plus one, the controller sequentially detects the at least one virtual path according to the order in which the number of nodes on the virtual path sequentially increases (the number sequentially increases from two), which can be regarded as that the controller sequentially detects the at least one virtual path according to the order in which the number of hops between the start node and the end node on the virtual path sequentially increases (the number sequentially increases from one).
After determining the target virtual path, the controller may send path planning information to the head node based on the target virtual path. Wherein the path planning information is used to indicate labels and sequences of nodes in the target virtual path. Optionally, the path planning information is further used to indicate: an identification of the target virtual path. Illustratively, the controller may send the path planning information to the head node based on SR criteria (such as the SRv6 criteria).
When the head node forwards data, whether a node positioned on the target virtual path exists in adjacent nodes is detected, and if the node positioned on the target virtual path exists, the data is directly forwarded to the node; if the node on the target virtual path does not exist, the adjacent node to which the data needs to be forwarded can be determined according to the IPG, and then the data is forwarded to the adjacent node. Each node that receives the data may forward the data by referring to a manner in which the head node forwards the data, which is not described herein in detail in this embodiment of the present application. Moreover, since the target virtual path is determined based on the IGP physical sub-path, the data can be guaranteed to be forwarded along the physical path corresponding to the target virtual path by using the above-mentioned data forwarding method.
For example, assume that the target virtual path is node 1-node 4-node 3 in fig. 4, where node 1 is the head node and node 3 is the tail node. When the node 1 forwards data, the data may be first encapsulated in a data packet, and the SRH in the data packet carries the label of the node 1, the label of the node 4, and the label of the node 3, which are arranged in sequence. Thereafter, node 1 may forward the packet, at which point node 1 may delete the label of node 1 in SRH and forward the packet to node 5 based on IGP, since the same node as node 4 does not exist in the neighboring nodes of node 1 (including node 5 and node 2). After receiving the packet, the node 5 may forward the packet to the node 4 because the same node as the node 4 exists in the neighboring nodes of the node 5 (including the node 4, the node 6, and the node 6). After receiving the packet, node 4 may delete the label of node 4 in SRH and forward the packet to node 3, because the same node as node 3 exists in the neighboring nodes of node 4 (including node 5 and node 3). In this way, the purpose of forwarding the data packet from node 1 to node 3 along the target virtual path (node 1-node 4-node 3) is achieved.
It can be seen that, in the present application, the controller issues the labels and the sequence of the nodes in the target virtual path to the head node to indicate the head node that the target virtual path is. When forwarding data, the head node may only carry the label of the node in the target virtual path in the SRH, and forward the data along the physical path corresponding to the target virtual path based on the label of the node in the target virtual path. It should be noted that the length of the data packet is usually about 1500 bytes, and the length of the SRH is about 128 bytes, so if the SRH is too long, the load in the data packet is short, and the load rate is low. In the application, when the number of the nodes on the target virtual path is less than that of the nodes on the physical path corresponding to the target virtual path, the number of the labels of the nodes required to be carried in the SRH is less, so that the SRH is shorter, the occupation ratio of the load in the data packet where the SRH is located is larger, and the load rate of the data packet is improved.
It should be noted that, in the foregoing path planning scheme in the related art, the controller first determines multiple physical paths between the head node and the tail node, calculates a path with the minimum cost based on SLA constraints among the multiple physical paths, and compresses the path in combination with the IGP route to reduce nodes in the path. However, since the path with the lowest cost may not be the path that satisfies the SLA constraint and has the least nodes after compression, the number of nodes in the compressed path with the lowest cost is still more, and the load rate of the data packet forwarded by the head node is still lower. In the method provided by the embodiment of the present application, a virtual sub-path between every two nodes in a pre-established virtual topology represents an IGP physical sub-path between the two nodes. Then, the controller determines that the number of nodes on the target virtual path is minimum based on the virtual topology, the length of the SRH in the data packet sent by the head node is small, and the load rate of the data packet is high. Moreover, the physical path corresponding to the target virtual path (i.e. the physical path through which the data packet is actually transmitted) can satisfy the transmission parameter condition (e.g. satisfy the SLA constraint).
Optionally, the path planning method provided by the embodiment of the present application may further support dynamic adjustment of the path. This dynamic adjustment process will be explained below.
For example, after the controller sends the path planning information to the head node, it may further detect whether a failed direct connection virtual sub-path exists in the target virtual path, where an IGP physical sub-path corresponding to the failed direct connection virtual sub-path fails. The controller may detect whether the IGP physical sub-path fails in any manner, which is not limited in this embodiment of the present application. For example, when the duration of data transmission on a certain IGP physical sub-path is greater than the duration threshold, the controller may determine that the IGP physical sub-path is faulty; alternatively, when the packet loss rate on a certain IGP physical sub-path is greater than the packet loss rate threshold, the controller may determine that the IGP physical sub-path fails.
If the controller determines that the target virtual path has the direct connection virtual sub-path with the fault, the controller may search, in at least one virtual path between the head node and the tail node, for the auxiliary virtual path whose transmission parameters satisfy the transmission parameter conditions, in the remaining virtual sub-paths except for the virtual sub-path where the direct connection virtual sub-path with the fault is located. In addition, the manner of searching the auxiliary virtual path by the controller may refer to the manner of searching the target virtual path, which is not described herein in detail in this embodiment of the present application. After finding the auxiliary virtual path, the controller may send path update information to the head node, where the path update information includes: labels and order of nodes in the secondary virtual path. The path update information is used to instruct the head node to update the path planning information before the head node updates the head node with the path update information. Therefore, when the subsequent head node forwards the data, the label of the node in the auxiliary virtual path can be carried in the SRH, so that the path for forwarding the data can be changed, and the data is prevented from being transmitted on the failed path.
To sum up, the embodiment of the present application provides a path planning method, in which a controller may search, based on a transmission parameter condition, a target virtual path whose transmission parameter satisfies the transmission parameter condition in at least one virtual path between a head node and a tail node. And then the controller sends the label used for indicating the node in the target virtual path and the sequential path planning information to the head node. It can be seen that the embodiment of the application provides a brand-new path planning method, so that the path planning modes are enriched.
It should be noted that, in operation 304, the virtual path is determined based on the directly connected virtual sub-path, but of course, the virtual path may not be determined based on the directly connected virtual sub-path. For example, the virtual path may include at least one virtual sub-path, and all of the at least one virtual sub-path may not be direct-connected virtual sub-paths, or one part of the at least one virtual sub-path may be direct-connected virtual sub-paths and the other part of the at least one virtual sub-path is not direct-connected virtual sub-paths.
In operation 304, for example, the controller sequentially detects whether there is a virtual path in the at least one virtual path whose transmission parameters satisfy the transmission parameter condition in an order that the number of nodes in the virtual path sequentially increases. Optionally, the controller may find a part of the virtual paths in which the transmission parameters satisfy the transmission parameter conditions in the at least one virtual path, and then determine a path with the minimum number of nodes in the part of the virtual paths as the target virtual path. The embodiments of the present application do not limit this. For example, the transmission parameter is a time delay, and the transmission parameter condition is that the time delay is less than 30 seconds. Assuming that the portion of the at least one virtual path includes: virtual path x (node 1-node 5-node 4-node 3) with a delay of 25 seconds, and virtual path y (node 1-node 2-node 3) with a delay of 28 seconds. At this time, the controller may determine the virtual path y having the smallest number of nodes in the part of the virtual paths as the target virtual path.
In the embodiment of the present application, for example, the controller obtains the transmission parameters of the directly connected virtual sub-path in advance before planning the path, and certainly, the transmission parameters of the directly connected virtual sub-path may be obtained only when the path is planned, which is not limited in the embodiment of the present application. At this time, the virtual topology described above need not be established.
In addition, in the embodiment of the present application, the physical sub-path corresponding to each directly connected virtual sub-path is: an IGP physical sub-path between two nodes directly connected to the virtual sub-path is taken as an example. At this time, the physical path corresponding to the virtual path including the direct connection virtual sub-path is composed of at least one IGP physical sub-path. Therefore, when the head node forwards the data, the number of labels of the nodes carried by the SRH in the data packet of the encapsulated data is minimum, and the data packet can be forwarded along the physical path corresponding to the virtual path.
In the related art, when the controller plans a path each time, the controller needs to calculate transmission parameters of a physical path, and then screens one physical path based on the transmission parameter conditions, so that the calculation amount in the path planning process each time is large. In the embodiment of the present application, the controller may pre-establish a virtual topology of a plurality of nodes, and may subsequently search the target virtual path based on the virtual topology each time a path is planned between the head node and the tail node. Therefore, the transmission parameters of the physical sub-paths corresponding to the directly-connected virtual sub-paths are avoided being calculated in the process of planning the paths each time. Therefore, the calculation amount in the path planning process is reduced, and the path planning efficiency is improved.
In the related art, a path planning method is also available, in which a worker designates a path between a head node and a tail node to a controller, and the controller transmits path planning information to the head node based on the path. However, this solution is labor-intensive and generally does not support dynamic adjustment of the path. In the path planning method provided by the embodiment of the application, the controller can automatically plan the path without the participation of workers, so that the labor cost is reduced. Moreover, the method and the device can support dynamic adjustment of the path.
Fig. 6 is a schematic structural diagram of another path planning apparatus provided in an embodiment of the present application, and as shown in fig. 6, the path planning apparatus includes:
a determining module 501, configured to determine a transmission parameter condition of a path to be planned between a head node and a tail node of a flow;
a searching module 502, configured to search, in at least one virtual path between a head node and a tail node, a target virtual path whose transmission parameters meet a transmission parameter condition, where the transmission parameters of the virtual path are: the transmission parameters of the physical path corresponding to the virtual path, and each node on the virtual path is positioned on the corresponding physical path;
a sending module 503, configured to send path planning information to the head node, where the path planning information is used to indicate labels and sequences of nodes in the target virtual path.
To sum up, the embodiment of the present application provides a path planning apparatus, where a search module in the path planning apparatus may search, based on a transmission parameter condition, a target virtual path of which a transmission parameter satisfies the transmission parameter condition in at least one virtual path between a head node and a tail node. And then, the sending module sends the label used for indicating the node in the target virtual path and the sequential path planning information to the head node. It can be seen that the path planning device provided by the embodiment of the application can execute a brand-new path planning method, thereby enriching the path planning modes.
Optionally, the target virtual path is: and in the at least one virtual path, the virtual path with the least number of nodes in the virtual path with the transmission parameters meeting the transmission parameter conditions.
Optionally, the lookup module is configured to:
sequentially detecting whether a virtual path with transmission parameters meeting transmission parameter conditions exists in at least one virtual path according to the sequence that the number of nodes on the virtual path is sequentially increased;
when detecting that a virtual path with transmission parameters meeting the transmission parameter conditions exists in at least one virtual path, determining the virtual path with the transmission parameters meeting the transmission parameter conditions as a target virtual path.
Optionally, the virtual path comprises: at least one directly connected virtual sub-path; the physical path corresponding to the virtual path comprises: at least one physical sub-path;
at least one directly connected virtual sub-path corresponds to at least one physical sub-path one to one, and the physical sub-path corresponding to the directly connected virtual sub-path is: an interior gateway protocol, IGP, physical sub-path between two nodes directly connected by a direct virtual sub-path.
Optionally, the path planning apparatus further includes:
the acquisition module is used for acquiring transmission parameters of a direct connection virtual sub-path between any two nodes in the plurality of nodes;
the search module is used for:
determining a transmission parameter of each directly connected virtual sub-path of at least one virtual path based on a transmission parameter of the directly connected virtual sub-path between any two nodes in the plurality of nodes;
determining a transmission parameter of each virtual path based on the transmission parameter of the direct connection virtual sub-path of each virtual path in at least one virtual path;
and searching a target virtual path in the at least one virtual path based on the transmission parameters of the at least one virtual path.
Optionally, the path planning apparatus further includes:
the system comprises an establishing module, a judging module and a judging module, wherein the establishing module is used for establishing a virtual topology of a plurality of nodes based on transmission parameters of direct-connected virtual sub-paths between any two nodes in the plurality of nodes, and the virtual topology comprises the plurality of nodes, the direct-connected virtual sub-paths between any two nodes in the plurality of nodes and the transmission parameters of the direct-connected virtual sub-paths;
the search module is used for:
based on the virtual topology, determining transmission parameters of each directly connected virtual sub-path of the at least one virtual path.
Optionally, the path planning information is further used to indicate: identification of a target virtual path.
Optionally, the transmission parameters include: service level agreement SLA parameters.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product comprising one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic, digital subscriber line) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or can comprise one or more data storage devices, such as a server, a data center, etc., integrated with the available medium. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium, or a semiconductor medium (e.g., solid state disk), among others.
It should be noted that, the method embodiments provided in the embodiments of the present application can be mutually referred to corresponding apparatus embodiments, and the embodiments of the present application do not limit this. The sequence of operations in the method embodiments provided in the present application can be appropriately adjusted, and the operations can be increased or decreased according to the circumstances, and any method that can be easily conceived by a person skilled in the art within the technical scope disclosed in the present application shall be covered by the protection scope of the present application, and therefore, the details are not repeated.
In this application, "at least one" means one or more, "a plurality" means two or more. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of singular or plural items. For example, at least one of a, b, or c, may represent: a, b, c, a + b, a + c, b + c, and a + b + c, wherein a, b, and c may be single or multiple. In this disclosure, the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
The above description is only exemplary of the present application and should not be taken as limiting, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the protection scope of the present application.
Claims (19)
1. A method of path planning, the method comprising:
determining a transmission parameter condition of a path to be planned between a head node and a tail node of a flow;
in at least one virtual path between the head node and the tail node, searching a target virtual path whose transmission parameters meet the transmission parameter condition, where the transmission parameters of the virtual path are: each node on the virtual path is located on the corresponding physical path;
and sending path planning information to the head node, wherein the path planning information is used for indicating labels and sequences of the nodes in the target virtual path.
2. The method of claim 1, wherein the target virtual path is: and in the at least one virtual path, the virtual path with the least number of nodes in the virtual path with the transmission parameters meeting the transmission parameter conditions.
3. The method according to claim 2, wherein the finding, in the at least one virtual path between the head node and the tail node, a target virtual path with transmission parameters satisfying the transmission parameter condition comprises:
sequentially detecting whether a virtual path with transmission parameters meeting the transmission parameter conditions exists in the at least one virtual path according to the sequence that the number of nodes on the virtual path is sequentially increased;
when detecting that a virtual path with transmission parameters meeting the transmission parameter conditions exists in the at least one virtual path, determining the virtual path with the transmission parameters meeting the transmission parameter conditions as the target virtual path.
4. A method according to any one of claims 1 to 3, wherein the virtual path comprises: at least one directly connected virtual sub-path; the physical path corresponding to the virtual path comprises: at least one physical sub-path;
the at least one directly connected virtual sub-path corresponds to the at least one physical sub-path one to one, and the physical sub-path corresponding to the directly connected virtual sub-path is: and an Interior Gateway Protocol (IGP) physical sub-path between two nodes directly connected by the direct connection virtual sub-path.
5. The method of claim 4, wherein prior to said determining transmission parameter conditions for a path to be planned between a head node and a tail node of a flow, the method further comprises:
acquiring transmission parameters of the direct connection virtual sub-path between any two nodes in the plurality of nodes;
the searching, in at least one virtual path between the head node and the tail node, a target virtual path whose transmission parameters satisfy the transmission parameter condition includes:
determining a transmission parameter of each of the direct connection virtual sub-paths of the at least one virtual path based on a transmission parameter of the direct connection virtual sub-path between any two nodes of the plurality of nodes;
determining a transmission parameter of each virtual path based on a transmission parameter of a directly connected virtual sub-path of each virtual path in the at least one virtual path;
and searching the target virtual path in the at least one virtual path based on the transmission parameters of the at least one virtual path.
6. The method of claim 5, wherein after the obtaining the transmission parameters of the directly connected virtual sub-path between any two of the plurality of nodes, the method further comprises:
establishing a virtual topology of the plurality of nodes based on transmission parameters of the direct connection virtual sub-path between any two of the plurality of nodes, wherein the virtual topology comprises the plurality of nodes, the direct connection virtual sub-path between any two of the plurality of nodes, and the transmission parameters of the direct connection virtual sub-path;
the determining, based on the transmission parameters of the direct connection virtual sub-path between any two nodes in the plurality of nodes, the transmission parameters of each virtual sub-path of the at least one virtual path includes:
determining transmission parameters of each of the directly connected virtual sub-paths of the at least one virtual path based on the virtual topology.
7. The method according to any of claims 1 to 6, wherein the path planning information is further used to indicate: an identification of the target virtual path.
8. The method according to any of claims 1 to 7, wherein the transmission parameters comprise: service level agreement SLA parameters.
9. A path planning apparatus, characterized in that the path planning apparatus comprises:
the system comprises a determining module, a judging module and a planning module, wherein the determining module is used for determining the transmission parameter condition of a path to be planned between a head node and a tail node of a flow;
a searching module, configured to search, in at least one virtual path between the head node and the tail node, a target virtual path whose transmission parameters satisfy the transmission parameter condition, where the transmission parameters of the virtual path are: each node on the virtual path is located on the corresponding physical path;
a sending module, configured to send path planning information to the head node, where the path planning information is used to indicate labels and sequences of nodes in the target virtual path.
10. The path planner according to claim 9, wherein the target virtual path is: and in the at least one virtual path, the virtual path with the least number of nodes in the virtual path with the transmission parameters meeting the transmission parameter conditions.
11. The path planner as claimed in claim 9, wherein the lookup module is configured to:
sequentially detecting whether a virtual path with transmission parameters meeting the transmission parameter conditions exists in the at least one virtual path according to the sequence that the number of nodes on the virtual path is sequentially increased;
when detecting that a virtual path with transmission parameters meeting the transmission parameter conditions exists in the at least one virtual path, determining the virtual path with the transmission parameters meeting the transmission parameter conditions as the target virtual path.
12. The path planner according to any of the claims 9 to 11, wherein the virtual path comprises: at least one directly connected virtual sub-path; the physical path corresponding to the virtual path comprises: at least one physical sub-path;
the at least one directly connected virtual sub-path corresponds to the at least one physical sub-path one to one, and the physical sub-path corresponding to the directly connected virtual sub-path is: and an Interior Gateway Protocol (IGP) physical sub-path between two nodes directly connected by the direct connection virtual sub-path.
13. The path planner according to claim 12, characterized in that the path planner further comprises:
an obtaining module, configured to obtain a transmission parameter of the direct connection virtual sub-path between any two nodes in the multiple nodes;
the lookup module is configured to:
determining a transmission parameter of each of the direct connection virtual sub-paths of the at least one virtual path based on a transmission parameter of the direct connection virtual sub-path between any two nodes of the plurality of nodes;
determining a transmission parameter of each virtual path based on a transmission parameter of a directly connected virtual sub-path of each virtual path in the at least one virtual path;
and searching the target virtual path in the at least one virtual path based on the transmission parameters of the at least one virtual path.
14. The path planner according to claim 13, characterized in that the path planner further comprises:
an establishing module, configured to establish a virtual topology of the plurality of nodes based on transmission parameters of the direct connection virtual sub-path between any two nodes of the plurality of nodes, where the virtual topology includes the plurality of nodes, the direct connection virtual sub-path between any two nodes of the plurality of nodes, and the transmission parameters of the direct connection virtual sub-path;
the lookup module is configured to:
determining transmission parameters of each of the directly connected virtual sub-paths of the at least one virtual path based on the virtual topology.
15. The path planner according to any of the claims 9 to 14, wherein the path planner information is further adapted to indicate: an identification of the target virtual path.
16. The path planner according to any of the claims 9 to 15, characterized in that the transmission parameters comprise: service level agreement SLA parameters.
17. A path planning apparatus, characterized in that the path planning apparatus comprises: a processor and a memory, the memory having stored therein a program, the processor being configured to execute the program stored in the memory to implement the path planning method of any of claims 1 to 8.
18. A computer storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the path planning method according to any one of claims 1 to 8.
19. A data transmission system, characterized in that the data transmission system comprises: a controller comprising a path planner according to any of claims 9 to 16 or a plurality of nodes, or a controller comprising a path planner according to claim 17.
Priority Applications (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911119744.4A CN112822105A (en) | 2019-11-15 | 2019-11-15 | Path planning method and device and data transmission system |
| PCT/CN2020/118226 WO2021093477A1 (en) | 2019-11-15 | 2020-09-28 | Path planning method and device, and data transmission system |
| EP20888015.3A EP4047887A4 (en) | 2019-11-15 | 2020-09-28 | Path planning method and device, and data transmission system |
| US17/741,106 US20220272030A1 (en) | 2019-11-15 | 2022-05-10 | Path planning method and apparatus, and data transmission system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911119744.4A CN112822105A (en) | 2019-11-15 | 2019-11-15 | Path planning method and device and data transmission system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112822105A true CN112822105A (en) | 2021-05-18 |
Family
ID=75851851
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911119744.4A Pending CN112822105A (en) | 2019-11-15 | 2019-11-15 | Path planning method and device and data transmission system |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US20220272030A1 (en) |
| EP (1) | EP4047887A4 (en) |
| CN (1) | CN112822105A (en) |
| WO (1) | WO2021093477A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114760482A (en) * | 2022-03-30 | 2022-07-15 | 上海哔哩哔哩科技有限公司 | Live broadcast source returning method and device |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| MX363870B (en) * | 2014-03-24 | 2019-04-05 | Ericsson Telefon Ab L M | A method to provide elasticity in transport network virtualisation. |
| US10757012B2 (en) * | 2014-12-23 | 2020-08-25 | Telefonaktiebolaget Lm Ericsson (Publ) | Path computation in a segment routing network |
| CN106982238B (en) * | 2016-01-18 | 2020-07-28 | 华为技术有限公司 | Method for distributing network path resources, policy control center and host |
| US10212088B2 (en) * | 2016-11-07 | 2019-02-19 | Cisco Technology, Inc. | Tactical traffic engineering based on segment routing policies |
| EP3503482B1 (en) * | 2017-12-19 | 2020-10-07 | Juniper Networks, Inc. | Systems and methods for facilitating transparent service mapping across multiple network transport options |
-
2019
- 2019-11-15 CN CN201911119744.4A patent/CN112822105A/en active Pending
-
2020
- 2020-09-28 WO PCT/CN2020/118226 patent/WO2021093477A1/en unknown
- 2020-09-28 EP EP20888015.3A patent/EP4047887A4/en active Pending
-
2022
- 2022-05-10 US US17/741,106 patent/US20220272030A1/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114760482A (en) * | 2022-03-30 | 2022-07-15 | 上海哔哩哔哩科技有限公司 | Live broadcast source returning method and device |
| CN114760482B (en) * | 2022-03-30 | 2024-02-27 | 上海哔哩哔哩科技有限公司 | Live broadcast source returning method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| EP4047887A4 (en) | 2022-12-21 |
| WO2021093477A1 (en) | 2021-05-20 |
| EP4047887A1 (en) | 2022-08-24 |
| US20220272030A1 (en) | 2022-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2911348A1 (en) | Control device discovery in networks having separate control and forwarding devices | |
| CN104065571B (en) | A kind of broadcasting packet processing method, apparatus and system | |
| CN105827439B (en) | The method for realizing wireless device ad hoc network | |
| CN104980355A (en) | Source controllable multicast data transmission method and system thereof under SDN Environment | |
| US7158791B2 (en) | Route updating method for micromobility network | |
| CN103023773A (en) | Method, device and system for forwarding message in multi-topology network | |
| CN105530185A (en) | Overlay routing network, routing method based on overlay routing network, and router | |
| CN104580013A (en) | Network communication method and system capable of realizing fast access point selection | |
| CN110445720B (en) | Routing table updating method and device, aircraft and storage medium | |
| CN111327527B (en) | Flow forwarding method and system, SDN controller and computer readable storage medium | |
| US20220272030A1 (en) | Path planning method and apparatus, and data transmission system | |
| CN111464440A (en) | Communication method and device | |
| CN112714159A (en) | Message forwarding method and device, storage medium and electronic device | |
| CN110536187B (en) | Method for forwarding data and access stratum switching equipment | |
| CN104917677A (en) | Data stream forwarding control method and system | |
| CN111464441A (en) | Communication method and device | |
| CN114079640B (en) | Data processing method, user plane function and device | |
| CN111510394A (en) | Message scheduling method, related equipment and computer storage medium | |
| CN115942411A (en) | Multi-card multi-mode communication system control method and device of power acquisition terminal | |
| CN113810274A (en) | Route processing method and related equipment | |
| CN113395206A (en) | Route determining method, device and network equipment | |
| US20220360521A1 (en) | Tunnel Segmentation Method and Apparatus, and Data Transmission System | |
| CN112751741B (en) | Message transmission method and device | |
| CN109257397A (en) | A kind of processing method and processing device of request message | |
| CN110535675B (en) | Method and device for multicast fast switching |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |