WO2019001260A1 - 一种传输路径的确定方法及节点 - Google Patents

一种传输路径的确定方法及节点 Download PDF

Info

Publication number
WO2019001260A1
WO2019001260A1 PCT/CN2018/090751 CN2018090751W WO2019001260A1 WO 2019001260 A1 WO2019001260 A1 WO 2019001260A1 CN 2018090751 W CN2018090751 W CN 2018090751W WO 2019001260 A1 WO2019001260 A1 WO 2019001260A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
path
candidate
candidate path
source
Prior art date
Application number
PCT/CN2018/090751
Other languages
English (en)
French (fr)
Inventor
胡永健
赫英海
胡志波
Original Assignee
华为技术有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP21156356.4A priority Critical patent/EP3886377A1/en
Priority to EP18823404.1A priority patent/EP3605970B1/en
Priority to JP2019565859A priority patent/JP6946470B2/ja
Publication of WO2019001260A1 publication Critical patent/WO2019001260A1/zh
Priority to US16/710,037 priority patent/US11146480B2/en

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/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/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
    • H04L45/123—Evaluation of link metrics
    • 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/48—Routing tree calculation
    • 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/72—Routing based on the source address
    • 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

Definitions

  • the present application relates to the field of communications, and in particular, to a method and a node for determining a transmission path.
  • the mobile backhaul network is a network between the base station and the base station controller.
  • the network is a network between a Base Transceiver Station (BTS) and a Base Station Controller (BSC), for 3G.
  • the network is a network between a base station (NodeB) and a radio network controller (RNC).
  • NodeB base station
  • RNC radio network controller
  • eNodeB evolved base station
  • the mobile backhaul network includes a segment router (SR), which is mainly used as a private line access gateway for large customers and a multi-protocol label switching virtual private network edge router (MPLS VPN PE). And a multicast service gateway.
  • MPLS VPN PE multi-protocol label switching virtual private network edge router
  • the segment router uses the path labeling mechanism to specify the network path through which the packet passes, forming topology information, that is, each segment router assigns a fixed, 32-bit label, similar to the Layer 3 VPN in MPLS, and then the segment router passes the internal gateway protocol.
  • IGP InteriorGatewayProtocol
  • routing protocols for example, Intermediate System-to-Intermediate System (IS-IS), Open Shortest Path First (OSPF), or Border Gateway Protocol (Border Gateway) Protocol, BGP
  • SR segment routing
  • the strict bidirectional coherence cannot be guaranteed by the SR BE tunnel generated by the IGP diffusion tag. For example, as shown in FIG.
  • the source node A is calculated according to the shortest path algorithm
  • the tunnel from the source node A to the destination node B may be the source node A passing through the intermediate node C to the destination node B
  • the destination node B is calculated according to the shortest path algorithm. It is found that the tunnel from the destination node B to the source node A may be the destination node B passing through the intermediate node D and the intermediate node E to the source node A.
  • the embodiment of the invention provides a method and a node for determining a transmission path, which solves the problem that the transmission paths between nodes are different.
  • the two-way path of the SR tunnel is effectively guaranteed to ensure the bidirectional transmission consistency and improve the transmission characteristics of the system.
  • the embodiment of the present invention adopts the following technical solutions:
  • a first aspect of the embodiments of the present invention provides a method for determining a transmission path, where a first node transmits a packet to a second node by using a transmission path, where the method includes: first, the first node determines a first candidate path group, and the first The candidate path group includes at least one first candidate path, where the source node of the first candidate path is the first node or the second node, and when the source node of the first candidate path is the first node, the destination node of the first candidate path a second node, when the source node of the first candidate path is the second node, the destination node of the first candidate path is the first node; then, the first node is based on all the first candidates included in the first candidate path group
  • the node information of the path selects the first path from the at least one first candidate path according to the preset first rule, and the node information includes an identifier (ID) and an ingress port number (Link) of the node connecting the first candidate path.
  • ID identifie
  • the first node determines that the first path is the transmission path; when the source of the first path When the point of the second node, the first node determining a second path is a transmission path, wherein the second path is a reverse path of the first path.
  • the first node selects a first path from at least one first candidate path between the first node and the second node, and when the source node of the first path is the first node Determining the first path as the transmission path; when the source node of the first path is the second node, determining the reverse path of the first path as the transmission path, so that the first node determines the relationship with the second node The transmission path.
  • the transmission path determined by the determining method of the transmission path provided by the second node according to the embodiment of the present invention is the same as the transmission path determined by the first node,
  • the problem that the transmission path of the source node to the destination node is different from the transmission path of the destination node to the source node is effectively solved.
  • the bidirectional path of the SR tunnel is effectively ensured, the bidirectional transmission consistency is ensured, the transmission characteristics of the system are improved, and the transmission delay of the source node to the destination node is ensured to be the same as the transmission delay of the destination node to the source node, and the transmission time is improved.
  • the efficiency of network operation and maintenance is provided in a scenario in which the node determines the transmission path between the nodes based on the distributed protocol.
  • the transmission path described in the embodiment of the present invention may be an SR tunnel, for example, a Best-Effort (BE) tunnel of the SR, and a method for determining a transmission path is used for the SR network.
  • BE Best-Effort
  • the bidirectional transmission consistency is ensured, and the transmission characteristics of the system are improved, so that the transmission path determined by the second node is the same as the transmission path determined by the first node, and the source node to the destination node are guaranteed.
  • the transmission delay is the same as the transmission delay of the destination node to the source node, and the efficiency of network operation and maintenance is improved.
  • the embodiment of the present invention provides two possible implementation manners for the first node to determine the first candidate path group. With reference to the first aspect, in a possible implementation, the first node determines the first candidate path group, and specifically includes: determining, by the first node, the size of the node ID of the first node and the node ID of the second node.
  • the first node Performing path calculation by using the first node or the second node as a source node to determine a first candidate path group; thus, the first node only needs to perform path calculation by using the first node or the second node as a source node to determine the first candidate path.
  • the group reduces the amount of calculation of the first node, simplifies the algorithm, and determines that the time of the first candidate path group is shorter.
  • the first node performs the path calculation by using the first node and the second node as the source node, respectively, to obtain the first candidate path group and the second candidate path group, according to the size of the node ID of the first node and the node ID of the second node.
  • the first candidate path group is determined, wherein the second candidate path group includes at least one second candidate path, and when the first candidate path has the first node as the source node and the second node as the destination node, the second candidate The path takes the second node as the source node and the first node as the destination node; when the first candidate path uses the second node as the source node and the first node as the destination node, the second candidate path takes the first node as the source node The second node is the destination node. Thereby, the first node can determine the first candidate path group from all paths between the first node and the second node.
  • the preset first rule is: from the first The source node of the candidate path begins to compare the size of the node ID and/or the size of the in/out port number of any two of the first candidate paths in the first candidate path group node by node.
  • the bidirectional transmission consistency is ensured, and the transmission characteristics of the system are improved, so that the transmission path determined by the second node is the same as the transmission path determined by the first node, and the source node to the destination node are guaranteed.
  • the transmission delay is the same as the transmission delay of the destination node to the source node, and the efficiency of network operation and maintenance is improved.
  • the first node determines that the second path is the transmission path.
  • the method further includes: the first node reverses the first path, and determines the second path.
  • each of the first candidate path groups in the first candidate path group The path cost is the same.
  • the first candidate path is a path with the lowest path cost between the first node and the second node.
  • the first candidate path is the path with the lowest path cost among all the paths from the first node to the second node; when the second node is the source node, the first A candidate path is the path with the lowest path cost among all the paths from the second node to the first node.
  • a second aspect of the embodiments of the present invention provides a node for determining a transmission path, where the node is used as a first node, and the first node transmits a packet to the second node by using a transmission path, where the first node includes: a first processing unit, And determining, by the first candidate path group, the first candidate path group includes at least one first candidate path, where the source node of the first candidate path is the first node or the second node, where, when the source node of the first candidate path is the first When the node is a node, the destination node of the first candidate path is the second node, and when the source node of the first candidate path is the second node, the destination node of the first candidate path is the first node, and the second processing unit is configured to The node information of all the first candidate paths included in the first candidate path group is selected from the at least one first candidate path according to a preset first rule, and the node information includes a node ID and a node connection first candidate The in
  • the third processing unit when the source node of the first path is the first node, the third processing unit is specifically configured to determine that the first path is the transmission path; when the source node of the first path is When the second node is described, the third processing unit is specifically configured to determine that the second path is the transmission path, where the second path is a reverse path of the first path.
  • the function modules of the foregoing second aspect may be implemented by hardware, or may be implemented by hardware corresponding software.
  • the hardware or software includes one or more modules corresponding to the functions described above.
  • a transceiver for performing functions of a receiving unit and a transmitting unit, a processor for performing functions of the processing unit, a memory, and a program instruction for the processor to process the indicating method of the embodiment of the present application.
  • the processor, transceiver, and memory are connected by a bus and communicate with each other.
  • the functions of the behavior of the first node in the determining method of the transmission path provided in the first aspect and the various possible implementation manners of the first aspect may be referred to.
  • a third aspect of the embodiments of the present invention provides a node for determining a transmission path, where the node is used as a first node, and the first node may include: at least one processor, a memory, a communication interface, and a communication bus;
  • the at least one processor is connected to the memory and the communication interface through a communication bus, and the memory is configured to store the computer execution instruction.
  • the processor executes the memory storage computer execution instruction to enable the first node to perform the first aspect or the first A method of determining a transmission path as described in any of the possible implementations of the aspect.
  • a fourth aspect of the embodiments of the present invention provides a computer storage medium for storing computer software instructions for use by the first node, the computer software instructions comprising a program designed to perform the determining method of the transmission path.
  • the names of the first node and the second node are not limited to the device itself. In actual implementation, the devices may appear under other names. As long as the functions of the respective devices are similar to the embodiments of the present application, they are within the scope of the claims and their equivalents.
  • FIG. 1 is a schematic diagram of a network topology provided by the prior art
  • FIG. 2 is a schematic diagram of the principle of an IS-IS/OSPF algorithm provided by the prior art
  • FIG. 3 is a schematic diagram of a network topology according to an embodiment of the present disclosure.
  • FIG. 4 is a schematic structural diagram of a node according to an embodiment of the present disclosure.
  • FIG. 5 is a flowchart of a method for determining a transmission path according to an embodiment of the present invention
  • FIG. 6 is a schematic structural diagram of a node according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic structural diagram of another node according to an embodiment of the present invention.
  • the administrator assigns a unique node ID to each node in the network, and the port number and path cost between the two nodes connected to each other.
  • the node identifier may be a router ID (router ID), and the port number may be a neighbor router identifier (Neighbour RID).
  • the identifier may be a system ID, and the port number may be a Label Switching Path (LSP) ID.
  • LSP Label Switching Path
  • FIG. 2 is a schematic diagram of the principle of the IS-IS/OSPF algorithm provided by the prior art.
  • (a) in FIG. 2 is a topology of the network.
  • the node is a router as an example, the router A is connected to the router B and the router C, the router B is connected to the router C, and the router C is connected to the router D.
  • the path cost of Router A and Router B is 1, the path cost of Router A and Router C is 2, the path cost of Router B and Router C is 5, and the path cost of Router C and Router D is 3.
  • Link state diffusion Each node sets its own node ID, link state, and link state according to the Link State Advertisement (LSA) or Link State Protocol (LSP) data unit. The overhead spreads the notification to the neighboring nodes. Each node in the network receives the link state advertisements of other nodes and collects them to generate a Link State Data Base (LSDB). Thus, the link state database of each node in the network is consistent.
  • LSDB Link State Data Base
  • Each node converts the link state database into a weighted directed graph.
  • the directed graph of each node is identical.
  • (c) in Fig. 2 is a weighted directed graph obtained from the link state database.
  • Router A can directly transmit packets to Router B or Router C.
  • Router A can also transmit packets to Router B through the forwarding of Router C.
  • Router A can also forward packets to Router D through the forwarding of Router C.
  • Router B can directly transmit packets to Router A or Router C.
  • Router B can also forward packets to Router A through the forwarding of Router C.
  • Router B can also forward packets to Router D through the forwarding of Router C.
  • Router C can directly transmit packets to Router A or Router B. Router C can also forward packets to Router A through the forwarding of Router B. Router C can also forward packets to Router B through the forwarding of Router A. Router C can also Transmit packets directly to Router D. Router D can directly transmit packets to Router C. Router D can also forward packets to Router B through the forwarding of Router C. Router D can also forward packets to Router A through the forwarding of Router C. Router D can also pass Router C. Forwarding with Router A transmits packets to Router B. Router D can also forward packets to Router A through the forwarding of Router C and Router B.
  • Each node takes itself as the root node in the graph, and uses the service port function (SPF) algorithm or the shortest path algorithm to calculate a shortest path tree.
  • the shortest path tree obtains the node.
  • a routing table to other nodes in the network stores the routing table.
  • (d) in Figure 2 shows the shortest path tree generated by each router as its own root node. Router A takes itself as the root, the path to Router B and Router C, and the path through Router C to Router D; Router B takes itself as the root, between Router A, Router A through Router C, and Router A.
  • router C takes itself as the root, the path to router A and the path from router A to router B, and directly to router D; router D takes itself as the root, to router C, through the router C to Router A, and the path through Router C and Router A to Router B.
  • FIG. 3 is a simplified schematic diagram of a system architecture to which embodiments of the present invention may be applied.
  • the system architecture may include: Node 1, Node 2, Node 3, Node 4, Node 5, Node 6, Base Station 11, and Core Network 12.
  • the base station 11 is connected to the node 1, the node 1 is connected to the node 2, the node 3 and the node 4, the node 4 is connected to the node 5, the node 2, the node 3 and the node 5 are all connected to the node 6, and the node 6 and the core network 12 are connected. Connected.
  • Node 1, Node 2, Node 3, Node 4, Node 5, and Node 6 can be routers or switches. All nodes described in the embodiments of the present invention may be segment routers.
  • the network described in the embodiment of the present invention may be an SR network.
  • FIG. 4 is a schematic structural diagram of a node according to an embodiment of the present invention.
  • the node may include at least one processor 21, a memory 22, a communication interface 23, and a communication bus 24.
  • the processor 21 is a control center of the node, and may be a processor or a collective name of a plurality of processing elements.
  • the processor 21 is a central processing unit (CPU), may be an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present invention.
  • CPU central processing unit
  • ASIC application specific integrated circuit
  • microprocessors Digital Signal Processors, DSPs
  • FPGAs Field Programmable Gate Arrays
  • the processor 21 can perform various functions of the node by running or executing a software program stored in the memory 22 and calling data stored in the memory 22.
  • processor 21 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG.
  • a node may include multiple processors, such as processor 21 and processor 25 shown in FIG.
  • processors can be a single core processor (CPU) or a multi-core processor (multi-CPU).
  • a processor herein may refer to one or more devices, circuits, and/or processing cores for processing data, such as computer program instructions.
  • the memory 22 can be a Read-Only Memory (ROM) or other type of static storage device that can store static information and instructions, a Random Access Memory (RAM) or other type that can store information and instructions.
  • the dynamic storage device can also be an Electrically Erasable Programmable Read-Only Memory (EEPROM), a Compact Disc Read-Only Memory (CD-ROM) or other optical disc storage, and a disc storage device. (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program code in the form of instructions or data structures and can be Any other media accessed, but not limited to this.
  • Memory 22 may be present independently and coupled to processor 21 via communication bus 24. The memory 22 can also be integrated with the processor 21.
  • the memory 22 is used to store a software program that executes the solution of the present invention, and is controlled by the processor 21.
  • the communication interface 23 uses a device such as any transceiver for communicating with other devices or communication networks, such as Ethernet, Radio Access Network (RAN), Wireless Local Area Networks (WLAN), etc. .
  • the communication interface 23 may include a receiving unit that implements a receiving function, and a transmitting unit that implements a transmitting function.
  • the communication bus 24 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus.
  • ISA Industry Standard Architecture
  • PCI Peripheral Component
  • EISA Extended Industry Standard Architecture
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 4, but it does not mean that there is only one bus or one type of bus.
  • the device structure illustrated in FIG. 4 does not constitute a definition of a node, and may include more or less components than those illustrated, or some components may be combined, or different component arrangements.
  • FIG. 5 is a flowchart of a method for determining a transmission path according to an embodiment of the present invention. It is assumed that a first node transmits a packet to a second node by using a transmission path. As shown in FIG. 5, the method may include:
  • the first node determines a first candidate path group.
  • the first candidate path group includes at least one first candidate path, and the source node of the first candidate path is a first node or a second node, where when the source node of the first candidate path is the first node, the first candidate path is The destination node is the second node. When the source node of the first candidate path is the second node, the destination node of the first candidate path is the first node.
  • the first node may determine the first candidate path group by the following two determining methods.
  • the first node determines, according to the size of the node ID of the first node and the size of the node ID of the second node, to perform path calculation by using the first node or the second node as a source node, and determining the first candidate. Path group. Therefore, the first node only needs to perform path calculation with the first node or the second node as the source node, determine the first candidate path group, reduce the calculation amount of the first node, simplify the algorithm, and determine the time of the first candidate path group. Shorter.
  • the first node is node 1 and the second node is node 6.
  • the node 1 determines that the path calculation is performed by using the node 1 or the node 6 as the source node according to the size of the node ID of the node 1 and the size of the node ID of the node 6, and determines the first candidate path group.
  • the node ID of node 1 is 1, the node ID of node 6 is 6, and 1 is less than 6.
  • Node 1 calculates the path of node 1 to node 6 with node 1 as the source node, and determines the first candidate path group.
  • the first candidate path included in a candidate path group is the path from node 1 to node 6.
  • the node ID of the node 1 is 1, the node ID of the node 6 is 6, and 6 is greater than 1.
  • the node 1 calculates the path of the node 6 to the node 1 by using the node 6 as the source node, and determines the first candidate path group.
  • the first candidate path included in a candidate path group is the path of node 6 to node 1.
  • the first node performs path calculation by using the first node and the second node as source nodes, respectively, to obtain a first candidate path group and a second candidate path group, according to the size of the node ID of the first node.
  • the size of the node ID of the second node determines the first candidate path group.
  • the second candidate path group includes at least one second candidate path.
  • the second candidate path uses the second node as the source node to The first node is the destination node; when the first candidate path is the source node and the first node is the destination node, the second candidate path takes the first node as the source node and the second node as the destination node.
  • the first node can determine the first candidate path group from all paths between the first node and the second node.
  • the second determination method is applied to the system shown in FIG. 3, assuming that the first node is node 1 and the second node is node 6.
  • the node 1 first performs path calculation with the node 1 and the node 6 as the source node, and obtains the first candidate path group and the second candidate path group, and then determines according to the size of the node ID of the node 1 and the node ID of the node 6.
  • a first candidate path group where the second candidate path group includes at least one second candidate path.
  • the second candidate path uses the node 6 as the source.
  • the node takes node 1 as the destination node; when the first candidate path uses node 6 as the source node and node 1 as the destination node, the second candidate path takes node 1 as the source node and node 6 as the destination node.
  • the second candidate path uses node 6 as the source node, node 1 as the destination node, and table 1 as the first candidate path, and table 2 is the second.
  • Candidate path uses node 6 as the source node, node 1 as the destination node, and table 1 as the first candidate path, and table 2 is the second.
  • the first determining method for determining the first candidate path group by the first node may be applicable to the case where the first node and the second node of the network are both connected, if the first node and the second node exist after In the case of the single-direction pass, the first node determines that the first candidate path group needs to adopt the second determining method, and performs path calculation on the first node with the first node and the second node as the source node respectively, to obtain the first candidate path group. And after the second candidate path group, each first candidate path in the first candidate path group is reversed, and the node ID and the in/out port number of each of the first candidate paths in the reversed order are compared with the second candidate path group.
  • each second candidate path is compared with the in/out port number, and the path from the first node to the second node in one direction is eliminated, and similarly, each second candidate in the second candidate path group is selected.
  • the path is reversed, and the node ID and the in/out port number of each second candidate path in the reversed order are compared with the node ID and the in/out port number of each first candidate path in the first candidate path group, and the second Point to the path in one direction through the first node.
  • the first candidate path group is further determined according to the size of the node ID of the first node and the size of the node ID of the second node.
  • the first candidate path path with path number 1 in Table 2 is reversed, and the first candidate path after the reverse order is node 1 -> port number 12 -> port number 21 -> node 2 -> port number 26 - >Port number 62->Node 6, which is the first candidate path path with path number 1 in Table 1, then the path with path number 1 in Table 1 and the path with path number 1 in Table 2 are first.
  • the bidirectional path of the node and the second node both pass the path; for the same reason, the path with the path number 2 in Table 1 and the path with the path number 2 in Table 2 are the path of the bidirectional path between the first node and the second node.
  • the first candidate path included in the first candidate path group determined by the first node according to the first determining method and the second determining method is a path with the same cost, optionally, and the least overhead. path.
  • the path calculation method can be the shortest path algorithm.
  • the number of the first candidate paths included in the first candidate path group may also be determined, where the first candidate path group includes a first candidate path, and executed.
  • Step 302 If the first candidate path group includes more than two first candidate paths, step 303 is performed.
  • the first node determines the first candidate path included in the first candidate path group as the first path. Step 304 or step 305 is performed.
  • the first node selects the first path from the at least one first candidate path according to the preset first rule according to the node information of all the first candidate paths included in the first candidate path group. Step 304 or step 305 is performed.
  • the node information includes a node identification ID and an ingress port number and/or an egress port number of the node connecting the first candidate path.
  • the preset first rule is to compare the size of the node ID and/or the size of the in/out port number of any two first candidate paths in the first candidate path group node by node from the source node of the first candidate path.
  • the node IDs of the three paths and the size of the in/out port number are compared node by node from the source nodes of the three paths, and the first is selected from the three paths. path.
  • node 1 selects the first path as the first path, that is, the path from node 1 through node 2 to node 6. If a larger port number is selected, node 1 selects the third path as the first path, that is, the path from node 1 through node 4 and node 5 to node 6.
  • the first node determines that the first path is a transmission path.
  • the first node determines that the second path is the transmission path.
  • the second path is a reverse path of the first path.
  • the first node reverses the first path and determines the second path.
  • the path with the path number 1 in Table 1 and the path with the path number 1 in Table 2 are taken as an example.
  • the first path is the path with path number 1 in Table 2, that is, node 6->port number 62->port No. 26->Node 2>>Port No. 21->Port No. 12->Node 1
  • the second path is the path with path number 1 in Table 1, ie node 1->port number 12->port number 21-> Node 2 -> Port No. 26 -> Port No. 62 -> Node 6, node 1 reverses the path with path number 1 in Table 2, and obtains the path with path number 1 in Table 1.
  • the first node selects a first path from at least one first candidate path between the first node and the second node, and when the source node of the first path is the first node Determining the first path as the transmission path; when the source node of the first path is the second node, determining the reverse path of the first path as the transmission path, so that the first node determines the relationship with the second node The transmission path.
  • the transmission path determined by the determining method of the transmission path provided by the second node according to the embodiment of the present invention is the same as the transmission path determined by the first node.
  • the problem that the transmission path of the source node to the destination node is different from the transmission path of the destination node to the source node is effectively solved.
  • the bidirectional path of the SR tunnel is effectively guaranteed to ensure the bidirectional transmission consistency, and the transmission characteristics of the system are improved, so that the transmission delay of the source node to the destination node is the same as the transmission delay of the destination node to the source node, and the transmission time is improved.
  • the efficiency of network operation and maintenance is provided in a scenario in which the node determines the transmission path between the nodes based on the distributed protocol.
  • each network element such as a node
  • each network element includes hardware structures and/or software modules corresponding to each function.
  • the present invention can be implemented in a combination of hardware or hardware and computer software in combination with the algorithm steps of the various examples described in the embodiments disclosed herein. Whether a function is implemented in hardware or computer software to drive hardware depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods for implementing the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present invention.
  • the embodiment of the present invention may divide a function module into nodes according to the foregoing method example.
  • each function module may be divided into corresponding functions, or two or more functions may be integrated into one processing module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of the module in the embodiment of the present invention is schematic, and is only a logical function division, and the actual implementation may have another division manner.
  • FIG. 6 is a schematic diagram showing a possible composition of the nodes involved in the foregoing and the embodiments.
  • the node may include: a first processing unit 41.
  • the first processing unit 41 is configured to support step 301 in the determining method of the node for performing the transmission path shown in FIG. 5.
  • the second processing unit 42 is configured to support step 303 in the determining method of the node for performing the transmission path shown in FIG. 5.
  • the third processing unit 43 is configured to support steps 304 and 305 in the determining method of the node for performing the transmission path shown in FIG. 5.
  • the node may further include a fourth processing unit 44.
  • the fourth processing unit 44 is configured to support step 302 in the determining method of the transmission path shown in FIG. 5.
  • the node provided by the embodiment of the present invention is configured to perform the foregoing method for determining a transmission path, so that the same effect as the determination method of the foregoing transmission path can be achieved.
  • Fig. 7 shows another possible compositional diagram of the nodes involved in the above embodiment.
  • the node includes a processing module 51 and a communication module 52.
  • the processing module 51 is configured to perform control management on the action of the node.
  • the processing module 51 is configured to support the node to perform step 301 to step 305 in FIG. 5 .
  • Communication module 52 is used to support communication of nodes with other network entities.
  • the node may also include a storage module 53 for storing program code and data of the node.
  • the processing module 51 can be a processor or a controller. It is possible to implement or carry out the various illustrative logical blocks, modules and circuits described in connection with the present disclosure.
  • the processor can also be a combination of computing functions, for example, including one or more microprocessor combinations, a combination of a DSP and a microprocessor, and the like.
  • the communication module 52 can be a transceiver, a transceiver circuit, a communication interface, or the like.
  • the storage module 53 can be a memory.
  • the processing module 51 is a processor
  • the communication module 52 is a communication interface
  • the storage module 53 is a memory
  • the node involved in the embodiment of the present invention may be the node shown in FIG.
  • the disclosed apparatus and method may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the modules or units is only a logical function division.
  • there may be another division manner for example, multiple units or components may be used.
  • the combination may be integrated into another device, or some features may be ignored or not performed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may be one physical unit or multiple physical units, that is, may be located in one place, or may be distributed to multiple different places. . Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
  • the integrated unit if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a readable storage medium.
  • the technical solution of the embodiments of the present invention may contribute to the prior art or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium.
  • a number of instructions are included to cause a device (which may be a microcontroller, chip, etc.) or a processor to perform all or part of the steps of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. .

Abstract

本申请实施例公开了一种传输路径的确定方法及节点，涉及通信领域，解决了源节点到目的节点的传输路径与目的节点到源节点的传输路径不同的问题。具体方案为：第一节点确定第一候选路径组；在第一候选路径组包括两条以上第一候选路径的情况下，根据第一候选路径组中所包括的所有第一候选路径的节点信息，按照预设的第一规则，从至少一条第一候选路径内选择第一路径；当第一路径的源节点为第一节点时，确定第一路径为传输路径；当第一路径的源节点为第二节点时，确定第二路径为传输路径，其中，第二路径为第一路径的反向路径。

Description

一种传输路径的确定方法及节点
本申请要求于2017年06月29日提交中国专利局、申请号为201710514625.3、申请名称为“一种传输路径的确定方法及节点”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域，尤其涉及一种传输路径的确定方法及节点。
背景技术
移动回传网络是基站到基站控制器之间的网络，比如，对于2G网络，就是基站收发台(Base Transceiver Station，BTS)到基站控制器(Base Station Controller，BSC)之间的网络，对于3G网络，就是基站(NodeB)到无线网络控制器(Radio Network Controller，RNC)之间的网络，对于4G网络，就是演进型基站(eNodeB)到核心网之间的网络。移动回传网络包括段路由器(Segment Router，SR)，主要作为针对大客户的专线接入网关、多协议标签交换虚拟专用网络边缘路由器(Multi-Protocol Label Switching Virtual Private Network edge router，MPLS VPN PE)以及组播业务网关。段路由器使用路径标签机制来指定报文通过的网络路径，形成拓扑信息，即每个段路由器分配固定的、32位的标签，类似于在MPLS的3层VPN，然后，段路由器通过内部网关协议(InteriorGatewayProtocol，IGP)，例如路由协议(例如，中间系统到中间系统(Intermediate System-to-Intermediate System，IS-IS)、开放最短路径优先(Open Shortest Path First，OSPF)或边界网关协议(Border Gateway Protocol，BGP))，并基于最短路径算法将标签和拓扑信息延伸传播至整个网络中，生成段路由(Segment Routing，SR)隧道。但是，通过IGP扩散标签生成的SR BE隧道，无法保证严格的双向同径。示例的，如图1所示，源节点A根据最短路径算法计算得到，源节点A至目的节点B的隧道可以是源节点A经过中间节点C到目的节点B，目的节点B根据最短路径算法计算得到，目的节点B到源节点A的隧道可以是目的节点B经过中间节点D和中间节点E到源节点A。然而，为了保证两个节点之间双向传输一致性，需要使两个节点之间保持双向路径同径。因此，如何保证两个节点之间双向同径是一个亟待解决问题。
发明内容
本发明实施例提供一种传输路径的确定方法及节点，解决了节点之间的传输路径不同的问题。有效保证了SR隧道双向路径同径，保证了双向传输一致性，提高了系统的传输特性。
为达到上述目的，本发明实施例采用如下技术方案：
本发明实施例的第一方面，提供一种传输路径的确定方法，第一节点通过传输路径向第二节点传输报文，该方法包括：首先，第一节点确定第一候选路径组，第一候选路径组包括至少一条第一候选路径，第一候选路径的源节点为第一节点或第二节点， 其中，当第一候选路径的源节点为第一节点时，第一候选路径的目的节点为第二节点，当第一候选路径的源节点为第二节点时，第一候选路径的目的节点为第一节点；然后，第一节点根据第一候选路径组中所包括的所有第一候选路径的节点信息，按照预设的第一规则，从至少一条第一候选路径内选择第一路径，节点信息包括节点标识(Identification，ID)以及节点连接第一候选路径的入端口号(Link)和/或出端口号；最后，当第一路径的源节点为第一节点时，第一节点确定第一路径为传输路径；当第一路径的源节点为第二节点时，第一节点确定第二路径为传输路径，其中，第二路径为第一路径的反向路径。本发明实施例提供的传输路径的确定方法，第一节点从第一节点与第二节点之间的至少一条第一候选路径中选择出第一路径，当第一路径的源节点为第一节点时，将第一路径确定为传输路径；当第一路径的源节点为第二节点时，将第一路径的反向路径确定为传输路径，从而，第一节点确定出了与第二节点间的传输路径。那么，在节点基于分布式协议确定节点间的传输路径的场景下，使得第二节点根据本发明实施例提供的传输路径的确定方法确定出的传输路径与第一节点确定出的传输路径相同，有效地解决了源节点到目的节点的传输路径与目的节点到源节点的传输路径不同的问题。有效地保证了SR隧道双向路径同径，保证了双向传输一致性，提高了系统的传输特性，保证了源节点至目的节点的传输时延与目的节点至源节点的传输时延相同，提高了网络运行维护的效率。
需要说明的是，本发明实施例所述的传输路径可以是SR隧道，例如SR最好的工作(Best-Effort，BE)隧道，传输路径的确定方法用于SR网络。
为了有效地保证SR隧道双向路径同径，保证双向传输一致性，提高系统的传输特性，使第二节点确定出的传输路径与第一节点确定出的传输路径相同，保证源节点至目的节点的传输时延与目的节点至源节点的传输时延相同，提高网络运行维护的效率，本发明实施例提供第一节点确定第一候选路径组的两种可能的实现方式。结合第一方面，在一种可能的实现方式中，第一节点确定第一候选路径组，具体包括：第一节点根据第一节点的节点ID的大小和第二节点的节点ID的大小，确定以第一节点或者第二节点为源节点进行路径计算，确定第一候选路径组；从而，第一节点只需要以第一节点或者第二节点为源节点进行路径计算，来确定第一候选路径组，减少第一节点的计算量，简化算法，且确定第一候选路径组的用时较短。或者，第一节点分别以第一节点和第二节点为源节点进行路径计算，得到第一候选路径组和第二候选路径组，根据第一节点的节点ID的大小和第二节点的节点ID的大小，确定第一候选路径组，其中，第二候选路径组包括至少一条第二候选路径，当第一候选路径以第一节点为源节点，以第二节点为目的节点时，第二候选路径以第二节点为源节点，以第一节点为目的节点；当第一候选路径以第二节点为源节点，以第一节点为目的节点时，第二候选路径以第一节点为源节点，以第二节点为目的节点。从而，第一节点能够从第一节点和第二节点之间的所有路径中确定第一候选路径组。
为了有效地保证SR隧道双向路径同径，保证双向传输一致性，提高系统的传输特性，使第二节点确定出的传输路径与第一节点确定出的传输路径相同，保证源节点至目的节点的传输时延与目的节点至源节点的传输时延相同，提高网络运行维护的效率，结合上述可能的实现方式，在另一种可能的实现方式中，预设的第一规则是：从 第一候选路径的源节点开始逐节点比较第一候选路径组中任意两个第一候选路径的节点ID的大小和/或出/入端口号的大小。
为了有效地保证SR隧道双向路径同径，保证双向传输一致性，提高系统的传输特性，使第二节点确定出的传输路径与第一节点确定出的传输路径相同，保证源节点至目的节点的传输时延与目的节点至源节点的传输时延相同，提高网络运行维护的效率，结合上述可能的实现方式，在另一种可能的实现方式中，第一节点确定第二路径为传输路径之前，方法还包括：第一节点倒序第一路径，确定第二路径。
为了有效地保证SR隧道双向路径同径，保证双向传输一致性，提高系统的传输特性，使第二节点确定出的传输路径与第一节点确定出的传输路径相同，保证源节点至目的节点的传输时延与目的节点至源节点的传输时延相同，提高网络运行维护的效率，结合第一方面，在另一种可能的实现方式中，第一候选路径组中每条第一候选路径的路径开销(cost)相同。可选的，第一候选路径为第一节点与第二节点之间路径开销最低的路径。即当第一节点是源节点时，该第一候选路径位所述第一节点至所述第二节点的所有路径中路径开销最低的路径；当该第二节点是源节点时，该，第一候选路径为第二节点至第一节点的所有路径中路径开销最低的路径。
本发明实施例的第二方面，提供一种确定传输路径的节点，该节点用作第一节点，第一节点通过传输路径向第二节点传输报文，第一节点包括：第一处理单元，用于确定第一候选路径组，第一候选路径组包括至少一条第一候选路径，第一候选路径的源节点为第一节点或第二节点，其中，当第一候选路径的源节点为第一节点时，第一候选路径的目的节点为第二节点，当第一候选路径的源节点为第二节点时，第一候选路径的目的节点为第一节点；第二处理单元，用于根据第一候选路径组中所包括的所有第一候选路径的节点信息，按照预设的第一规则，从至少一条第一候选路径内选择第一路径，节点信息包括节点ID以及节点连接第一候选路径的入端口号和/或出端口号；当第一路径的源节点为第一节点时，第三处理单元，用于根据所述第一路径确定所述传输路径。其中，当所述第一路径的源节点为所述第一节点时，第三处理单元，具体用于确定所述第一路径为所述传输路径；当所述第一路径的源节点为所述第二节点时，所述第三处理单元，具体用于确定第二路径为所述传输路径，其中，所述第二路径为所述第一路径的反向路径。
需要说明的是，上述第二方面的功能模块可以通过硬件实现，也可以通过硬件执行相应的软件实现。硬件或软件包括一个或多个与上述功能相对应的模块。例如，收发器，用于完成接收单元和发送单元的功能，处理器，用于完成处理单元的功能，存储器，用于处理器处理本申请实施例的指示方法的程序指令。处理器、收发器和存储器通过总线连接并完成相互间的通信。具体的，可以参考第一方面以及第一方面各种可能的实现方式中提供的传输路径的确定方法中第一节点的行为的功能。
本发明实施例的第三方面，提供一种确定传输路径的节点，该节点用作第一节点，该第一节点可以包括：至少一个处理器，存储器、通信接口、通信总线；
至少一个处理器与存储器、通信接口通过通信总线连接，存储器用于存储计算机执行指令，当第一节点运行时，处理器执行存储器存储的计算机执行指令，以使第一节点执行第一方面或第一方面的可能的实现方式中任一所述的传输路径的确定方法。
本发明实施例的第四方面，提供一种计算机存储介质，用于存储上述第一节点所用的计算机软件指令，该计算机软件指令包含用于执行上述传输路径的确定方法所设计的程序。
另外，第二方面至第四方面中任一种设计方式所带来的技术效果可参见第一方面中不同设计方式所带来的技术效果，此处不再赘述。
本申请实施例中，第一节点和第二节点的名字对设备本身不构成限定，在实际实现中，这些设备可以以其他名称出现。只要各个设备的功能和本申请实施例类似，属于本申请权利要求及其等同技术的范围之内。
本申请实施例的这些方面或其他方面在以下实施例的描述中会更加简明易懂。
附图说明
图1为现有技术提供的一种网络拓扑示意图；
图2为现有技术提供的IS-IS/OSPF算法原理示意图；
图3为本发明实施例提供的一种网络拓扑示意图；
图4为本发明实施例提供的一种节点的组成示意图；
图5为本发明实施例提供的一种传输路径的确定方法的流程图；
图6为本发明实施例提供的节点结构示意图；
图7为本发明实施例提供的另一节点结构示意图。
具体实施方式
为了下述各实施例的描述清楚简洁，首先给出相关技术的简要介绍：
IS-IS/OSPF算法原理如下：
1、抽象网络拓扑：管理员为网络中每个节点分配唯一节点ID，以及相互连接的两个节点之间的端口号和路径开销。示例的，对于OSPF算法而言，节点标识可以是路由器标识(Router ID)，端口号可以是邻居路由器标识(Neighbour RID)。对于IS-IS算法而言，标识可以是系统(System)ID，端口号可以是标记交换路径(Label Switching Path，LSP)ID。
图2为现有技术提供的IS-IS/OSPF算法原理示意图。图2中的(a)为网络的拓扑结构，以节点为路由器为例，路由器A分别与路由器B和路由器C连接，路由器B与路由器C连接，路由器C与路由器D连接。路由器A与路由器B的路径开销为1，路由器A与路由器C的路径开销为2，路由器B与路由器C的路径开销为5，路由器C与路由器D的路径开销为3。
2、链路状态扩散：每个节点根据链路状态广播(Link State Advertisement，LSA)或链路状态协议(Link state Protocol，LSP)数据单元(Data Unit)将自己的节点ID、链路状态、开销向相邻节点扩散通告，网络中每个节点都收到了其它节点的链路状态通告，收集放在一起生成链路状态数据库(Link State DataBase，LSDB)。从而，网络中每个节点的链路状态数据库一致。图2中的(b)为每台路由器生成的链路状态数据库。
3、提取带权有向图：每个节点将链路状态数据库转换成带权有向图。从而，每个节点的有向图完全相同。图2中的(c)为根据链路状态数据库得到的带权有向图。路由器A可以直接向路由器B或路由器C传输报文，路由器A也可以通过路由器C的转 发向路由器B传输报文，路由器A还可以通过路由器C的转发向路由器D传输报文。路由器B可以直接向路由器A或路由器C传输报文，路由器B也可以通过路由器C的转发向路由器A传输报文，路由器B还可以通过路由器C的转发向路由器D传输报文。路由器C可以直接向路由器A或路由器B传输报文，路由器C也可以通过路由器B的转发向路由器A传输报文，路由器C也可以通过路由器A的转发向路由器B传输报文，路由器C还可以直接向路由器D传输报文。路由器D可以直接向路由器C传输报文，路由器D也可以通过路由器C的转发向路由器B传输报文，路由器D还可以通过路由器C的转发向路由器A传输报文,路由器D还可以通过路由器C和路由器A的转发向路由器B传输报文，路由器D还可以通过路由器C和路由器B的转发向路由器A传输报文。
4、计算最小生成树：每个节点在图中以自己为根节点，使用服务器端口功能(Service port function，SPF)算法或最短路径算法计算出一棵最短路径树，由最短路径树得到本节点到网络中其他节点的路由表，存储路由表。图2中的(d)为每台路由器分别以自己为根节点生成的最短路径树。路由器A以自己为根，到路由器B的路径和路由器C，以及经过路由器C到路由器D的路径；路由器B以自己为根，之间到路由器A、经过路由器A到路由器C，以及经过路由器A和路由器C到路由器D的路径；路由器C以自己为根，到路由器A的路径和经过路由器A到路由器B，以及直接到路由器D的路径；路由器D以自己为根，到路由器C、经过路由器C到路由器A，以及经过路由器C和路由器A到路由器B的路径。
下面将结合附图对本发明实施例的实施方式进行详细描述。
图3示出的是可以应用本发明实施例的系统架构的简化示意图。如图3所示，该系统架构可以包括：节点1、节点2、节点3、节点4、节点5、节点6、基站11、核心网12。
其中，基站11与节点1相连，节点1分别与节点2、节点3和节点4相连，节点4与节点5相连，节点2、节点3和节点5都与节点6相连，节点6与核心网12相连。
示例的，节点1、节点2、节点3、节点4、节点5和节点6可以是路由器或交换机。在本发明实施例中所述的所有节点可以是段路由器。本发明实施例中所述的网络可以是SR网络。
图4为本发明实施例提供的一种节点的组成示意图，如图4所示，节点可以包括至少一个处理器21，存储器22、通信接口23、通信总线24。
下面结合图4对节点的各个构成部件进行具体的介绍：
处理器21是节点的控制中心，可以是一个处理器，也可以是多个处理元件的统称。例如，处理器21是一个中央处理器(Central Processing Unit，CPU)，也可以是特定集成电路(Application Specific Integrated Circuit，ASIC)，或者是被配置成实施本发明实施例的一个或多个集成电路，例如：一个或多个微处理器(Digital Signal Processor，DSP)，或，一个或者多个现场可编程门阵列(Field Programmable Gate Array，FPGA)。
其中，处理器21可以通过运行或执行存储在存储器22内的软件程序，以及调用存储在存储器22内的数据，执行节点的各种功能。
在具体的实现中，作为一种实施例，处理器21可以包括一个或多个CPU，例如 图4中所示的CPU0和CPU1。
在具体实现中，作为一种实施例，节点可以包括多个处理器，例如图4中所示的处理器21和处理器25。这些处理器中的每一个可以是一个单核处理器(single-CPU)，也可以是一个多核处理器(multi-CPU)。这里的处理器可以指一个或多个设备、电路、和/或用于处理数据(例如计算机程序指令)的处理核。
存储器22可以是只读存储器(Read-Only Memory，ROM)或可存储静态信息和指令的其他类型的静态存储设备，随机存取存储器(Random Access Memory，RAM)或者可存储信息和指令的其他类型的动态存储设备，也可以是电可擦可编程只读存储器(Electrically Erasable Programmable Read-Only Memory，EEPROM)、只读光盘(Compact Disc Read-Only Memory，CD-ROM)或其他光盘存储、光碟存储(包括压缩光碟、激光碟、光碟、数字通用光碟、蓝光光碟等)、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。存储器22可以是独立存在，通过通信总线24与处理器21相连接。存储器22也可以和处理器21集成在一起。
其中，所述存储器22用于存储执行本发明方案的软件程序，并由处理器21来控制执行。
通信接口23，使用任何收发器一类的装置，用于与其他设备或通信网络通信，如以太网，无线接入网(Radio Access Network，RAN)，无线局域网(Wireless Local Area Networks，WLAN)等。通信接口23可以包括接收单元实现接收功能，以及发送单元实现发送功能。
通信总线24，可以是工业标准体系结构(Industry Standard Architecture，ISA)总线、外部设备互连(Peripheral Component，PCI)总线或扩展工业标准体系结构(Extended Industry Standard Architecture，EISA)总线等。该总线可以分为地址总线、数据总线、控制总线等。为便于表示，图4中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
图4中示出的设备结构并不构成对节点的限定，可以包括比图示更多或更少的部件，或者组合某些部件，或者不同的部件布置。
图5为本发明实施例提供的一种传输路径的确定方法的流程图，假设第一节点通过传输路径向第二节点传输报文，如图5所示，该方法可以包括：
301、第一节点确定第一候选路径组。
第一候选路径组包括至少一条第一候选路径，第一候选路径的源节点为第一节点或第二节点，其中，当第一候选路径的源节点为第一节点时，第一候选路径的目的节点为第二节点，当第一候选路径的源节点为第二节点时，第一候选路径的目的节点为第一节点。
示例的，第一节点可以通过以下两种确定方法来确定第一候选路径组。
在第一种确定方法中，第一节点根据第一节点的节点ID的大小和第二节点的节点ID的大小，确定以第一节点或者第二节点为源节点进行路径计算，确定第一候选路径组。从而，第一节点只需要以第一节点或者第二节点为源节点进行路径计算，来确定第一候选路径组，减少第一节点的计算量，简化算法，且确定第一候选路径组的用时 较短。
将该第一种确定方法应用于图3所示的系统，假设第一节点为节点1，第二节点为节点6。节点1根据节点1的节点ID的大小和节点6的节点ID的大小，确定以节点1或者节点6为源节点进行路径计算，确定第一候选路径组。例如，节点1的节点ID为1，节点6的节点ID为6，1小于6，节点1以节点1为源节点计算节点1到节点6的路径，确定第一候选路径组，此时，第一候选路径组包括的第一候选路径都是节点1到节点6的路径。或者，节点1的节点ID为1，节点6的节点ID为6，6大于1，节点1以节点6为源节点计算节点6到节点1的路径，确定第一候选路径组，此时，第一候选路径组包括的第一候选路径都是节点6到节点1的路径。
在第二种确定方法中，第一节点分别以第一节点和第二节点为源节点进行路径计算，得到第一候选路径组和第二候选路径组，根据第一节点的节点ID的大小和第二节点的节点ID的大小，确定第一候选路径组。其中，第二候选路径组包括至少一条第二候选路径，当第一候选路径以第一节点为源节点，以第二节点为目的节点时，第二候选路径以第二节点为源节点，以第一节点为目的节点；当第一候选路径以第二节点为源节点，以第一节点为目的节点时，第二候选路径以第一节点为源节点，以第二节点为目的节点。从而，第一节点能够从第一节点和第二节点之间的所有路径中确定第一候选路径组。
将该第二种确定方法应用于图3所示的系统，假设第一节点为节点1，第二节点为节点6。节点1先分别以节点1和节点6为源节点进行路径计算，得到第一候选路径组和第二候选路径组，然后，根据节点1的节点ID的大小和节点6的节点ID的大小，确定第一候选路径组，其中，第二候选路径组包括至少一条第二候选路径，当第一候选路径以节点1为源节点，以节点6为目的节点时，第二候选路径以节点6为源节点，以节点1为目的节点；当第一候选路径以节点6为源节点，以节点1为目的节点时，第二候选路径以节点1为源节点，以节点6为目的节点。
假设第一候选路径以节点1为源节点，以节点6为目的节点，第二候选路径以节点6为源节点，以节点1为目的节点，表1为第一候选路径，表2为第二候选路径。
表1 第一候选路径
Figure PCTCN2018090751-appb-000001
表2 第二候选路径
Figure PCTCN2018090751-appb-000002
需要说明的是，第一节点确定第一候选路径组的第一种确定方法可以是适用于网第一节点与第二节点双向路径都通的情况下，如果第一节点与第二节点之后存在单方向通的情况下，第一节点确定第一候选路径组需要采用第二种确定方法，在第一节点分别以第一节点和第二节点为源节点进行路径计算，得到第一候选路径组和第二候选路径组后，将第一候选路径组中的每条第一候选路径倒序，将倒序后的每条第一候选路径的节点ID和出/入端口号与第二候选路径组中的每条第二候选路径的节点ID和出/入端口号进行比较，剔除从第一节点到第二节点单方向通的路径，同理，将第二候选路径组中的每条第二候选路径倒序，将倒序后的每条第二候选路径的节点ID和出/入端口号与第一候选路径组中的每条第一候选路径的节点ID和出/入端口号进行比较，剔除从第二节点到第一节点单方向通的路径。再根据第一节点的节点ID的大小和第二节点的节点ID的大小，确定第一候选路径组。例如，将表2中的路径序号为1的第一候选路径路径进行倒序，倒序后的第一候选路径为节点1->端口号12->端口号21->节点2->端口号26->端口号62->节点6，即表1中路径序号为1的第一候选路径路径，那么，表1中的路径序号为1的路径和表2中的路径序号为1的路径是第一节点与第二节点双向路径都通路径；同理，表1中的路径序号为2的路径和表2中的路径序号为2的路径是第一节点与第二节点双向路径都通路径。假设表1中只有路径需要为1和2的两条路径，没有路径需要为3的路径，那么，将表2中的路径序号为3的第一候选路径路径进行倒序，倒序后的第一候选路径在表1中未查询到，从而，就将表2中的路径序号为3剔除。
需要说明的是，第一节点根据第一种确定方法和第二种确定方法确定出的第一候选路径组包括的第一候选路径都是开销相同的路径，可选的，且是开销最小的路径。路径计算的方法可以是最短路径算法。
进一步的，在第一节点确定第一候选路径组之后，还可以判断第一候选路径组包括的第一候选路径的个数，在第一候选路径组包括一条第一候选路径的情况下，执行步骤302；在第一候选路径组包括两条以上第一候选路径的情况下，执行步骤303。
302、第一节点将第一候选路径组包括的该一条第一候选路径确定为第一路径。执行步骤304或步骤305。
303、第一节点根据第一候选路径组中所包括的所有第一候选路径的节点信息，按 照预设的第一规则，从至少一条第一候选路径内选择第一路径。执行步骤304或步骤305。
节点信息包括节点标识ID以及节点连接第一候选路径的入端口号和/或出端口号。预设的第一规则是从第一候选路径的源节点开始逐节点比较第一候选路径组中任意两个第一候选路径的节点ID的大小和/或出/入端口号的大小。
以表1中的三条路径为例，根据三条路径的节点信息，从三条路径的源节点开始逐节点比较三条路径的节点ID的大小和出/入端口号的大小，从三条路径内选择第一路径。先比较三条路径的源节点的节点ID的大小，由于三条路径的源节点都是节点1，节点ID相同都为1，那么按照逐节点比较的规则，再比较三条路径的节点1的出端口号，假设选择较小的端口号，由于Link13小于Link14，Link12小于Link13，则节点1选择第一条路径为第一路径，即从节点1经过节点2到节点6的路径。如果选择较大的端口号，则节点1选择第三条路径为第一路径，即从节点1经过节点4和节点5到节点6的路径。
304、当第一路径的源节点为第一节点时，第一节点确定第一路径为传输路径。
305、当第一路径的源节点为第二节点时，第一节点确定第二路径为传输路径。
其中，第二路径为第一路径的反向路径。第一节点倒序第一路径，确定第二路径。以表1中路径序号为1的路径和表2中路径序号为1的路径为例说明，假设第一路径为表2中路径序号为1的路径，即节点6->端口号62->端口号26->节点2->端口号21->端口号12->节点1，第二路径为表1中路径序号为1的路径，即节点1->端口号12->端口号21->节点2->端口号26->端口号62->节点6，节点1将表2中路径序号为1的路径倒序，得到表1中路径序号为1的路径。
本发明实施例提供的传输路径的确定方法，第一节点从第一节点与第二节点之间的至少一条第一候选路径中选择出第一路径，当第一路径的源节点为第一节点时，将第一路径确定为传输路径；当第一路径的源节点为第二节点时，将第一路径的反向路径确定为传输路径，从而，第一节点确定出了与第二节点间的传输路径。那么，在节点基于分布式协议确定节点间的传输路径的场景下，使得第二节点根据本发明实施例提供的传输路径的确定方法确定出的传输路径与第一节点确定出的传输路径相同，有效地解决了源节点到目的节点的传输路径与目的节点到源节点的传输路径不同的问题。有效地保证了SR隧道双向路径同径，保证了双向传输一致性，提高了系统的传输特性，这样保证了源节点至目标节点的传输时延与目的节点至源节点的传输时延相同，提高了网络运行维护的效率。
上述主要从各个网元之间交互的角度对本发明实施例提供的方案进行了介绍。可以理解的是，各个网元，例如节点为了实现上述功能，其包含了执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该很容易意识到，结合本文中所公开的实施例描述的各示例的算法步骤，本发明能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本发明的范围。
本发明实施例可以根据上述方法示例对节点进行功能模块的划分，例如，可以对 应各个功能划分各个功能模块，也可以将两个或两个以上的功能集成在一个处理模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。需要说明的是，本发明实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。
在采用对应各个功能划分各个功能模块的情况下，图6示出了上述和实施例中涉及的节点的一种可能的组成示意图，如图6所示，该节点可以包括：第一处理单元41、第二处理单元42、第三处理单元43。
其中，第一处理单元41，用于支持节点执行图5所示的传输路径的确定方法中的步骤301。
第二处理单元42，用于支持节点执行图5所示的传输路径的确定方法中的步骤303。
第三处理单元43，用于支持节点执行图5所示的传输路径的确定方法中的步骤304和305。
在本申请实施例中，该节点进一步的还可以包括，第四处理单元44。
第四处理单元44，用于支持节点执行图5所示的传输路径的确定方法中的步骤302。
需要说明的是，上述方法实施例涉及的各步骤的所有相关内容均可以援引到对应功能模块的功能描述，在此不再赘述。
本发明实施例提供的节点，用于执行上述传输路径的确定方法，因此可以达到与上述传输路径的确定方法相同的效果。
在采用集成的单元的情况下，图7示出了上述实施例中所涉及的节点的另一种可能的组成示意图。如图7所示，该节点包括：处理模块51和通信模块52。
处理模块51用于对节点的动作进行控制管理，例如，处理模块51用于支持节点执行图5中的步骤301至步骤305。通信模块52用于支持节点与其他网络实体的通信。节点还可以包括存储模块53，用于存储节点的程序代码和数据。
其中，处理模块51可以是处理器或控制器。其可以实现或执行结合本发明公开内容所描述的各种示例性的逻辑方框，模块和电路。处理器也可以是实现计算功能的组合，例如包含一个或多个微处理器组合，DSP和微处理器的组合等等。通信模块52可以是收发器、收发电路或通信接口等。存储模块53可以是存储器。
当处理模块51为处理器，通信模块52为通信接口，存储模块53为存储器时，本发明实施例所涉及的节点可以为图4所示的节点。
通过以上的实施方式的描述，所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，仅以上述各功能模块的划分进行举例说明，实际应用中，可以根据需要而将上述功能分配由不同的功能模块完成，即将装置的内部结构划分成不同的功能模块，以完成以上描述的全部或者部分功能。
在本申请所提供的几个实施例中，应该理解到，所揭露的装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述模块或单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个装置，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是一个物理单元或多个物理单元，即可以位于一个地方，或者也可以分布到多个不同地方。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本发明各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个可读取存储介质中。基于这样的理解，本发明实施例的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该软件产品存储在一个存储介质中，包括若干指令用以使得一个设备(可以是单片机，芯片等)或处理器(processor)执行本发明各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本发明的具体实施方式，但本发明的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本发明揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本发明的保护范围之内。因此，本发明的保护范围应以所述权利要求的保护范围为准。

Claims (10)

  1. 一种传输路径的确定方法，其特征在于，第一节点通过所述传输路径向第二节点传输报文，所述方法包括：
    所述第一节点确定第一候选路径组，所述第一候选路径组包括至少一条第一候选路径，所述第一候选路径的源节点为所述第一节点或所述第二节点，其中，当所述第一候选路径的源节点为所述第一节点时，所述第一候选路径的目的节点为所述第二节点，当所述第一候选路径的源节点为所述第二节点时，所述第一候选路径的目的节点为所述第一节点；
    所述第一节点根据所述第一候选路径组中所包括的所有所述第一候选路径的节点信息，按照预设的第一规则，从所述至少一条第一候选路径内选择第一路径，所述节点信息包括节点标识ID以及节点连接所述第一候选路径的入端口号和/或出端口号；
    当所述第一路径的源节点为所述第一节点时，所述第一节点确定所述第一路径为所述传输路径；
    当所述第一路径的源节点为所述第二节点时，所述第一节点确定第二路径为所述传输路径，其中，所述第二路径为所述第一路径的反向路径。
  2. 根据权利要求1所述的方法，其特征在于，所述第一节点确定第一候选路径组，具体包括：
    所述第一节点根据所述第一节点的节点ID的大小和所述第二节点的节点ID的大小，确定以所述第一节点或者所述第二节点为源节点进行路径计算，确定所述第一候选路径组；
    或者，
    所述第一节点分别以所述第一节点和所述第二节点为源节点进行路径计算，得到所述第一候选路径组和第二候选路径组，根据所述第一节点的节点ID的大小和所述第二节点的节点ID的大小，确定所述第一候选路径组，其中，所述第二候选路径组包括至少一条第二候选路径，当所述第一候选路径以所述第一节点为源节点，以所述第二节点为目的节点时，所述第二候选路径以所述第二节点为源节点，以所述第一节点为目的节点；当所述第一候选路径以所述第二节点为源节点，以所述第一节点为目的节点时，所述第二候选路径以所述第一节点为源节点，以所述第二节点为目的节点。
  3. 根据权利要求1或2所述的方法，其特征在于，所述预设的第一规则是：
    从所述第一候选路径的源节点开始逐节点比较所述第一候选路径组中任意两个所述第一候选路径的节点ID的大小和/或出/入端口号的大小。
  4. 根据权利要求1-3任一项所述的方法，其特征在于，所述第一节点确定第二路径为所述传输路径之前，所述方法还包括：
    所述第一节点倒序所述第一路径，获得所述第二路径。
  5. 根据权利要求1-4任一项所述的方法，其特征在于，所述第一候选路径组中每条所述第一候选路径的路径开销相同，且所述第一候选路径为所述第一节点与所述第二节点之间路径开销最低的路径。
  6. 一种确定传输路径的节点，该节点用作第一节点，其特征在于，所述第一节点通过所述传输路径向第二节点传输报文，所述第一节点包括：
    第一处理单元，用于确定第一候选路径组，所述第一候选路径组包括至少一条第一候选路径，所述第一候选路径的源节点为所述第一节点或所述第二节点，其中，当所述第一候选路径的源节点为所述第一节点时，所述第一候选路径的目的节点为所述第二节点，当所述第一候选路径的源节点为所述第二节点时，所述第一候选路径的目的节点为所述第一节点；
    第二处理单元，用于根据所述第一候选路径组中所包括的所有所述第一候选路径的节点信息，按照预设的第一规则，从所述至少一条第一候选路径内选择第一路径，所述节点信息包括节点标识ID以及节点连接所述第一候选路径的入端口号和/或出端口号；
    第三处理单元，用于根据所述第一路径确定所述传输路径；其中，
    当所述第一路径的源节点为所述第一节点时，第三处理单元，具体用于确定所述第一路径为所述传输路径；
    当所述第一路径的源节点为所述第二节点时，所述第三处理单元，具体用于确定第二路径为所述传输路径，其中，所述第二路径为所述第一路径的反向路径。
  7. 根据权利要求6所述的节点，其特征在于，所述第一处理单元，具体用于：
    根据所述第一节点的节点ID的大小和所述第二节点的节点ID的大小，确定以所述第一节点或者所述第二节点为源节点进行路径计算，确定所述第一候选路径组；
    或者，
    分别以所述第一节点和所述第二节点为源节点进行路径计算，得到所述第一候选路径组和第二候选路径组，根据所述第一节点的节点ID的大小和所述第二节点的节点ID的大小，确定所述第一候选路径组，其中，所述第二候选路径组包括至少一条第二候选路径，当所述第一候选路径以所述第一节点为源节点，以所述第二节点为目的节点时，所述第二候选路径以所述第二节点为源节点，以所述第一节点为目的节点；当所述第一候选路径以所述第二节点为源节点，以所述第一节点为目的节点时，所述第二候选路径以所述第一节点为源节点，以所述第二节点为目的节点。
  8. 根据权利要求6或7所述的节点，其特征在于，所述预设的第一规则是：
    从所述第一候选路径的源节点开始逐节点比较所述第一候选路径组中任意两个所述第一候选路径的节点ID的大小和/或出/入端口号的大小。
  9. 根据权利要求6-8任一项所述的节点，其特征在于，当所述第一路径的源节点为所述第二节点时，所述第三处理单元，还用于：
    倒序所述第一路径，获得所述第二路径。
  10. 根据权利要求6-9任一项所述的节点，其特征在于，所述第一候选路径组中每条所述第一候选路径的路径开销相同，且所述第一候选路径为所述第一节点与所述第二节点之间路径开销最低的路径。
PCT/CN2018/090751 2017-06-29 2018-06-12 一种传输路径的确定方法及节点 WO2019001260A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP21156356.4A EP3886377A1 (en) 2017-06-29 2018-06-12 Transmission path determining method and node
EP18823404.1A EP3605970B1 (en) 2017-06-29 2018-06-12 Method and node for determining transmission path
JP2019565859A JP6946470B2 (ja) 2017-06-29 2018-06-12 伝送パスを決定する方法およびノード
US16/710,037 US11146480B2 (en) 2017-06-29 2019-12-11 Apparatus, method of determining transmission path and computer-readable storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710514625.3 2017-06-29
CN201710514625.3A CN109218190B (zh) 2017-06-29 2017-06-29 一种传输路径的确定方法及节点

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/710,037 Continuation US11146480B2 (en) 2017-06-29 2019-12-11 Apparatus, method of determining transmission path and computer-readable storage medium

Publications (1)

Publication Number Publication Date
WO2019001260A1 true WO2019001260A1 (zh) 2019-01-03

Family

ID=64740336

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/090751 WO2019001260A1 (zh) 2017-06-29 2018-06-12 一种传输路径的确定方法及节点

Country Status (5)

Country Link
US (1) US11146480B2 (zh)
EP (2) EP3886377A1 (zh)
JP (2) JP6946470B2 (zh)
CN (2) CN109218190B (zh)
WO (1) WO2019001260A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114765591A (zh) * 2020-12-31 2022-07-19 大唐移动通信设备有限公司 一种数据传输方法、装置及存储介质

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111464440A (zh) * 2019-01-21 2020-07-28 华为技术有限公司 一种通信方法及装置
CN111698152B (zh) * 2019-03-15 2021-09-14 华为技术有限公司 一种故障保护方法、节点及存储介质
CN111131033A (zh) * 2019-11-22 2020-05-08 江苏星地通通信科技有限公司 基于mesh网络的智能路由切换方法、系统及存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7466701B2 (en) * 2004-11-12 2008-12-16 Stmicroelectronics S.R.L. Routing procedure and system, corresponding network, such as a network on chip (NOC), and computer program product therefor
CN102957574A (zh) * 2011-08-26 2013-03-06 中兴通讯股份有限公司 传输路径的对称性检测方法及系统
CN105471741A (zh) * 2015-12-16 2016-04-06 青岛大学 一种移动Ad Hoc网络中双向可信路由确定方法

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2868072B2 (ja) * 1995-11-20 1999-03-10 日本電気株式会社 通信装置の経路選択方式
JP3619411B2 (ja) * 1999-12-03 2005-02-09 富士通株式会社 パケット中継装置
JP3997844B2 (ja) 2002-06-12 2007-10-24 日本電気株式会社 経路計算方法、経路計算プログラム及び経路計算装置
US7500013B2 (en) * 2004-04-02 2009-03-03 Alcatel-Lucent Usa Inc. Calculation of link-detour paths in mesh networks
US20070153707A1 (en) * 2006-01-04 2007-07-05 Pascal Thubert Ad hoc network formation and management based on aggregation of ad hoc nodes according to an aggregation hierarchy
US7911944B2 (en) 2007-12-26 2011-03-22 Nortel Networks Limited Tie-breaking in shortest path determination
DE602008002147D1 (de) * 2008-03-28 2010-09-23 Ntt Docomo Inc Verfahren und Vorrichtung zur Erhöhung des Datendurchsatzes in einem Kommunikationsnetzwerk
JP4939579B2 (ja) * 2009-08-31 2012-05-30 トムソン ライセンシング 無線ネットワークにおける経路選択
CN101778041B (zh) * 2009-12-31 2012-07-18 福建星网锐捷网络有限公司 路径选择方法、装置和网络设备
CN102223671B (zh) * 2010-04-15 2014-02-19 华为技术有限公司 无线多跳网络中数据传输的方法和通信设备
JP5439297B2 (ja) * 2010-06-30 2014-03-12 株式会社日立製作所 制御サーバ、および、ネットワークシステム
CN105262683B (zh) * 2011-01-13 2021-03-30 日本电气株式会社 网络系统和路由控制方法
EP2853068A1 (en) 2012-05-22 2015-04-01 Rockstar Consortium US LP Tie-breaking in shortest path determination
CN102932250B (zh) * 2012-10-30 2015-06-24 清华大学 一种基于容错计算机网络结构的无死锁自适应路由方法
JP6167543B2 (ja) * 2013-02-06 2017-07-26 日本電気株式会社 ネットワーク管理装置および通信経路の設定方法
JP2015156589A (ja) * 2014-02-21 2015-08-27 日本電信電話株式会社 通信装置及び通信プログラム
CN104092606B (zh) * 2014-06-24 2017-02-15 重庆邮电大学 一种光网络中基于业务持续时间调度的节能路由方法
CN104283780B (zh) * 2014-09-26 2018-03-13 华为技术有限公司 建立数据传输路径的方法和装置
CN105049355A (zh) * 2015-08-21 2015-11-11 中国联合网络通信集团有限公司 一种路由方法和装置
CN106603405B (zh) * 2015-10-15 2020-02-14 华为技术有限公司 一种路由以及波长分配方法及装置
CN105471730B (zh) * 2015-11-16 2018-05-25 国家电网公司 电力通信分层路由路径确定方法
CN106301921B (zh) * 2016-08-16 2019-05-14 清华大学 基于隧道的大象流量传输调度方法及系统
CN106534220A (zh) * 2016-12-30 2017-03-22 北京奇虎科技有限公司 一种流数据的双向传输方法和装置
US20180316599A1 (en) * 2017-04-27 2018-11-01 Hewlett Packard Enterprise Development Lp Routing packets considering the propagation delay of routes

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7466701B2 (en) * 2004-11-12 2008-12-16 Stmicroelectronics S.R.L. Routing procedure and system, corresponding network, such as a network on chip (NOC), and computer program product therefor
CN102957574A (zh) * 2011-08-26 2013-03-06 中兴通讯股份有限公司 传输路径的对称性检测方法及系统
CN105471741A (zh) * 2015-12-16 2016-04-06 青岛大学 一种移动Ad Hoc网络中双向可信路由确定方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3605970A4

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114765591A (zh) * 2020-12-31 2022-07-19 大唐移动通信设备有限公司 一种数据传输方法、装置及存储介质
CN114765591B (zh) * 2020-12-31 2023-07-18 大唐移动通信设备有限公司 一种数据传输方法、装置及存储介质

Also Published As

Publication number Publication date
JP7250871B2 (ja) 2023-04-03
CN112039772A (zh) 2020-12-04
JP2020522184A (ja) 2020-07-27
JP6946470B2 (ja) 2021-10-06
EP3605970A4 (en) 2020-03-25
CN112039772B (zh) 2024-04-09
US11146480B2 (en) 2021-10-12
US20200112501A1 (en) 2020-04-09
EP3605970B1 (en) 2021-03-31
EP3605970A1 (en) 2020-02-05
JP2022002400A (ja) 2022-01-06
CN109218190B (zh) 2020-08-07
CN109218190A (zh) 2019-01-15
EP3886377A1 (en) 2021-09-29

Similar Documents

Publication Publication Date Title
US8345697B2 (en) System and method for carrying path information
JP7417825B2 (ja) スライスベースルーティング
US10924352B2 (en) Data center network topology discovery
JP6444410B2 (ja) ネットワーク経路算出方法及び装置
TWI543566B (zh) 基於軟體定義網路的資料中心網路系統及其封包傳送方法、位址解析方法與路由控制器
EP2783480B1 (en) Method for multicast flow routing selection
WO2019001260A1 (zh) 一种传输路径的确定方法及节点
CN107113241B (zh) 路由确定方法、网络配置方法以及相关装置
US11336577B2 (en) Method and apparatus for implementing load sharing
JP6589060B2 (ja) ソフトウェア定義ネットワークのエントリ生成およびパケット転送
US10924385B2 (en) Weighted multipath routing configuration in software-defined network (SDN) environments
US9559989B2 (en) Link problem handling
WO2017140112A1 (zh) 一种多路径转发报文方法及装置
WO2018099394A1 (zh) 报文传输
WO2020156090A1 (zh) 一种建立跨域转发路径的方法、装置及系统
CN105052092A (zh) 具有孤立端口的多节点虚拟交换机中的路径优化
US20230216786A1 (en) Method for forwarding service packet, method for sending sr policy, device, and system
WO2022048418A1 (zh) 一种转发报文的方法、设备和系统
US10855572B2 (en) Area abstraction extensions to routing protocols
WO2015039616A1 (zh) 一种报文处理方法及设备
WO2022007550A1 (zh) 一种负载均衡方法、装置、网络设备及系统
WO2022012690A1 (zh) 一种路由通告方法及相关设备
WO2023130957A1 (zh) 一种路由选路的方法及相关设备
US10965589B2 (en) Fast receive re-convergence of multi-pod multi-destination traffic in response to local disruptions
WO2023088244A1 (zh) 一种路径确定方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18823404

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2018823404

Country of ref document: EP

Effective date: 20191101

ENP Entry into the national phase

Ref document number: 2019565859

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE