WO2018001351A1 - 以太网路径的获取方法及装置 - Google Patents

以太网路径的获取方法及装置 Download PDF

Info

Publication number
WO2018001351A1
WO2018001351A1 PCT/CN2017/091029 CN2017091029W WO2018001351A1 WO 2018001351 A1 WO2018001351 A1 WO 2018001351A1 CN 2017091029 W CN2017091029 W CN 2017091029W WO 2018001351 A1 WO2018001351 A1 WO 2018001351A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
node
ethernet
shortest
target
Prior art date
Application number
PCT/CN2017/091029
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 中兴通讯股份有限公司
Publication of WO2018001351A1 publication Critical patent/WO2018001351A1/zh

Links

Images

Definitions

  • the present disclosure relates to the field of communications, for example, to a method and apparatus for acquiring an Ethernet path.
  • SD-OTN Software Definition Optical Transmission Net
  • Constrained Shortest Path First Constrained Shortest Path First
  • LSP Label Switched Path
  • FIG. 1 is a topological diagram of an Ethernet network in the related art. As shown in Figure 1, the elements included in the Ethernet topology are: Ethernet Forward Domain (ETH-FD) and electrical forwarding domain (Electric). Forward Domain (E-FD), Forward Domain (FD), Logical Termination Point (LTP), and link.
  • ETH-FD Ethernet Forward Domain
  • E-FD Electrical forwarding domain
  • FD Forward Domain
  • LTP Logical Termination Point
  • the Ethernet service is accessed from the User Network Interface (UNI) ports LTP-A-1, LTP-B-1, LTP-C-1, and LTP-D-1 in the four Ethernet layers.
  • NNI Ethernet Network Interface
  • the electrical layer UNI ports corresponding to LTP-A-1, LTP-B-1, LTP-C-1, and LTP-D-1 are LTP-1-1, LTP-2-1, LTP-3-1, and LTP, respectively. -4-1.
  • the method adopted in the related art is to adopt an exhaustive and multi-segment splicing idea.
  • First take 2 points (LTP-1-1, LTP-4-1) from the four LTPs as the first and last points, and other points (LTP-2-1, LTP-3-1) as the necessary nodes to calculate a path. come out.
  • LTP-1-1, LTP-4-1 points from the four LTPs as the first and last points
  • LTP-2-1, LTP-3-1 points
  • the disadvantage of this algorithm is that it is calculated more frequently and slower. The more nodes, the more times you count, If there are N points, then N-1 segments need to be calculated. Another disadvantage is that the calculated path does not necessarily approach the optimal path. After all, the first and last nodes are selected, and the order of the necessary nodes and nodes is not necessarily optimal. For example, the link between the four points A, D, K, and Z may be A-D-K-Z or A-K-D-Z. If the order of the selected necessary nodes is D and K, the former is spliced first, and the output path calculation result is A-D-K-Z, even if the cost of the former is larger than the latter.
  • the implementation method of calculating the Ethernet path is cumbersome and does not consider the path cost, and there is no better solution.
  • the present disclosure provides a method and an apparatus for acquiring an Ethernet path, so as to at least solve the problem that the implementation method of calculating an Ethernet path is cumbersome and does not consider the path cost in the related art.
  • a method for acquiring an Ethernet path including: determining a target path from a shortest path set; and determining whether the target path passes through all nodes in the domain E-FD; If the judgment result is no, the tail node of the target path is regarded as a new first node, and the shortest path set is updated by using the target path until the new target path passes all of the E-FD a node that passes the path of the target path through all the nodes in the E-FD as a final determined Ethernet path; wherein the target path is a target that has not been spliced and passes through the node in the E-FD path.
  • updating the shortest path set by using the target path until the target path passes all the nodes in the E-FD further comprising: selecting the target path and the updated shortest path set A path that has not been spliced and has the most nodes in the E-FD of the electrical layer forwarding domain is spliced to form a new target path.
  • updating the shortest path set by using the Dijkstra algorithm further includes: a node other than the first node in the target path cannot update the shortest path set.
  • determining, from the shortest path set, a target path that has not been spliced and passing the node further includes: the first node and the shortest The path set is stored in the first node path set.
  • calculating, by using a single source shortest path Dijkstra algorithm, the shortest path set passing through all nodes in the E-FD including: if the shortest path set is an empty set, the first node path set is not an empty set And if there is a path in the set of head node paths that has not been spliced, then the shortest path set in the set of head node paths is used, and the target path in the shortest path set is set to be empty.
  • calculating the shortest path set of all nodes in the E-FD by using a single source shortest path Dijkstra algorithm further comprising: if the shortest path set is an empty set, the first node path set is not empty And if the path of the first node path does not have a spliced path, the first node path set is set to an empty set, and the shortest path set and the first node path set are determined again.
  • calculating, by using the single source shortest path Dijkstra algorithm, the shortest path set passing through all nodes in the E-FD further comprising: if the shortest path set is an empty set, the first node path set is an empty set And replacing the first node, setting the target path as an invalid path; and acquiring the shortest path set by using the Dijkstra algorithm again.
  • calculating, by using the single source shortest path Dijkstra algorithm, the shortest path set passing through all nodes in the E-FD further comprising: if the shortest path set is an empty set, the first node path set is an empty set If there is no first node that can be replaced, a failure message is returned.
  • the method before determining, by the set of the shortest path, that the splicing is not performed, and before the electrical layer forwards the target path of the node in the domain E-FD, the method further includes: determining, according to the interface UNI of the Ethernet user network, a plurality of Ethernet network interfaces NNI; determining, according to the Ethernet NNI; a corresponding electrical layer user network interface UNI in the E-FD; connecting the Ethernet NNI and the Ethernet UNI to form an Ethernet Layer path.
  • the determination result is yes, connecting the electrical layer UNI corresponding to the node and the interface in the target path to form an electrical layer path; generating, by using the Ethernet layer path and the electrical layer path Ethernet path.
  • the present disclosure provides an apparatus for acquiring an Ethernet path, including: a first determining module, configured to: determine a target path from a shortest path set; and a determining module, configured to: determine the target path Whether it passes through all the nodes in the E-FD; the processing module is configured to: when the determination result is no, the tail node of the target path is used as a new first node, and the target path is used to update the a shortest path set until a new target path passes through all nodes in the E-FD, and the path of the target path through all nodes in the E-FD is taken as a final determined Ethernet path; wherein the target The path is a target path that has not been spliced and passes through the nodes in the E-FD.
  • the apparatus further includes: a generating module, configured to: calculate, by using a single source shortest path Dijkstra algorithm, the shortest path set passing through all nodes in the E-FD.
  • a generating module configured to: calculate, by using a single source shortest path Dijkstra algorithm, the shortest path set passing through all nodes in the E-FD.
  • the processing module includes: a splicing unit, configured to: align the target path with the updated one of the shortest path sets, and pass the electrical layer forwarding domain E-FD with the most nodes The paths are stitched together to form a new target path.
  • a splicing unit configured to: align the target path with the updated one of the shortest path sets, and pass the electrical layer forwarding domain E-FD with the most nodes The paths are stitched together to form a new target path.
  • the processing module includes: a storage unit, configured to: store the first node and the shortest path set in the first node path set.
  • the generating module includes: a first processing unit, configured to: if the shortest path set is an empty set, the first node path set is not an empty set, and the first node path set exists In the case of a spliced path, the shortest path set in the set of head node paths is used, and the target path in the shortest path set is set to be empty.
  • the generating module further includes: a second processing unit, configured to: if the shortest path set is an empty set, the first node path set is not an empty set, and the first node path set is not In the case where there is a path that has not been spliced, the set of the first node path is set to an empty set, and the shortest path set and the set of the first node path are again determined.
  • a second processing unit configured to: if the shortest path set is an empty set, the first node path set is not an empty set, and the first node path set is not In the case where there is a path that has not been spliced, the set of the first node path is set to an empty set, and the shortest path set and the set of the first node path are again determined.
  • the generating module further includes: a third processing unit, configured to: if the shortest path set is an empty set, and the first node path set is an empty set, replace the first node, and The target path is set to an invalid path, and the shortest path set is acquired again using the Dijkstra algorithm.
  • a third processing unit configured to: if the shortest path set is an empty set, and the first node path set is an empty set, replace the first node, and The target path is set to an invalid path, and the shortest path set is acquired again using the Dijkstra algorithm.
  • the generating module further includes: a fourth processing unit, configured to: if the shortest path set is an empty set, the first node path set is an empty set, and there is no replaceable first node , returns a failure message.
  • a fourth processing unit configured to: if the shortest path set is an empty set, the first node path set is an empty set, and there is no replaceable first node , returns a failure message.
  • the device further includes: a second determining module, configured to: determine, according to the interface UNI of the Ethernet user network, a plurality of interfaces NNI between the Ethernet networks; and the third determining module is configured to: according to the Ethernet NNI; determining a corresponding electrical layer user network interface UNI in the E-FD; first connection The connection module is configured to: connect the Ethernet NNI and the Ethernet UNI to form an Ethernet layer path.
  • a second determining module configured to: determine, according to the interface UNI of the Ethernet user network, a plurality of interfaces NNI between the Ethernet networks
  • the third determining module is configured to: according to the Ethernet NNI; determining a corresponding electrical layer user network interface UNI in the E-FD; first connection
  • the connection module is configured to: connect the Ethernet NNI and the Ethernet UNI to form an Ethernet layer path.
  • the device further includes: a second connection module, configured to: when the determination result is yes, connect the electrical layer UNI corresponding to the node and the interface in the target path to form an electrical layer path;
  • the Ethernet path generation module is configured to generate an Ethernet path by using the Ethernet layer path and the electrical layer path.
  • the present disclosure also provides a storage medium.
  • the storage medium is arranged to store program code for performing the following steps:
  • the tail node of the target path is used as a new first node, and the shortest path set is updated by using the target path until the new target path passes through the E-FD. All the nodes that pass the path of the target path through all the nodes in the E-FD as the final determined Ethernet path;
  • the target path is a target path that has not been spliced and passes through a node in the E-FD.
  • the storage medium is further arranged to store program code for performing the following steps:
  • the storage medium is further arranged to store program code for performing the following steps:
  • the storage medium is further arranged to store program code for performing the following steps:
  • the embodiment further provides a computer readable storage medium storing computer executable instructions for performing the above method for acquiring an Ethernet path.
  • the embodiment further provides a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions, When the program instructions are executed by a computer, the computer is caused to perform an acquisition method of any of the above Ethernet paths.
  • the present disclosure determines a path through all nodes in the E-FD due to cyclic updates and using the shortest path set. Therefore, the problem that the implementation method of calculating the Ethernet path in the related art is cumbersome and the path cost is not considered can be solved, thereby achieving the effect of simplifying the calculation of the Ethernet path and reducing the cost of the path.
  • 1 is a topological diagram of an Ethernet network in the related art
  • FIG. 2 is a block diagram showing the hardware structure of a computer terminal for acquiring an Ethernet path according to the embodiment
  • FIG. 3 is a flowchart of a method for acquiring an Ethernet path according to this embodiment
  • FIG. 5 is a flowchart of another method for acquiring an Ethernet path according to this embodiment.
  • FIG. 6 is a flowchart of another method for acquiring an Ethernet path according to this embodiment.
  • Figure 7 is a flowchart of the scenario of the embodiment.
  • FIG. 10 is a structural diagram of an apparatus for acquiring an Ethernet path according to the embodiment.
  • FIG. 11 is a structural diagram of another apparatus for acquiring an Ethernet path according to the embodiment.
  • FIG. 12 is a structural diagram of still another apparatus for acquiring an Ethernet path according to the embodiment.
  • FIG. 13 is a structural diagram of another apparatus for acquiring an Ethernet path according to the embodiment.
  • FIG. 14 is a structural diagram of another apparatus for acquiring an Ethernet path according to the embodiment.
  • 15 is a structural diagram of still another apparatus for acquiring an Ethernet path according to the embodiment.
  • FIG. 16 is a structural diagram of still another apparatus for acquiring an Ethernet path according to the embodiment.
  • FIG. 2 is a hardware structural block diagram of a computer terminal for acquiring an Ethernet path according to the embodiment.
  • computer terminal 20 may include one or more (only one shown) processor 202 (processor 202 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA).
  • processor 202 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA).
  • FIG. 2 is merely illustrative and does not limit the structure of the above electronic device.
  • computer terminal 20 may also include more or fewer components than those shown in FIG. 2, or have a different configuration than that shown in FIG. 2.
  • the memory 204 can be used to store software programs and modules of the application software, such as program instructions/modules corresponding to the acquisition method of the Ethernet path in the embodiment, and the processor 202 executes by executing the software program and the module stored in the memory 204.
  • Memory 204 can include high speed random access memory and can also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid state memory.
  • memory 204 can include memory remotely located relative to processor 202, which can be connected to computer terminal 20 over a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • Transmission device 206 is for receiving or transmitting data over a network.
  • the network specific examples described above may include a wireless network provided by a communication provider of the computer terminal 20.
  • the transmission device 206 includes a Network Interface Controller (NIC) that can be connected to other network devices through a base station to communicate with the Internet.
  • the transmission device 206 can be a Radio Frequency (RF) module for communicating with the Internet wirelessly.
  • NIC Network Interface Controller
  • RF Radio Frequency
  • FIG. 3 is a flowchart of a method for acquiring an Ethernet path according to the embodiment. As shown in FIG. 3, the process includes The following steps.
  • step S302 one target path is determined from the shortest path set.
  • step S304 it is determined whether the target path passes through all nodes in the E-FD.
  • all nodes in the E-FD may refer to all nodes in the E-FD that are connected to the Ethernet layer.
  • the nodes connected to the Ethernet layer in the E-FD include FD-1, FD-2, and FD-3. And FD-4.
  • the FD-5 is not part of the E-FD connected to the Ethernet layer.
  • all the nodes in the E-FD are only an optional implementation manner.
  • all the nodes that must pass in the E-FD can be set according to the user's own needs. For example, as shown in FIG. 1, if a path through FD-1, FD-3, FD-4 is required, then the target path needs to pass at least FD-1, FD-3, FD-4.
  • FD-2 can also be included in the target path.
  • step S306 if the determination result is no, the tail node of the target path is taken as a new head node, and the shortest path set is updated by using the target path until the new target path passes the E All the nodes in the FD pass the path of the target path through all the nodes in the E-FD as the final determined Ethernet path.
  • the two identical paths are FD-1-FD-2-FD-4 and FD-1-FD-5-FD-4, although both are the same, they are all 1300, but considering FD
  • the number of UUI interfaces in -5 is greater than FD-2, which facilitates splicing between subsequent paths. Therefore, the target path is FD-1-FD-2-FD-4.
  • updating the shortest path set by using the target path, until the target path passes through all the nodes in the E-FD, and the target path and the updated shortest path set may be one of The splicing is performed, and the path with the most nodes in the E-FD in the electrical layer forwarding domain is spliced to form a new target path.
  • the target path determined before the update is FD-1-FD-2-FD-4.
  • the shortest path set after the update is ⁇ FD-1-FD-5, FD-3 ⁇ . Since FD-1-FD-5 has not been spliced, it is the path that passes the most nodes in the updated shortest path set. Therefore, FD-1-FD-2-FD-4 and FD-1-FD-5 can be spliced to form FD-1-FD-2-FD-4-FD-5. This path is the new target path.
  • the shortest path described above is calculated by using all the nodes in the E-FD by using a single source shortest path Dijkstra algorithm.
  • the Dijkstra algorithm involves generating a shortest path tree from the head node to all tail nodes. Compared with the method of the algorithm of the exhaustive path head and tail nodes in the related art, the amount of calculation can be greatly reduced.
  • the nodes in the target path do not have the ability to update the shortest path set.
  • the target path is FD-4-FD-2-FD-1
  • the already used FD-2, FD-1 nodes cannot appear after the update.
  • the updated shortest path set is ⁇ FD-4-FD-1 ⁇ . It should be noted that the first node needs to appear in the updated shortest path set.
  • the shortest path set is not an empty set, the ⁇ first node, the shortest path set ⁇ is stored in the first node path set.
  • the shortest path set is always not an empty set. However, as the shortest path set is updated, fewer and fewer nodes can be used to determine the shortest path set, and therefore, it is likely that the shortest path set will have an empty set.
  • the shortest path set is an empty set
  • the first node path set is not an empty set
  • a shortest path set in the set of head node paths is used, and a target path in the shortest path set is set to be empty.
  • the updated shortest path set is an empty set.
  • the ⁇ FD-4-FD-5-FD-1-FD-3 in the head node will be , FD-4-FD-2 ⁇ is the shortest path set, and FD-4-FD-5-FD-1-FD-3 is set to null, that is, the shortest path set is ⁇ FD-4-FD-2 ⁇ .
  • the shortest path set is an empty set
  • the first node path set is not an empty set
  • the set of head node paths is set to an empty set, and the shortest path set and the first node path set are again determined.
  • the target path is FD-1-FD-2-FD-5-FD-4
  • the first node The path is ⁇ FD-1, FD-1-FD-2-FD-5-FD-4, FD-1-FD-3 ⁇ .
  • FD-3 failed to connect with FD-4, and the path FD-1-FD-3 and FD-1-FD-2-FD-5-FD-4 could not be spliced. Therefore, there is no path in the first path set that has not been spliced.
  • the head node path blanks ⁇ FD-1, FD-1-FD-2-FD-5-FD-4, FD-1-FD-3 ⁇ , and then judges again whether the shortest path set is an empty set. Empty set, whether the first node path set is an empty set.
  • the shortest path set is an empty set, and the first node path set is an empty set.
  • the first node is replaced, the target path is set to an invalid path; and the shortest path set is acquired again using the Dijkstra algorithm.
  • the shortest path set is an empty set
  • the first node path set is an empty set
  • FIG. 4 is a topological diagram of an Ethernet network of the present embodiment.
  • the arbitrarily selected first node in FIG. 4 cannot be used to form a path through all the nodes in the E-FD.
  • the network side device located in the SD-OTN feeds back the failure information to the user side device. It is used to feedback that the nodes in the current E-FD cannot implement the transmission of service data.
  • the target path is a target path that has not been spliced and passes through a node in the E-FD.
  • the meaning of splicing is that the first node of one path is connected to the first node or the tail node of another path.
  • the shortest path set exists ⁇ FD-1-FD-5-FD-4, FD-1-FD-2, FD-1-FD-3 ⁇ . If FD-4 can be linked to FD-2, FD-1-FD-5-FD-4 can be spliced with FD-1-FD-2. However, if FD-4 cannot be connected to FD-3, FD-1-FD-5-FD-4 cannot be spliced with FD-1-FD-3.
  • FIG. 5 is a flowchart of another method for acquiring an Ethernet path in this embodiment. As shown in FIG. 5, in addition to all the steps shown in FIG. 3, the method further includes:
  • step S502 a plurality of inter-Ethernet network interfaces NNI are determined according to the Ethernet user network interface UNI.
  • step S504 the corresponding electrical layer user network interface UNI in the E-FD is determined according to the Ethernet NNI.
  • step S506 the Ethernet NNI and the Ethernet UNI are connected to form an Ethernet layer path.
  • the inter-network interface FD-A-1 exists on the FD-A node in the Ethernet Forward Domain (ETH-FD).
  • ETH-FD Ethernet Forward Domain
  • two Ethernet network interfaces LTP-A-11 and LTP-A-12 are determined on the node FD-A.
  • LTP-A-11 and LTP-A-12 the electrical layer user network interface LTP1-1 in the node FD-1 is determined on the corresponding E-FD. Since the FD-1 corresponding to the FD-A is the head node and the FD-2 corresponding to the FD-C is the tail node, the path of the Ethernet layer formed by the FD-A is LTP-A-1-LTP-A.
  • Ethernet path formed by the FD-C is LTP-C-1-LTP-C-11.
  • the formed Ethernet layer paths are LTP-B-1-LTP-B-11-LTP-B-12 and LTP-D. -1-LTP-D-11-LTP-D-12
  • FIG. 6 is a flowchart of another method for acquiring an Ethernet path according to this embodiment. As shown in FIG. 6, in addition to all the steps shown in FIG. 5, the method further includes:
  • step S602 if the determination result is YES, the electrical layer UNI corresponding to the node and the interface in the target path are connected to form an electrical layer path.
  • the electrical layer UNI is connected to the UUI interface of each node in the target path.
  • step S604 an Ethernet path is generated using the Ethernet layer path and the electrical layer path.
  • LTP-1-3-LTP-5-1-LTP-5-2-LTP-2-3-LTP-2-4-LTP-4-2-LTP-LTP- 4-4-LTP-3-2 is linked to form a LTP 1-1-LTP-1-3-LTP-5-1-LTP-5-2-LTP-2-3-LTP-2-4 - Electrical layer path of -LTP-4-2-LTP-4-4-LTP-3-2-LTP3-1.
  • Fig. 7 is a flow chart of the scene of the embodiment. The following scenarios apply to the steps shown in Figure 7.
  • the Ethernet service is accessed from the logical termination points LTP-A-1, LTP-B-1, LTP-C-1, and LTP-D-1 of the four Ethernet layers. Need to calculate a path to connect 4 Ethernet access LTP.
  • Ethernet request is parsed.
  • the Ethernet UNI interfaces are LTP-A-1, LTP-B-1, LTP-C-1, and LTP-D-1.
  • Ethernet UNI interface In the node where the Ethernet UNI interface is located (FD-A, FD-B, FD-C, FD-D), find the available Ethernet NNI interfaces, namely: FD-A-11, FD-A- 12, FD-B-11, FD-B-12, FD-C-11, FD-C-12, FD-D-11, FD-D-12.
  • the LTP corresponding to the Ethernet NNI port is LTP-1-1, LTP-2-1, LTP-3-1, and LTP-4-1.
  • S4 Create an electrical layer path calculation request, and calculate an electrical layer path through FD-1, FD-2, FD-3, and FD-4.
  • S4 includes:
  • the first node set is initialized to ⁇ FD-1, FD-2, FD-3, FD-4 ⁇ .
  • the target path is initially empty.
  • the first node path set is initially empty.
  • a node FD-1 is taken from the first node set as the first node, and the first node set becomes ⁇ FD-2, FD-3, FD-4 ⁇ .
  • S42 Call Dijkstra shortest path algorithm to calculate the shortest path from the first node to the necessary node on the target path to form a shortest path set: ⁇ FD-1-FD-5-FD-2-FD-4, FD-1 -FD-3 ⁇ .
  • the shortest path set is not empty, and the object ⁇ FD-1, ⁇ FD-1-FD-5-FD-2-FD-4, FD-1-FD-3 ⁇ is added to the first node path set.
  • the target path does not include the mandatory node FD-3, indicating that the complete path has not been calculated yet, and the tail node FD-4 of the FD-1-FD-5-FD-2-FD-4 is used as the new first node. Go to S42.
  • S46 The interface of the electrical layer UNI port and the target path is formed into an LTP sequence to form an electrical layer path: LTP-1-1-LTP-1-3-LTP-5-1-LTP-5-2-LTP-2 -3-LTP-2-1-LTP-2-4-LTP-4-2-LTP-4-1-LTP-4-4-LTP-3-2-LTP-3-1.
  • Ethernet UNI port and the NNI port form an LTP sequence to form an Ethernet layer path: LTP-A-1-LTP-A-11-LTP-B-1-LTP-B-11-LTP-B- 12-LTP-D-1, LTP-D-11-LTP-D-12-LTP-C-1-LTP-C-11.
  • FIG. 8 is a topological diagram of still another Ethernet network according to the embodiment. As shown in FIG. 7 and FIG. 8, the Ethernet service is from the logical termination points of the four Ethernet layers, LTP-A-1, LTP-B-1. LTP-C-1, LTP-D-1 access, need to calculate a path to connect 4 Ethernet access LTP.
  • Ethernet request is parsed.
  • the Ethernet UNI interfaces are LTP-A-1, LTP-B-1, LTP-C-1, and LTP-D-1.
  • the electrical layer logical termination points corresponding to the Ethernet NNI port are LTP-1-1, LTP-2-1, LTP-3-1, and LTP-4-1.
  • S4 Create an electrical layer path calculation request, and calculate an electrical layer path through FD-1, FD-2, FD-3, and FD-4. S4 also includes the following steps:
  • the set of the first node that has not been tried is initialized to ⁇ FD-1, FD-2, FD-3, FD-4 ⁇ .
  • the target path is initially empty.
  • the first node path set is initially empty.
  • a node FD-1 is taken from the first node set as the first node, and the first node set becomes ⁇ FD-2, FD-3, FD-4 ⁇ .
  • S42 Call Dijkstra shortest path algorithm to calculate the shortest path from the first node to the necessary node on the target path to form a shortest path set: ⁇ FD-1-FD-5-FD-2-FD-4, FD-1 -FD-3 ⁇ .
  • the shortest path set is not empty, and the object ⁇ FD-1, ⁇ FD-1-FD-5-FD-2-FD-4, FD-1-FD-3 ⁇ is added to the first node path set.
  • the target path does not include the mandatory node FD-3, indicating that the complete path has not been calculated yet, and the tail node FD-4 of the FD-1-FD-5-FD-2-FD-4 is used as the new first node. , turn to S42.
  • the shortest path set is empty, and the first node path set is not empty, and the shortest path corresponding to the first node in the first node path set has the shortest path FD-1-FD-3 has not attempted splicing, then
  • the shortest path set is the shortest path set corresponding to the first node in the first node path set, namely ⁇ FD-1-FD-5-FD-2-FD-4, FD-1-FD-3 ⁇ .
  • the target path (FD-1-FD-5-FD-2-FD-4) needs to be shortened to the first node FD-1 in the shortest path set corresponding to the first node in the first node path set, that is, the target path becomes empty again. . Go to step S44.
  • S45 The target path does not include all the necessary nodes, indicating that the complete path has not been calculated yet, and the tail node FD-3 of the FD-1-FD-3 is taken as the new first node, and the process goes to S42.
  • S44 Find a path FD-3-FD-5-FD-2-FD-4 with the largest number of necessary nodes from the shortest path set.
  • the target path FD-1-FD-3 is spliced, and the new target path is FD-1-FD-3-FD-5-FD-2-FD-4.
  • S46 The interface between the electrical layer UNI port and the target path is formed into an LTP sequence to form an electrical layer path: LTP-1-1-LTP-1-4-LTP-3-4-LTP-3-1-LTP-3 -3-LTP-5-4-LTP-5-2-LTP-2-3-LTP-2-1-LTP-2-4-LTP-4--LTP-4-1.
  • Ethernet UNI port and the NNI port form an LTP sequence to form an Ethernet layer path: LTP-A-1-LTP-A-11-LTP-C-1-LTP-C-12-LTP-C- 11-LTP-B-1-LTP-B-11-LTP-B-12-LTP-D-1-LTP-D-11.
  • FIG. 9 is a topological diagram of still another Ethernet network according to the embodiment.
  • the Ethernet service is from the logical termination points of the four Ethernet layers, LTP-A-1, LTP-B-1. , LTP-C-1, LTP-D-1 access, need to calculate - the path to connect 4 Ethernet access LTP.
  • Ethernet request is parsed.
  • the Ethernet UNI interfaces are LTP-A-1, LTP-B-1, LTP-C-1, and LTP-D-1.
  • the electrical layer logical termination points corresponding to the Ethernet NNI port are LTP-1-1, LTP-2-1, LTP-3-1, and LTP-4-1.
  • S4 Create an electrical layer path calculation request, and calculate the electrical layer path of the FD-1, FD-2, FD-3, and FD-4. S4 also includes the following steps:
  • the set of the first node that has not been tried is initialized to ⁇ FD-1, FD-2, FD-3, FD-4 ⁇ .
  • the target path is initially empty.
  • the first node path set is initially empty.
  • a node FD-1 is taken from the first node set as the first node, and the first node set becomes ⁇ FD-2, FD-3, FD-4 ⁇ .
  • S42 Call Dijkstra shortest path algorithm to calculate the shortest path from the first node to the necessary node on the target path to form a shortest path set: ⁇ FD-1-FD-5-FD-2-FD-4, FD-1 -FD-3 ⁇ .
  • the shortest path set is not empty, and the object ⁇ FD-1, ⁇ FD-1-FD-5-FD-2-FD-4, FD-1-FD-3 ⁇ is added to the first node path set.
  • the target path does not include the mandatory node FD-3, indicating that the complete path has not been calculated yet, and the tail node FD-4 of the FD-1-FD-5-FD-2-FD-4 is used as the new first node. Go to S42.
  • the shortest path set is empty, and the first node path set is not empty, and the first node path set is In the shortest path set corresponding to the first node, the shortest path FD-1-FD-3 does not attempt to splicing, and the shortest path set is set to the shortest path set corresponding to the first node in the first node path set, that is, ⁇ FD-1- FD-5-FD-2-FD-4, FD-1-FD-3 ⁇ .
  • the target path (FD-1-FD-5-FD-2-FD-4) needs to be shortened to the first node FD-1 in the shortest path set corresponding to the first node in the first node path set, that is, the target path becomes empty again. . Go to S44.
  • S45 The target path does not include all the necessary nodes, indicating that the complete path has not been calculated yet, and the tail node FD-3 of the FD-1-FD-3 is taken as the new first node, and the process goes to S42.
  • S42-3 If the shortest path set is empty, and the first node path set is empty, and the first node set is not empty, then one node FD-2 is taken as the first node from the first node set, and the target path is initially empty. Go to S42.
  • S42 Calling the Dijkstra shortest path algorithm to calculate the shortest path from the first node to the necessary node not on the target path, forming a shortest path set: ⁇ FD-2-FD-5-FD-1-FD-3, FD-2 -FD-4 ⁇ .
  • the shortest path set is not empty, and the object ⁇ FD-1, ⁇ FD-2-FD-5-FD-1-FD-3, FD-2-FD-4 ⁇ is added to the first node path set.
  • the target path does not include the mandatory node FD-4, indicating that the complete path has not been calculated yet, and the tail node FD-3 of the FD-2-FD-5-FD-1-FD-3 is used as the new first node. Go to S42.
  • the Dijkstra shortest path algorithm is called to calculate the shortest path from the first node FD-3 to the necessary node that is not on the target path, and the nodes ⁇ FD-2, FD-5, FD-1 ⁇ need to be avoided. Since there is no path from FD-3 to FD-4, the shortest path set formed is empty.
  • the shortest path set is empty, and the first node path set is not empty, and the shortest path corresponding to the first node in the first node path set has the shortest path FD-2-FD-4 has not attempted splicing, then
  • the shortest path set is the shortest path set corresponding to the first node in the first node path set, namely ⁇ FD-2-FD-5-FD-1-FD-3, FD-2-FD-4 ⁇ .
  • the target path (FD-2-FD-5-FD-1-FD-3) needs to be shortened to the first node FD-2 in the shortest path set corresponding to the first node in the first node path set, that is, the target path becomes empty again. . Go to S44.
  • S45 The target path does not include all the necessary nodes, indicating that the complete path has not been calculated yet, and the tail node FD-4 of the FD-2-FD-4 is taken as the new first node, and the process goes to S42.
  • S44 Find a path FD-4-FD-5-FD-1-FD-3 with the largest number of necessary nodes from the shortest path set. The splicing is performed with the old target path FD-2-FD-4, and the new target path is FD-2-FD-4-FD-5-FD-1-FD-3.
  • S46 The interface of the electrical layer UNI port and the target path is formed into an LTP sequence to form an electrical layer path: LTP-2-1-LTP-2-4-LTP-4-2-LTP-4-1-LTP-4 -3-LTP-5-3-LTP-5-1-LTP-1-3-LTP-1-1-LTP-1-4-LTP-3-4-LTP-3-1.
  • Ethernet UNI port and the NNI port form an LTP sequence to form an Ethernet layer path: LTP-B-1-LTP-B-12-LTP-D-1-LTP-D-11-LTP-D- 12-LTP-A-1-LTP-A-11-LTP-A-12-LTP-C-1-LTP-C-12.
  • a software product stored in a storage medium (such as a ROM/RAM, a magnetic disk, an optical disk).
  • a number of instructions are included to cause a terminal device (which may be a cell phone, computer, server, or network device, etc.) to perform the methods described in various embodiments of the present disclosure.
  • an apparatus for acquiring an Ethernet path which is used to implement the above embodiment.
  • module may implement a combination of software and/or hardware of a predetermined function.
  • FIG. 10 is a structural diagram of an apparatus for acquiring an Ethernet path according to the embodiment. As shown in FIG. 10, the apparatus includes a first determining module 1002, a determining module 1004, and a processing module 1006.
  • the first determining module 1002 is configured to: determine a target path from the shortest path set;
  • the determining module 1004 is configured to: determine whether the target path passes all nodes in the E-FD;
  • all nodes in the E-FD may refer to all nodes in the E-FD that are connected to the Ethernet layer.
  • the nodes connected to the Ethernet layer in the E-FD include FD-1, FD-2, FD-3, and FD-4.
  • the FD-5 is not part of the E-FD connected to the Ethernet layer.
  • the processing module 1006 is configured to: when the determination result is no, the tail node of the target path is used as a new first node, and the shortest path set is updated by using the target path until the new target path passes through All the nodes in the E-FD take the path of the target path through all the nodes in the E-FD as the final determined Ethernet path;
  • nodes other than the first node in the target path cannot update the shortest path set.
  • the target path is a target path that has not been spliced and passes through a node in the E-FD.
  • the meaning of splicing is that the first node of one path is connected to the first node or the tail node of another path.
  • the shortest path set exists ⁇ FD-1-FD-5-FD-4, FD-1-FD-2, FD-1-FD-3 ⁇ . If FD-4 can be linked to FD-2, FD-1-FD-5-FD-4 can be spliced with FD-1-FD-2. However, if FD-4 cannot be connected to FD-3, FD-1-FD-5-FD-4 cannot be spliced with FD-1-FD-3.
  • FIG. 11 is a structural diagram of another apparatus for acquiring an Ethernet path according to the embodiment. As shown in FIG. 11, the apparatus includes: a generating module 1102 in addition to all the modules shown in FIG.
  • the generating module 1102 is configured to calculate the shortest path set passing through all nodes in the E-FD by using a single source shortest path Dijkstra algorithm.
  • the Dijkstra algorithm involves generating a shortest path tree from the head node to all tail nodes. Compared with the method of the algorithm of the exhaustive path head and tail nodes in the related art, the amount of calculation can be greatly reduced.
  • FIG. 12 is a structural diagram of another apparatus for acquiring an Ethernet path according to the embodiment.
  • the processing module 1006 includes:
  • the splicing unit 1202 is configured to: splicing the target path with one of the updated shortest path sets, and splicing the path with the most nodes in the E-FD of the electrical layer forwarding domain to form a new target path .
  • FIG. 13 is a structural diagram of another apparatus for acquiring an Ethernet path according to the embodiment. As shown in FIG. 13, the apparatus includes a storage unit 1302 in addition to all the modules shown in FIG.
  • the storage unit 1302 is configured to: store the first node and the shortest path set in the first node path set.
  • FIG. 14 is a structural diagram of an apparatus for acquiring an Ethernet path according to the embodiment. As shown in FIG. 14, the apparatus 1102 includes:
  • the first processing unit 1402 is configured to: if the shortest path set is an empty set, the first node path set is not an empty set, and the first node path set has a path that has not been spliced, Then using the shortest path set in the set of head node paths and setting the target path in the shortest path set to be empty.
  • the second processing unit 1404 is configured to: if the shortest path set is an empty set, the first node path set is not an empty set, and the first node path set does not have a path that has not been spliced And setting the first node path set to an empty set, and determining the shortest path set and the first node path set again.
  • the third processing unit 1406 is configured to: if the shortest path set is an empty set, and the first node path set is an empty set, replace the first node, set the target path as an invalid path, and The shortest path set is obtained again using the Dijkstra algorithm.
  • the fourth processing unit 1408 is configured to: if the shortest path set is an empty set, the first node path set is an empty set, and there is no replaceable first node, return failure information.
  • FIG. 15 is a structural diagram of another apparatus for acquiring an Ethernet path according to the embodiment. As shown in FIG. 15, the apparatus includes a second determining module 1502, in addition to all the modules shown in FIG. Mode Block 1504 and first connection module 1506.
  • the second determining module 1502 is configured to: determine an interface NNI between the plurality of Ethernet networks according to the interface UNI between the Ethernet user networks;
  • the third determining module 1504 is configured to: determine, according to the Ethernet NNI, a corresponding electrical layer user network interface UNI in the E-FD;
  • the first connection module 1506 is configured to connect the Ethernet NNI and the Ethernet UNI to form an Ethernet layer path.
  • FIG. 16 is a block diagram of still another apparatus for acquiring an Ethernet path according to the embodiment. As shown in FIG. 16, the apparatus includes, in addition to all the modules shown in FIG. 15, a second connection module 1602 and an Ethernet. Path generation module 1604.
  • the second connection module 1602 is configured to: when the determination result is yes, connect the electrical layer UNI corresponding to the node and the interface in the target path to form an electrical layer path;
  • the electrical layer UNI is connected to the UUI interface of each node in the target path.
  • the Ethernet path generation module 1604 is configured to generate an Ethernet path using the Ethernet layer path and the electrical layer path.
  • each of the foregoing modules may be implemented by software or hardware.
  • the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, each of the above modules is The combined forms are located in different processors.
  • This embodiment also provides a storage medium.
  • the foregoing storage medium may be configured to store program code for performing the following steps:
  • the tail node of the target path is used as a new first node, and the shortest path set is updated by using the target path until the new target path passes through the E-FD. All the nodes that pass the path of the target path through all the nodes in the E-FD as the final determined Ethernet path;
  • the target path is a target path that has not been spliced and passes through a node in the E-FD.
  • the storage medium is further arranged to store program code for performing the following steps:
  • the storage medium is further arranged to store program code for performing the following steps:
  • the storage medium is further arranged to store program code for performing the following steps:
  • the foregoing storage medium may include, but not limited to, a USB flash drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), a mobile hard disk, and a magnetic memory.
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • a mobile hard disk e.g., a hard disk
  • magnetic memory e.g., a hard disk
  • Each of the modules or steps of the present embodiment described above may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices, optionally
  • the program code executable by the computing device can be implemented, such that they can be stored in a storage device for execution by the computing device, and in some cases, the illustrated or described
  • the steps are either made separately into a plurality of integrated circuit modules, or a plurality of modules or steps thereof are fabricated into a single integrated circuit module.
  • the present disclosure provides a method and an apparatus for acquiring an Ethernet path, which can solve the problem that the implementation method of calculating an Ethernet path in the related art is cumbersome and does not consider the path cost, thereby simplifying the calculation of the Ethernet path and reducing the cost of the path. .

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种以太网路径的获取方法及装置。该方法包括：从最短路径集合中确定一条目标路径；判断所述目标路径是否经过电层转发域E-FD中所有的节点；在判断结果为否的情况下，将所述目标路径的尾节点作为新的首节点，并利用所述目标路径更新所述最短路径集合，直至所述目标路径经过所述E-FD中的所有节点，将新的目标路径经过所述E-FD中的所有节点的路径作为最终确定的以太网路径；其中，所述目标路径为未进行过拼接，且经过所述E-FD中节点的目标路径。

Description

以太网路径的获取方法及装置 技术领域
本公开涉及通信领域，例如涉及一种以太网路径的获取方法及装置。
背景技术
软件定义的光传输网络(Software Definition Optical Transmission Net，简称SD-OTN)中对于传输业务标签交换路径(Label Switched Path，简称LSP)的建立，需要采用带约束的路径计算算法(Constrained Shortest Path First，简称CSPF)基于相关技术中的网络拓扑资源来计算。下面介绍SD-OTN中的以太网路径计算。
图1是相关技术中以太网网络的拓扑图，如图1所示，以太网拓扑中包含的元素主要有：以太网转发域(Ethernet Forward Domain，简称ETH-FD)、电层转发域(Electric Forward Domain，简称E-FD)、转发域(Forward Domain简称，FD)、逻辑终端点(Logical Termination Point，简称LTP)以及链路。
以太网业务从4个以太网层中的用户网络间接口(User Network Interface，简称UNI)口LTP-A-1，LTP-B-1，LTP-C-1，LTP-D-1接入。在以太网UNI口所在的最低层FD中，找到可用的以太网网络间接口(Network Network Interface，简称NNI)口。根据以太网的NNI口，在E-FD中找到对应的电层UNI接口。LTP-A-1，LTP-B-1，LTP-C-1，LTP-D-1对应的电层UNI口分别是LTP-1-1，LTP-2-1，LTP-3-1，LTP-4-1。
如果需要计算一条电层路径将4个电层LTP连接起来，且代价最低。相关技术中的采取的方法是采用穷举加多段拼接的思路。先从4个LTP中取出2点(LTP-1-1，LTP-4-1)分别作为首尾点，其他点(LTP-2-1，LTP-3-1)作为必经节点，计算一条路径出来。计算该路径时，要先分段计算，然后拼接出一条完整的路径。即依次计算LTP-1-1到LTP-2-1的最低代价路径，LTP-2-1到LTP-3-1的最低代价路径，LTP-3-1到LTP-4-1的最低代价路径，然后将三段路径拼接起来。如果计算不出一条完整的路径，则先调整必经节点的顺序，看能否计算出完整路径。如果仍然计算不出完整路径，则重新选择首尾点。
该算法的缺点是计算的次数多，速度慢。节点越多，则计算的次数越多， 如果有N个点，则需要计算N-1个分段。另一个缺点是计算出的路径不一定逼近最优路径，毕竟选择首尾节点，必经节点以及节点间的顺序不一定是最优的。例如A、D、K、Z四点之间的链路可以是A-D-K-Z，也可以是A-K-D-Z。如果选择的必经节点的顺序是D、K，则前者先拼接出来，输出的路径计算结果就是A-D-K-Z，即使前者的代价比后者大。
因此，针对相关技术中，计算以太网路径的实现方法繁琐且不考虑路径代价的问题，还没有一种比较好的解决方案。
发明内容
本公开提供了一种以太网路径的获取方法及装置，以至少解决相关技术中，计算以太网路径的实现方法繁琐且不考虑路径代价的问题。
根据本公开的一个实施例，提供了一种以太网路径的获取方法，包括：从最短路径集合中确定一条目标路径；判断所述目标路径是否经过电层转发域E-FD中所有的节点；在判断结果为否的情况下，将所述目标路径的尾节点作为新的首节点，并利用所述目标路径更新所述最短路径集合，直至新的目标路径经过所述E-FD中的所有节点，将所述目标路径经过所述E-FD中的所有节点的路径作为最终确定的以太网路径；其中，所述目标路径为未进行过拼接，且经过所述E-FD中节点的目标路径。
可选地，在所述最短路径集合中存在多条节点数目相同的路径时，确定一条代价最低的路径作为所述目标路径，其中，所述代价用于指示所述节点之间的距离或者所述节点之间的传输时延。
可选地，利用所述目标路径更新所述最短路径集合，直至所述目标路径经过所述E-FD中的所有节点，还包括，将所述目标路径与更新后的所述最短路径集合中一条未进行过拼接，且经过电层转发域E-FD中节点最多的路径进行拼接，形成新的目标路径。
可选地，根据权利要求1所述的方法，其特征在于，所述方法还包括，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合。
可选地，利用所述Dijkstra算法更新所述最短路径集合，还包括：所述目标路径中首节点以外的节点不能更新所述最短路径集合。
可选地，在所述最短路径集合不为空集的情况下，从所述最短路径集合中确定一条未进行过拼接，且经过所述节点最多的目标路径，还包括：将首节点和最短路径集合存储在首节点路径集合当中。
可选地，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合，包括：如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中存在未进行过拼接的路径时，则使用所述首节点路径集合中的最短路径集合，并将所述最短路径集合中的目标路径置为空。
可选地，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合，还包括：如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中不存在未进行过拼接的路径时，将所述首节点路径集合置为空集，并再次判断所述最短路径集合以及所述首节点路径集合。
可选地，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合，还包括：如果所述最短路径集合为空集，所述首节点路径集合为空集时，更换所述首节点，将所述目标路径置为无效路径；再次利用所述Dijkstra算法获取所述最短路径集合。
可选地，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合，还包括：如果所述最短路径集合为空集，所述首节点路径集合为空集，且没有可以更换的首节点时，返回失败信息。
可选地，在从最短路径集合中确定一条未进行过拼接，且经过电层转发域E-FD中节点最多的目标路径之前，所述方法还包括：根据以太网用户网络间接口UNI，确定多个以太网网络间接口NNI；根据所述以太网NNI；确定在所述E-FD中对应的电层用户网络间接口UNI；连接所述以太网NNI与所述以太网UNI，形成以太网层路径。
可选地，在判断结果为是的情况下，连接所述节点对应的电层UNI和所述目标路径中的接口，形成电层路径；利用所述以太网层路径以及所述电层路径生成以太网路径。
本公开提供了一种以太网路径的获取装置，包括：第一确定模块，设置为：从最短路径集合中确定一条目标路径；判断模块，设置为：判断所述目标路径 是否经过所述E-FD中所有的节点；处理模块，设置为：在判断结果为否的情况下，将所述目标路径的尾节点作为新的首节点，并利用所述目标路径更新所述最短路径集合，直至新的目标路径经过所述E-FD中的所有节点，将所述目标路径经过所述E-FD中的所有节点的路径作为最终确定的以太网路径；其中，所述目标路径为未进行过拼接，且经过所述E-FD中节点的目标路径。
可选地，所述装置还包括，生成模块，设置为：利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合。
可选地，所述处理模块包括，拼接单元，设置为：将所述目标路径与更新后的所述最短路径集合中一条未进行过拼接，且经过电层转发域E-FD中节点最多的路径进行拼接，形成新的目标路径。
可选地，所述处理模块包括，存储单元，设置为：将首节点和最短路径集合存储在首节点路径集合当中。
可选地，所述生成模块包括，第一处理单元，设置为：在如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中存在未进行过拼接的路径的情况下，则使用所述首节点路径集合中的最短路径集合，并将所述最短路径集合中的目标路径置为空。
可选地，所述生成模块还包括，第二处理单元，设置为：在如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中不存在未进行过拼接的路径的情况下，将所述首节点路径集合置为空集，并再次判断所述最短路径集合以及所述首节点路径集合。
可选地，所述生成模块还包括，第三处理单元，设置为：在如果所述最短路径集合为空集，所述首节点路径集合为空集的情况下，更换所述首节点，将所述目标路径置为无效路径，并再次利用所述Dijkstra算法获取所述最短路径集合。
可选地，所述生成模块还包括，第四处理单元，设置为：在如果所述最短路径集合为空集，所述首节点路径集合为空集，且没有可以更换的首节点的情况下，返回失败信息。
可选地，所述装置还包括，第二确定模块，设置为：根据以太网用户网络间接口UNI，确定多个以太网网络间接口NNI；第三确定模块，设置为：根据所述以太网NNI；确定在所述E-FD中对应的电层用户网络间接口UNI；第一连 接模块，设置为：连接所述以太网NNI与所述以太网UNI，形成以太网层路径。
可选地，所述装置还包括，第二连接模块，设置为：在判断结果为是的情况下，连接所述节点对应的电层UNI和所述目标路径中的接口，形成电层路径；以太网路径生成模块，设置为：利用所述以太网层路径以及所述电层路径生成以太网路径。
本公开还提供了一种存储介质。该存储介质设置为存储用于执行以下步骤的程序代码：
S11，从最短路径集合中确定一条目标路径；
S12，判断所述目标路径是否经过所述E-FD中所有的节点；
S13，在判断结果为否的情况下，将所述目标路径的尾节点作为新的首节点，并利用所述目标路径更新所述最短路径集合，直至新的目标路径经过所述E-FD中的所有节点，将所述目标路径经过所述E-FD中的所有节点的路径作为最终确定的以太网路径；
其中，所述目标路径为未进行过拼接，且经过所述E-FD中节点的目标路径。
可选地，存储介质还设置为存储用于执行以下步骤的程序代码：
S21，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合。
可选地，存储介质还设置为存储用于执行以下步骤的程序代码：
S31，根据以太网用户网络间接口UNI，确定多个以太网网络间接口NNI；
S32，根据所述以太网NNI；确定在所述E-FD中对应的电层用户网络间接口UNI；
S33，连接所述以太网NNI与所述以太网UNI，形成以太网层路径。
可选地，存储介质还设置为存储用于执行以下步骤的程序代码：
S41，在判断结果为是的情况下，连接所述节点对应的电层UNI和所述目标路径中的接口，形成电层路径；
S42，利用所述以太网层路径以及所述电层路径生成以太网路径。
本实施例还提供一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行上述以太网路径的获取方法。
本实施例还提供了一种计算机程序产品，所述计算机程序产品包括存储在非暂态计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令， 当所述程序指令被计算机执行时，使所述计算机执行上述任意一种以太网路径的获取方法。
本公开由于循环更新并利用最短路径集合确定一条经过E-FD中所有节点的路径。因此，可以解决相关技术中计算以太网路径的实现方法繁琐且不考虑路径代价的问题，从而达到简化以太网路径的计算以及减少路径的代价的效果。
附图说明
图1是相关技术中以太网网络的拓扑图；
图2是本实施例的一种以太网路径的获取方法的计算机终端的硬件结构框图；
图3是本实施例的一种以太网路径的获取方法的流程图；
图4是本实施例的一种以太网网络的拓扑图；
图5是本实施例的另一种以太网路径的获取方法的流程图；
图6是本实施例的另一种以太网路径的获取方法的流程图；
图7是本实施例的场景流程图；
图8是本实施例的又一种以太网网络的拓扑图；
图9是本实施例的再一种以太网网络的拓扑图；
图10是本实施例的一种以太网路径的获取装置的结构图；
图11是本实施例的另一种以太网路径的获取装置的结构图；
图12是本实施例的又一种以太网路径的获取装置的结构图；
图13是本实施例的再一种以太网路径的获取装置的结构图；
图14是本实施例的还一种以太网路径的获取装置的结构图；
图15是本实施例的又一种以太网路径的获取装置的结构图；
图16是本实施例的又一种以太网路径的获取装置的结构图。
具体实施方式
下文中将参考附图并结合实施例来说明本公开。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、 “第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
实施例1
本实施例一所提供的方法实施例可以在移动终端、计算机终端或者类似的运算装置中执行。以运行在计算机终端上为例，图2是本实施例的一种以太网路径的获取方法的计算机终端的硬件结构框图。如图2所示，计算机终端20可以包括一个或多个(图中仅示出一个)处理器202(处理器202可以包括但不限于微处理器MCU或可编程逻辑器件FPGA等的处理装置)、用于存储数据的存储器204、以及用于通信功能的传输装置206。本领域普通技术人员可以理解，图2所示的结构仅为示意，其并不对上述电子装置的结构造成限定。例如，计算机终端20还可包括比图2中所示更多或者更少的组件，或者具有与图2所示不同的配置。
存储器204可用于存储应用软件的软件程序以及模块，如本实施例中的以太网路径的获取方法对应的程序指令/模块，处理器202通过运行存储在存储器204内的软件程序以及模块，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器204可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器204可包括相对于处理器202远程设置的存储器，这些远程存储器可以通过网络连接至计算机终端20。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
传输装置206用于经过一个网络接收或者发送数据。上述的网络具体实例可包括计算机终端20的通信供应商提供的无线网络。在一个实例中，传输装置206包括一个网络适配器(Network Interface Controller，NIC)，可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实例中，传输装置206可以为射频(Radio Frequency，RF)模块，用于通过无线方式与互联网进行通讯。
在本实施例中提供了一种运行于上述计算机终端的以太网路径的获取方法，图3是本实施例的一种以太网路径的获取方法的流程图，如图3所示，该流程包括如下步骤。
在步骤S302中，从最短路径集合中确定一条目标路径。
在步骤S304中，判断所述目标路径是否经过E-FD中所有的节点。
可选地，经过所述E-FD中所有的节点可以是指E-FD中所有与以太网层相连的节点。如图1所示，E-FD中与以太网层相连的节点包括FD-1，FD-2，FD-3， 以及FD-4。而FD-5则不属于E-FD中与以太网层相连的节点。
需要指出的是，经过所述E-FD中所有的节点只是一种可选的实施方式，当然，可以根据用户自身需要，设定E-FD中必须经过的所有节点。例如，如图1所示，如果需要一条经过FD-1，FD-3，FD-4的路径时，那么目标路径至少需要经过FD-1，FD-3，FD-4。当然，该目标路径当中也可以包括FD-2。
在步骤S306中，在判断结果为否的情况下，将所述目标路径的尾节点作为新的首节点，并利用所述目标路径更新所述最短路径集合，直至新的目标路径经过所述E-FD中的所有节点，将所述目标路径经过所述E-FD中的所有节点的路径作为最终确定的以太网路径。
可选地，在所述最短路径集合中存在多条节点数目相同的路径时，确定一条代价最低的路径作为所述目标路径，其中，所述代价用于指示所述节点之间的距离或者所述节点之间的传输时延。
例如，如图1所示，如果最短路径集合中存在两条相同的路径，FD-1-FD-2-FD-4以及FD-1-FD-5-FD-2。由于FD-1-FD-2-FD-4的代价为1000+300＝1300，而FD-1-FD-5-FD-2的代价为400+500＝900。因此，由于FD-1-FD-5-FD-2的代价比FD-1-FD-2-FD-4低。因此，目标路径为FD-1-FD-5-FD-2。需要指出的是，如果两条相同的路径为FD-1-FD-2-FD-4以及FD-1-FD-5-FD-4，虽然二者代价相同，均为1300，但考虑到FD-5中UUI接口的数目大于FD-2，有利于后续路径之间的拼接，因此，目标路径为FD-1-FD-2-FD-4。
可选地，利用所述目标路径更新所述最短路径集合，直至所述目标路径经过所述E-FD中的所有节点中可以将所述目标路径与更新后的所述最短路径集合中一条未进行过拼接，且经过电层转发域E-FD中节点最多的路径进行拼接，形成新的目标路径。
例如，如图1所示，如果在更新前确定的目标路径为FD-1-FD-2-FD-4。而在更新后的最短路径集合为{FD-1-FD-5，FD-3}。由于FD-1-FD-5并没有被拼接过，且为该更新后的最短路径集合中经过节点最多的路径。因此，FD-1-FD-2-FD-4与FD-1-FD-5可以进行拼接，形成FD-1-FD-2-FD-4-FD-5。该路径为新的目标路径。
可选地，上述最短路径通过利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点进行计算。
需要指出的是，由于Dijkstra算法包括生成一颗从首节点到所有尾节点的最短路径树。相比于相关技术中通过穷举路径首尾节点的算法的方法而言，能够大大的减少计算量。
可选地，在利用目标路径更新最短路径集合时，所述目标路径中的节点不具备更新所述最短路径集合的能力。
例如，如图1所示，目标路径为FD-4-FD-2-FD-1，那么在更新最短路径集合时，已经使用过的FD-2，FD-1节点则不能够出现在更新后的最短路径集合中，因此，更新后的最短路径集合为{FD-4-FD-1}。需要指出的是，首节点是需要出现在更新后的最短路径集合中的。
可选地，在确定目标路径时，如果最短路径集合不为空集，将{首节点，最短路径集合}存储在首节点路径集合当中。
在首次确定最短路径集合中，由于所有节点都能够出现在更新后的最短路径集合，因此在初始生成最短路径集合中，该最短路径集合总不为空集。然而随着最短路径集合的更新，能够用于确定最短路径集合的节点越来越少，因此，很可能会使得最短路径集合出现空集的情况。
而在最短路径集合出现空集时，可能会产生已经四种情况：
1.所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中存在未进行过拼接的路径。
使用所述首节点路径集合中的最短路径集合，并将所述最短路径集合中的目标路径置为空。
例如，如图1所示，如果目标路径为FD-4-FD-5-FD-1-FD-3，而首节点路径为{FD-1，FD-4-FD-5-FD-1-FD-3，FD-4-FD-2}。由于更新最短路径集合时需要避开FD-2，FD-3，FD-4以及FD-5。因此，更新后的最短路径集合为空集。此时，由于在首节点路径中的最短路径集合中的FD-4-FD-2没有进行过拼接，因此，将首节点中的{FD-4-FD-5-FD-1-FD-3，FD-4-FD-2}作为最短路径集合，同时将FD-4-FD-5-FD-1-FD-3置位空，即最短路径集合为{FD-4-FD-2}。
2.所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中不存在未进行过拼接的路径。
将所述首节点路径集合置为空集，并再次判断所述最短路径集合以及所述首节点路径集合。
例如，如图1所示，如果目标路径为FD-1-FD-2-FD-5-FD-4，而首节点 路径为{FD-1，FD-1-FD-2-FD-5-FD-4，FD-1-FD-3}。FD-3尝试与FD-4进行连接后失败，路径FD-1-FD-3与FD-1-FD-2-FD-5-FD-4无法拼接。因此，首路径集合中不存在未进行过拼接的路径。此时，首节点路径将{FD-1，FD-1-FD-2-FD-5-FD-4，FD-1-FD-3}置空，然后再次判断最短路径集合为空集是否为空集，首节点路径集合是否为空集。
3.最短路径集合为空集，首节点路径集合为空集。
更换首节点，将目标路径置为无效路径；并再次利用Dijkstra算法获取所述最短路径集合。
例如，如图1所示，基于第2点中的举例，即在首节点路径将{FD-1，FD-1-FD-2-FD-5-FD-4，FD-1-FD-3}置空，然后再次判断最短路径集合为空集是否为空集，首节点路径集合是否为空集后，再次判断的结果为最短路径集合为空集，同时首节点路径集合为空集。则说明当前首节点FD-1并不能够产生一条经过E-FD中所有的节点的路径，因此，当前的目标路径和首节点FD-1无效，因此需要抛弃该目标路径并将该目标路径置为无效路径，同时从E-FD中的其他节点当中，选择一个作为新的节点(例如FD-2)。
4.最短路径集合为空集，首节点路径集合为空集，且没有可以更换的首节点。
返回失败信息。
例如，图4是本实施例的一种以太网网络的拓扑图。如图3所示，图4中任意选取首节点均不能够用于形成一条经过E-FD中所有节点的路径，此时，位于SD-OTN中的网络侧设备会向用户侧设备反馈失败信息，用于反馈当前E-FD中的节点无法实现业务数据的传输。
其中，所述目标路径为未进行过拼接，且经过所述E-FD中节点的目标路径。
需要指出的是，拼接的含义为，一条路径的首节点与另一条路径的首节点或者尾节点连接。例如：如图1所示，最短路径集合存在{FD-1-FD-5-FD-4，FD-1-FD-2，FD-1-FD-3}。如果FD-4能够与FD-2相连接，因此FD-1-FD-5-FD-4能够与FD-1-FD-2进行拼接。而如果FD-4不能够与FD-3相连接，因此FD-1-FD-5-FD-4不能够与FD-1-FD-3进行拼接。
图5是本实施例的另一种以太网路径的获取方法的流程图。如图5所示，除图3中所示全部步骤之外，所述方法还包括：
在步骤S502中，根据以太网用户网络间接口UNI，确定多个以太网网络间接口NNI。
在步骤S504中，根据所述以太网NNI，确定在所述E-FD中对应的电层用户网络间接口UNI。
在步骤S506中，连接所述以太网NNI与所述以太网UNI，形成以太网层路径。
例如，如图1所示，以太网转发域(Ethernet Forward Domain，简称ETH-FD)中节点FD-A上存在网络间接口FD-A-1。根据该接口FD-A-1，在节点FD-A上确定了2个以太网网络间接口LTP-A-11以及LTP-A-12。根据LTP-A-11以及LTP-A-12，在对应的E-FD上确定节点FD-1中电层用户网络间接口LTP1-1。由于假设FD-A对应着的FD-1是首节点，而FD-C对应着的FD-2是尾节点，因此，FD-A形成的以太网层路径为LTP-A-1-LTP-A-11，而FD-C形成的以太网路径为LTP-C-1-LTP-C-11。对于分别对应着中间节点FD-2和FD-4的FD-B和FD-D，形成的以太网层路径为LTP-B-1-LTP-B-11-LTP-B-12和LTP-D-1-LTP-D-11-LTP-D-12
图6是本实施例的另一种以太网路径的获取方法的流程图。如图6所示，除图5中所示全部步骤之外，所述方法还包括：
在步骤S602中，在判断结果为是的情况下，连接所述节点对应的电层UNI和所述目标路径中的接口，形成电层路径。
电层UNI与目标路径中每个节点的UUI接口相连接。
在步骤S604中，利用所述以太网层路径以及所述电层路径生成以太网路径。
例如，如图1所示，如果在FD-1-FD-5-FD-2-FD-4-FD-3是经过E-FD中所有节点的目标路径，将FD-1至FD-5中的电层UNI与目标路径中的接口LTP-1-3-LTP-5-1-LTP-5-2-LTP-2-3-LTP-2-4-LTP-4-2-LTP-LTP-4-4-LTP-3-2相连接，形成了一条经过LTP 1-1-LTP-1-3-LTP-5-1-LTP-5-2-LTP-2-3-LTP-2-4-LTP-4-2-LTP-4-4-LTP-3-2-LTP3-1的电层路径。而后将电层路径LTP 1-1-LTP-1-3-LTP-5-1-LTP-5-2-LTP-2-3-LTP-2-4-LTP-4-2-LTP-4-4-LTP-3-2-LTP3-1以及以太网层路径LTP-A-1-LTP-A-11-LTP-B-1-LTP-B-11-LTP-B-12-LTP-C-1-LTP-C-11-LTP-D-1-LTP-D-11-LTP-D-12作为最终的以太网路径。
此外，在本实施例中，还提供了以下场景，以便于更好地理解本实施例。图7是本实施例的场景流程图。以下场景均适用与图7中所示的步骤。
场景1
如图1和图7所示所示，以太网业务从4个以太网层的逻辑终端点LTP-A-1，LTP-B-1，LTP-C-1，LTP-D-1接入，需要计算一条路径将4个以太网接入LTP连接起来。
S1：解析以太网请求，以太网UNI接口是LTP-A-1，LTP-B-1，LTP-C-1，LTP-D-1。
S2：在以太网UNI接口所在的节点(FD-A，FD-B，FD-C，FD-D)中，找到可用的以太网NNI接口，分别是：FD-A-11，FD-A-12，FD-B-11，FD-B-12，FD-C-11，FD-C-12，FD-D-11，FD-D-12。
S3：以太网NNI口对应的LTP是LTP-1-1，LTP-2-1，LTP-3-1，LTP-4-1。
S4：创建电层路径计算请求，计算一条经过FD-1，FD-2，FD-3，FD-4的电层路径。S4包括：
S41：首节点集合初始化为{FD-1，FD-2，FD-3，FD-4}。目标路径初始为空。首节点路径集合初始为空。从首节点集合中取出一个节点FD-1作为首节点，首节点集合变为{FD-2，FD-3，FD-4}。
S42：调用Dijkstra最短路径算法计算从首节点到不在目标路径上的必经节点的最短路径，形成一个最短路径集合：{FD-1-FD-5-FD-2-FD-4，FD-1-FD-3}。
S43：最短路径集合不空，将对象{FD-1，{FD-1-FD-5-FD-2-FD-4，FD-1-FD-3}}加入到首节点路径集合中。
S44：从最短路径集合中找出一条经过必经节点最多的路径FD-1-FD-5-FD-2-FD-4。旧目标路径为空，目标路径变为FD-1-FD-5-FD-2-FD-4。
S45：目标路径中没有包含必经节点FD-3，说明完整路径还没有计算出来，则将FD-1-FD-5-FD-2-FD-4的尾节点FD-4作为新的首节点，转至S42。
S42：调用Dijkstra最短路径算法计算从首节点FD-4到不在目标路径上的必经节点的最短路径，需要避开节点{FD-1，FD-5，FD-2}，形成一个最短路径集合：{FD-4-FD-3}。
S43：将对象{FD-4，{FD-4-FD-3}}加入到首节点路径集合中。
S44：从最短路径集合中找出一条经过必经节点最多的路径FD-4-FD-3。和目标路径FD-1-FD-5-FD-2-FD-4进行拼接，新的目标路径为FD-1-FD-5-FD-2-FD-4-FD-3。
S45：目标路径中包含了所有的必经节点，说明完整路径已经计算出来，转 至S46。
S46：将电层UNI口和目标路径经过的接口组成一个LTP序列，构成电层路径：LTP-1-1-LTP-1-3-LTP-5-1-LTP-5-2-LTP-2-3-LTP-2-1-LTP-2-4-LTP-4-2-LTP-4-1-LTP-4-4-LTP-3-2-LTP-3-1。
S5：将以太网UNI口，NNI口组成一个LTP序列，构成以太网层的路径：LTP-A-1-LTP-A-11-LTP-B-1-LTP-B-11-LTP-B-12-LTP-D-1，LTP-D-11-LTP-D-12-LTP-C-1-LTP-C-11。
S6：将以太网层路径，电层路径作为算路结果返回。
场景2
图8是本实施例的又一种以太网网络的拓扑图，如图7和图8所示，以太网业务从4个以太网层的逻辑终端点LTP-A-1，LTP-B-1，LTP-C-1，LTP-D-1接入，需要计算一条路径将4个以太网接入LTP连接起来。
S1：解析以太网请求，以太网UNI接口是LTP-A-1，LTP-B-1，LTP-C-1，LTP-D-1。
S2：在以太网UNI接口所在的低层FD(FD-A，FD-B，FD-C，FD-D)中，找到可用的以太网NNI接口，分别是：FD-A-11，FD-A-12，FD-B-11，FD-B-12，FD-C-11，FD-C-12，FD-D-11，FD-D-12。
S3：以太网NNI口对应的电层逻辑终端点是LTP-1-1，LTP-2-1，LTP-3-1，LTP-4-1。
S4：创建电层路径计算请求，计算一条经过FD-1，FD-2，FD-3，FD-4的电层路径。S4还包括以下步骤：
S41：未尝试过的首节点集合初始化为{FD-1，FD-2，FD-3，FD-4}。目标路径初始为空。首节点路径集合初始为空。从首节点集合中取出一个节点FD-1作为首节点，首节点集合变为{FD-2，FD-3，FD-4}。
S42：调用Dijkstra最短路径算法计算从首节点到不在目标路径上的必经节点的最短路径，形成一个最短路径集合：{FD-1-FD-5-FD-2-FD-4，FD-1-FD-3}。
S43：最短路径集合不空，将对象{FD-1，{FD-1-FD-5-FD-2-FD-4，FD-1-FD-3}}加入到首节点路径集合中。
S44：从最短路径集合中找出一条经过必经节点最多的路径FD-1-FD-5- FD-2-FD-4。旧目标路径为空，目标路径变为FD-1-FD-5-FD-2-FD-4。
S45：目标路径中没有包含必经节点FD-3，说明完整路径还没有计算出来，则将FD-1-FD-5-FD-2-FD-4的尾节点FD-4作为新的首节点，转S42。
S42：调用Dijkstra最短路径算法计算从首节点FD-4到不在目标路径上的必经节点的最短路径，需要避开节点{FD-1，FD-5，FD-2}。由于没有FD-4到FD-3的路径，所以形成的最短路径集合为空。
S42-1：最短路径集合为空，且首节点路径集合不为空，且首节点路径集合中的首节点对应的最短路径集合中有最短路径FD-1-FD-3没有尝试过拼接，则置最短路径集合为首节点路径集合中的首节点对应的最短路径集合，即{FD-1-FD-5-FD-2-FD-4，FD-1-FD-3}。目标路径(FD-1-FD-5-FD-2-FD-4)需要缩短至首节点路径集合中的首节点对应的最短路径集合中的首节点FD-1，即目标路径又变为空。转步骤S44。
S44：从最短路径集合中找出一条未尝试过拼接，且经过必经节点最多的路径FD-1首节点FD-3。旧目标路径为空，目标路径变为FD-1首节点FD-3。
S45：目标路径中没有包含所有的必经节点，说明完整路径还没有计算出来，则将FD-1-FD-3的尾节点FD-3作为新的首节点，转至S42。
S42：调用Dijkstra最短路径算法计算从首节点FD-3到不在目标路径上的必经节点的最短路径，需要避开节点{FD-1}，形成的最短路径集合为{FD-3-FD-5-FD-2-FD-4}。
S43：将对象{FD-3，{FD-3-FD-5-FD-2-FD-4}}加入到首节点路径集合中。
S44：从最短路径集合中找出一条经过必经节点最多的路径FD-3-FD-5-FD-2-FD-4。和目标路径FD-1-FD-3进行拼接，新的目标路径为FD-1-FD-3-FD-5-FD-2-FD-4。
S45：目标路径中包含了所有的必经节点，说明完整路径已经计算出来。
S46：将电层UNI口和目标路径经过的接口组成一个LTP序列，构成电层路径：LTP-1-1-LTP-1-4-LTP-3-4-LTP-3-1-LTP-3-3-LTP-5-4-LTP-5-2-LTP-2-3-LTP-2-1-LTP-2-4-LTP-4--LTP-4-1。
S5：将以太网UNI口，NNI口组成一个LTP序列，构成以太网层的路径：LTP-A-1-LTP-A-11-LTP-C-1-LTP-C-12-LTP-C-11-LTP-B-1-LTP-B-11-LTP-B-12-LTP-D-1-LTP-D-11。
S6：将以太网层路径，电层路径作为算路结果返回。
场景3
图9是本实施例的再一种以太网网络的拓扑图，如图7和图9所示，以太网业务从4个以太网层的逻辑终端点LTP-A-1，LTP-B-1，LTP-C-1，LTP-D-1接入，需要计算-条路径将4个以太网接入LTP连接起来。
S1：解析以太网请求，以太网UNI接口是LTP-A-1，LTP-B-1，LTP-C-1，LTP-D-1。
S2：在以太网UNI接口所在的低层FD(FD-A，FD-B，FD-C，FD-D)中，找到可用的以太网NNI接口，分别是：FD-A-11，FD-A-12，FD-B-11，FD-B-12，FD-C-11，FD-C-12，FD-D-11，FD-D-12。
S3：以太网NNI口对应的电层逻辑终端点是LTP-1-1，LTP-2-1，LTP-3-1，LTP-4-1。
S4：创建电层路径计算请求，计算-条经过FD-1，FD-2，FD-3，FD-4的电层路径。S4还包括以下步骤：
S41：未尝试过的首节点集合初始化为{FD-1，FD-2，FD-3，FD-4}。目标路径初始为空。首节点路径集合初始为空。从首节点集合中取出一个节点FD-1作为首节点，首节点集合变为{FD-2，FD-3，FD-4}。
S42：调用Dijkstra最短路径算法计算从首节点到不在目标路径上的必经节点的最短路径，形成一个最短路径集合：{FD-1-FD-5-FD-2-FD-4，FD-1-FD-3}。
S43：最短路径集合不空，将对象{FD-1，{FD-1-FD-5-FD-2-FD-4，FD-1-FD-3}}加入到首节点路径集合中。
S44：从最短路径集合中找出一条经过必经节点最多的路径FD-1-FD-5-FD-2-FD-4。旧目标路径为空，目标路径变为FD-1-FD-5-FD-2-FD-4。
S45：目标路径中没有包含必经节点FD-3，说明完整路径还没有计算出来，则将FD-1-FD-5-FD-2-FD-4的尾节点FD-4作为新的首节点，转至S42。
S42：调用Dijkstra最短路径算法计算从首节点FD-4到不在目标路径上的必经节点的最短路径，需要避开节点{FD-1，FD-5，FD-2}。由于没有FD-4到FD-3的路径，所以形成的最短路径集合为空。
S42-1：最短路径集合为空，且首节点路径集合不为空，且首节点路径集合 中的首节点对应的最短路径集合中有最短路径FD-1-FD-3没有尝试过拼接，则置最短路径集合为首节点路径集合中的首节点对应的最短路径集合，即{FD-1-FD-5-FD-2-FD-4，FD-1-FD-3}。目标路径(FD-1-FD-5-FD-2-FD-4)需要缩短至首节点路径集合中的首节点对应的最短路径集合中的首节点FD-1，即目标路径又变为空。转至S44。
S44：从最短路径集合中找出一条未尝试过拼接，且经过必经节点最多的路径FD-1-FD-3。旧目标路径为空，目标路径变为FD-1-FD-3。
S45：目标路径中没有包含所有的必经节点，说明完整路径还没有计算出来，则将FD-1-FD-3的尾节点FD-3作为新的首节点，转至S42。
S42：调用Dijkstra最短路径算法计算从首节点FD-3到不在目标路径上的必经节点的最短路径，需要避开节点{FD-1}，形成的最短路径集合为空。
S42-2：因为最短路径集合为空，且首节点路径集合不为空，且首节点路径集合中的首节点对应的最短路径集合中的最短路径都尝试过拼接，则将首节点路径集合置为空集，首节点路径集合同样置为空集，转至S42-1重新判断。
S42-3：如果最短路径集合为空，且首节点路径集合为空，且首节点集合不空，则从首节点集合中取出一个节点FD-2作为首节点，目标路径初始为空。转至S42。
S42：调用Dijkstra最短路径算法计算从首节点到不在目标路径上的必经节点的最短路径，形成一个最短路径集合：{FD-2-FD-5-FD-1-FD-3，FD-2-FD-4}。
S43：最短路径集合不空，将对象{FD-1，{FD-2-FD-5-FD-1-FD-3，FD-2-FD-4}}加入到首节点路径集合中。
S44：从最短路径集合中找出一条经过必经节点最多的路径FD-2-FD-5-FD-1-FD-3。旧目标路径为空，目标路径变为FD-2-FD-5-FD-1-FD-3。
S45：目标路径中没有包含必经节点FD-4，说明完整路径还没有计算出来，则将FD-2-FD-5-FD-1-FD-3的尾节点FD-3作为新的首节点，转至S42。
S42：调用Dijkstra最短路径算法计算从首节点FD-3到不在目标路径上的必经节点的最短路径，需要避开节点{FD-2，FD-5，FD-1}。由于没有FD-3到FD-4的路径，所以形成的最短路径集合为空。
S42-1：最短路径集合为空，且首节点路径集合不为空，且首节点路径集合中的首节点对应的最短路径集合中有最短路径FD-2-FD-4没有尝试过拼接，则 置最短路径集合为首节点路径集合中的首节点对应的最短路径集合，即{FD-2-FD-5-FD-1-FD-3，FD-2-FD-4}。目标路径(FD-2-FD-5-FD-1-FD-3)需要缩短至首节点路径集合中的首节点对应的最短路径集合中的首节点FD-2，即目标路径又变为空。转至S44。
S44：从最短路径集合中找出一条未尝试过拼接，且经过必经节点最多的路径FD-2-FD-4。此时，旧目标路径为空，目标路径变为FD-2-FD-4。
S45：目标路径中没有包含所有的必经节点，说明完整路径还没有计算出来，则将FD-2-FD-4的尾节点FD-4作为新的首节点，转至S42。
S42：调用Dijkstra最短路径算法计算从首节点FD-4到不在目标路径上的必经节点的最短路径，需要避开节点{FD-2}，形成的最短路径集合为{FD-4-FD-5-FD-1-FD-3}。
S43：将对象{FD-4，{FD-4-FD-5-FD-1-FD-3}}加入到首节点路径集合中。
S44：从最短路径集合中找出一条经过必经节点最多的路径FD-4-FD-5-FD-1-FD-3。和旧目标路径FD-2-FD-4进行拼接，新的目标路径为FD-2-FD-4-FD-5-FD-1-FD-3。
S45：目标路径中包含了所有的必经节点，说明完整路径已经计算出来。
S46：将电层UNI口和目标路径经过的接口组成一个LTP序列，构成电层路径：LTP-2-1-LTP-2-4-LTP-4-2-LTP-4-1-LTP-4-3-LTP-5-3-LTP-5-1-LTP-1-3-LTP-1-1-LTP-1-4-LTP-3-4-LTP-3-1。
S5：将以太网UNI口，NNI口组成一个LTP序列，构成以太网层的路径：LTP-B-1-LTP-B-12-LTP-D-1-LTP-D-11-LTP-D-12-LTP-A-1-LTP-A-11-LTP-A-12-LTP-C-1-LTP-C-12。
S6：将以太网层路径，电层路径作为算路结果返回。
通过上述步骤，解决了相关技术中计算以太网路径的实现方法繁琐且不考虑路径代价的问题，从而达到简化以太网路径的计算以及减少路径的代价的效果。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件。本实施例对相关技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中， 包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开各个实施例所述的方法。
实施例2
在本实施例中还提供了一种以太网路径的获取装置，该装置用于实现上述实施例。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。
图10是本实施例的一种以太网路径的获取装置的结构图，如图10所示，该装置包括第一确定模块1002，判断模块1004以及处理模块1006。
第一确定模块1002，设置为：从最短路径集合中确定一条目标路径；
判断模块1004，设置为：判断所述目标路径是否经过所述E-FD中所有的节点；
可选地，经过所述E-FD中所有的节点可以是指E-FD中所有与以太网层相连的节点。如图1所示，E-FD中与以太网层相连的节点包括FD-1，FD-2，FD-3，以及FD-4。而FD-5则不属于E-FD中与以太网层相连的节点。
处理模块1006，设置为：在判断结果为否的情况下，将所述目标路径的尾节点作为新的首节点，并利用所述目标路径更新所述最短路径集合，直至新的目标路径经过所述E-FD中的所有节点，将所述目标路径经过所述E-FD中的所有节点的路径作为最终确定的以太网路径；
可选地，在所述最短路径集合中存在多条节点数目相同的路径时，确定一条代价最低的路径作为所述目标路径，其中，所述代价用于指示所述节点之间的距离或者所述节点之间的传输时延。
可选地，在利用目标路径更新最短路径集合时，所述目标路径中的首节点以外的节点不能更新所述最短路径集合。
其中，所述目标路径为未进行过拼接，且经过所述E-FD中节点的目标路径。
需要指出的是，拼接的含义为，一条路径的首节点与另一条路径的首节点或者尾节点连接。如图1所示，最短路径集合存在{FD-1-FD-5-FD-4，FD-1-FD-2，FD-1-FD-3}。如果FD-4能够与FD-2相连接，因此FD-1-FD-5-FD-4能够与FD-1-FD-2进行拼接。而如果FD-4不能够与FD-3相连接，因此FD-1-FD-5-FD-4不能够与FD-1-FD-3进行拼接。
图11是本实施例的另一种以太网路径的获取装置的结构图，如图11所示，该装置除包括图10所示的所有模块外，还包括：生成模块1102。
生成模块1102，设置为：利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合。
需要指出的是，由于Dijkstra算法包括生成一颗从首节点到所有尾节点的最短路径树。相比于相关技术中通过穷举路径首尾节点的算法的方法而言，能够大大的减少计算量。
图12是本实施例的又一种以太网路径的获取装置的结构图，如图12所示，该装置除包括图10所示的所有模块外，处理模块1006包括：
拼接单元1202，设置为：将所述目标路径与更新后的所述最短路径集合中一条未进行过拼接，且经过电层转发域E-FD中节点最多的路径进行拼接，形成新的目标路径。
图13是本实施例的再一种以太网路径的获取装置的结构图，如图13所示，该装置除包括图11所示的所有模块外，处理模块1006还包括：存储单元1302。
存储单元1302，设置为：将首节点和最短路径集合存储在首节点路径集合当中。
图14是本实施例的还一种以太网路径的获取装置的结构图，如图14所示，该装置除包括图13所示的所有模块外，生成模块1102还包括：
第一处理单元1402，设置为：在如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中存在未进行过拼接的路径的情况下，则使用所述首节点路径集合中的最短路径集合，并将所述最短路径集合中的目标路径置为空。
第二处理单元1404，设置为：在如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中不存在未进行过拼接的路径的情况下，将所述首节点路径集合置为空集，并再次判断所述最短路径集合以及所述首节点路径集合。
第三处理单元1406，设置为：在如果所述最短路径集合为空集，所述首节点路径集合为空集的情况下，更换所述首节点，将所述目标路径置为无效路径，并再次利用所述Dijkstra算法获取所述最短路径集合。
第四处理单元1408，设置为：在如果所述最短路径集合为空集，所述首节点路径集合为空集，且没有可以更换的首节点的情况下，返回失败信息。
图15是本实施例的又一种以太网路径的获取装置的结构图，如图15所示，该装置除包括图10所示的所有模块外，还包括第二确定模块1502，第三确定模 块1504以及第一连接模块1506。
第二确定模块1502，设置为：根据以太网用户网络间接口UNI，确定多个以太网网络间接口NNI；
第三确定模块1504，设置为：根据所述以太网NNI；确定在所述E-FD中对应的电层用户网络间接口UNI；
第一连接模块1506，设置为：连接所述以太网NNI与所述以太网UNI，形成以太网层路径。
图16是本实施例的又一种以太网路径的获取装置的结图，如图16所示，该装置除包括图15所示的所有模块外，还包括：第二连接模块1602以及以太网路径生成模块1604。
第二连接模块1602，设置为：在判断结果为是的情况下，连接所述节点对应的电层UNI和所述目标路径中的接口，形成电层路径；
电层UNI与目标路径中每个节点的UUI接口相连接。
以太网路径生成模块1604，设置为：利用所述以太网层路径以及所述电层路径生成以太网路径。
需要说明的是，上述每个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述每个模块以组合的形式分别位于不同的处理器中。
实施例3
本实施例还提供了一种存储介质。可选地，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的程序代码：
S11，从最短路径集合中确定一条目标路径；
S12，判断所述目标路径是否经过所述E-FD中所有的节点；
S13，在判断结果为否的情况下，将所述目标路径的尾节点作为新的首节点，并利用所述目标路径更新所述最短路径集合，直至新的目标路径经过所述E-FD中的所有节点，将所述目标路径经过所述E-FD中的所有节点的路径作为最终确定的以太网路径；
其中，所述目标路径为未进行过拼接，且经过所述E-FD中节点的目标路径。
可选地，存储介质还设置为存储用于执行以下步骤的程序代码：
S21，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合。
可选地，存储介质还设置为存储用于执行以下步骤的程序代码：
S31，根据以太网用户网络间接口UNI，确定多个以太网网络间接口NNI；
S32，根据所述以太网NNI；确定在所述E-FD中对应的电层用户网络间接口UNI；
S33，连接所述以太网NNI与所述以太网UNI，形成以太网层路径。
可选地，存储介质还设置为存储用于执行以下步骤的程序代码：
S41，在判断结果为是的情况下，连接所述节点对应的电层UNI和所述目标路径中的接口，形成电层路径；
S42，利用所述以太网层路径以及所述电层路径生成以太网路径。
可选地，在本实施例中，上述存储介质可以包括但不限于：U盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。
上述的本实施例的每个模块或每个步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成多个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。
工业实用性
本公开提供一种以太网路径的获取方法及装置，可以解决相关技术中计算以太网路径的实现方法繁琐且不考虑路径代价的问题，从而达到简化以太网路径的计算以及减少路径的代价的效果。

Claims (23)

  1. 一种以太网路径的获取方法，包括：
    从最短路径集合中确定一条目标路径；
    判断所述目标路径是否经过电层转发域E-FD中所有的节点；
    在判断结果为否的情况下，将所述目标路径的尾节点作为新的首节点，并利用所述目标路径更新所述最短路径集合，直至新的目标路径经过所述E-FD中的所有节点，将所述目标路径经过所述E-FD中的所有节点的路径作为最终确定的以太网路径；
    其中，所述目标路径为未进行过拼接，且经过所述E-FD中节点的目标路径。
  2. 根据权利要求1所述的方法，还包括，在所述最短路径集合中存在多条节点数目相同的路径时，确定一条代价最低的路径作为所述目标路径，其中，所述代价用于指示所述节点之间的距离或者所述节点之间的传输时延。
  3. 根据权利要求1所述的方法，利用所述目标路径更新所述最短路径集合，直至所述目标路径经过所述E-FD中的所有节点，还包括，
    将所述目标路径与更新后的所述最短路径集合中一条未进行过拼接，且经过电层转发域E-FD中节点最多的路径进行拼接，形成新的目标路径。
  4. 根据权利要求1所述的方法，所述方法还包括，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合。
  5. 根据权利要求1所述的方法，利用所述目标路径更新所述最短路径集合，还包括：所述目标路径中的首节点以外的节点不能更新所述最短路径集合。
  6. 根据权利要求4所述的方法，在所述最短路径集合不为空集的情况下，从所述最短路径集合中确定一条未进行过拼接，且经过所述节点最多的目标路径，包括：将首节点和最短路径集合存储在首节点路径集合当中。
  7. 根据权利要求6所述的方法，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合，包括：
    如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中存在未进行过拼接的路径时，则使用所述首节点路径集合中的最短路径集合，并将所述最短路径集合中的目标路径置为空。
  8. 根据权利要求6所述的方法，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合，还包括：
    如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中不存在未进行过拼接的路径时，将所述首节点路径集合置为 空集，并再次判断所述最短路径集合以及所述首节点路径集合。
  9. 根据权利要求6所述的方法，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合，还包括：
    如果所述最短路径集合为空集，所述首节点路径集合为空集时，更换所述首节点，并将所述目标路径置为无效路径；
    再次利用所述Dijkstra算法获取所述最短路径集合。
  10. 根据权利要求6所述的方法，利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合，还包括：
    如果所述最短路径集合为空集，所述首节点路径集合为空集，且没有可以更换的首节点时，返回失败信息。
  11. 根据权利要求1所述的方法，在从最短路径集合中确定一条目标路径之前，所述方法还包括：
    根据以太网用户网络间接口UNI，确定多个以太网网络间接口NNI；
    根据所述以太网NNI确定在所述E-FD中对应的电层用户网络间接口UNI；
    连接所述以太网NNI与所述以太网UNI，形成以太网层路径。
  12. 根据权利要求11所述的方法，所述方法还包括：
    在判断结果为是的情况下，连接所述节点对应的电层UNI和所述目标路径中的接口，形成电层路径；
    利用所述以太网层路径以及所述电层路径生成以太网路径。
  13. 一种以太网路径的获取装置，包括：
    第一确定模块，设置为：从最短路径集合中确定一条目标路径；
    判断模块，设置为：判断所述目标路径是否经过所述E-FD中所有的节点；
    处理模块，设置为：在判断结果为否的情况下，将所述目标路径的尾节点作为新的首节点，并利用所述目标路径更新所述最短路径集合，直至新的目标路径经过所述E-FD中的所有节点，将所述目标路径经过所述E-FD中的所有节点的路径作为最终确定的以太网路径；
    其中，所述目标路径为未进行过拼接，且经过所述E-FD中节点的目标路径。
  14. 根据权利要求13所述的装置，所述装置还包括，
    生成模块，设置为：利用单源最短路径Dijkstra算法计算经过所述E-FD中所有节点的所述最短路径集合。
  15. 根据权利要求13所述的装置，所述处理模块包括：
    拼接单元，设置为：将所述目标路径与更新后的所述最短路径集合中一条未进行过拼接，且经过电层转发域E-FD中节点最多的路径进行拼接，形成新的目标路径。
  16. 根据权利要求14所述的装置，所述处理模块包括，
    存储单元，设置为：将首节点和最短路径集合存储在首节点路径集合当中。
  17. 根据权利要求16所述的装置，所述生成模块包括，
    第一处理单元，设置为：在如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中存在未进行过拼接的路径的情况下，则使用所述首节点路径集合中的最短路径集合，并将所述最短路径集合中的目标路径置为空。
  18. 根据权利要求16所述的装置，所述生成模块还包括，
    第二处理单元，设置为：在如果所述最短路径集合为空集，所述首节点路径集合不为空集，并且所述首节点路径集合中不存在未进行过拼接的路径的情况下，将所述首节点路径集合置为空集，并再次判断所述最短路径集合以及所述首节点路径集合。
  19. 根据权利要求16所述的装置，所述生成模块还包括，
    第三处理单元，设置为：在如果所述最短路径集合为空集，所述首节点路径集合为空集的情况下，更换所述首节点，将所述目标路径置为无效路径，并再次利用所述Dijkstra算法获取所述最短路径集合。
  20. 根据权利要求16所述的装置，所述生成模块还包括，
    第四处理单元，设置为：在如果所述最短路径集合为空集，所述首节点路径集合为空集，且没有可以更换的首节点的情况下，返回失败信息。
  21. 根据权利要求13所述的装置，所述装置还包括，
    第二确定模块，设置为：根据以太网用户网络间接口UNI，确定多个以太网网络间接口NNI；
    第三确定模块，设置为：根据所述以太网NNI；确定在所述E-FD中对应的电层用户网络间接口UNI；
    第一连接模块，设置为：连接所述以太网NNI与所述以太网UNI，形成以太网层路径。
  22. 根据权利要求21所述的装置，所述装置还包括，
    第二连接模块，设置为：在判断结果为是的情况下，连接所述节点对应的 电层UNI和所述目标路径中的接口，形成电层路径；
    以太网路径生成模块，设置为：利用所述以太网层路径以及所述电层路径生成以太网路径。
  23. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行权利要求1-12任一项的方法。
PCT/CN2017/091029 2016-06-30 2017-06-30 以太网路径的获取方法及装置 WO2018001351A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610505106.6A CN107566268B (zh) 2016-06-30 2016-06-30 以太网路径的获取方法及装置
CN201610505106.6 2016-06-30

Publications (1)

Publication Number Publication Date
WO2018001351A1 true WO2018001351A1 (zh) 2018-01-04

Family

ID=60786524

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/091029 WO2018001351A1 (zh) 2016-06-30 2017-06-30 以太网路径的获取方法及装置

Country Status (2)

Country Link
CN (1) CN107566268B (zh)
WO (1) WO2018001351A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111754043A (zh) * 2020-06-29 2020-10-09 成都航空职业技术学院 一种基于窄带模型的多目的地的最短路径获取方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101136843A (zh) * 2006-08-30 2008-03-05 华为技术有限公司 最短路径桥中对称树的生成方法
WO2008130620A1 (en) * 2007-04-18 2008-10-30 Nortel Networks Limited Failure notification in a network having serially connected nodes
CN101616085A (zh) * 2009-06-25 2009-12-30 中兴通讯股份有限公司 一种约束路由生成方法和装置
US20130114595A1 (en) * 2011-11-04 2013-05-09 Futurewei Technologies, Co. Method for Multicast Flow Routing Selection
CN103688497A (zh) * 2013-09-26 2014-03-26 华为技术有限公司 跨域路径的建立方法及设备

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3501093B2 (ja) * 2000-04-18 2004-02-23 日本電気株式会社 ＱｏＳ経路計算装置
US7280481B2 (en) * 2002-10-10 2007-10-09 Guangyi David Rong Shortest path search method “Midway”
CN100442753C (zh) * 2006-02-27 2008-12-10 华为技术有限公司 一种获得跨域松散路由的方法及系统
CN100566345C (zh) * 2006-09-29 2009-12-02 湖南大学 基于超宽带的无线传感器网络节点定位方法
CN100490352C (zh) * 2007-01-10 2009-05-20 北京航空航天大学 提高天基信息网络服务质量的路由装置及方法
CN101075208B (zh) * 2007-07-19 2011-04-06 中兴通讯股份有限公司 应用于白盒路径测试的测试用例生成方法
WO2010058785A1 (ja) * 2008-11-19 2010-05-27 日本電信電話株式会社 経路計算順決定方法、プログラムおよび計算装置
CN101788999A (zh) * 2009-12-30 2010-07-28 安徽大学 一种网络图中最短路径的二分查找追踪方法
CN103874159A (zh) * 2014-03-26 2014-06-18 江苏博悦物联网技术有限公司 无线传感器网络

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101136843A (zh) * 2006-08-30 2008-03-05 华为技术有限公司 最短路径桥中对称树的生成方法
WO2008130620A1 (en) * 2007-04-18 2008-10-30 Nortel Networks Limited Failure notification in a network having serially connected nodes
CN101616085A (zh) * 2009-06-25 2009-12-30 中兴通讯股份有限公司 一种约束路由生成方法和装置
US20130114595A1 (en) * 2011-11-04 2013-05-09 Futurewei Technologies, Co. Method for Multicast Flow Routing Selection
CN103688497A (zh) * 2013-09-26 2014-03-26 华为技术有限公司 跨域路径的建立方法及设备

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111754043A (zh) * 2020-06-29 2020-10-09 成都航空职业技术学院 一种基于窄带模型的多目的地的最短路径获取方法
CN111754043B (zh) * 2020-06-29 2024-01-12 成都航空职业技术学院 一种基于窄带模型的多目的地的最短路径获取方法

Also Published As

Publication number Publication date
CN107566268A (zh) 2018-01-09
CN107566268B (zh) 2021-08-17

Similar Documents

Publication Publication Date Title
US11082262B2 (en) Flow entry generating method and apparatus
EP3070895B1 (en) Encapsulation method and system for flow identifier
EP3651423B1 (en) Determining identification information about cross-domain path
US10033623B2 (en) Multithreaded system and method for establishing network connections
CN107078966B (zh) 用于指配接收器标识符和自动确定树属性的方法和装置
CN112491707B (zh) 一种转发路径的确定方法及装置
EP3780514B1 (en) Tunnel setup method, apparatus, and system
CN109428749A (zh) 网络管理方法及相关设备
US8824451B2 (en) Method and system for establishing an associated bidirectional label-switched path
US10958559B2 (en) Scaled inter-domain metrics for link state protocols
CN110730478A (zh) 切片关联方法、装置、端到端切片编排器及存储介质
CN111817869A (zh) 一种网络配置恢复方法及其相关设备
EP3598704A1 (en) Method and apparatus for establishing domain-level topology and network system
US20230116548A1 (en) Route Processing Method and Related Device
JPWO2015045466A1 (ja) 通信制御装置、通信制御システム、通信制御方法及び通信制御プログラム
WO2020244550A1 (zh) 路径计算方法及存储介质、电子装置
CN114650242A (zh) 路径故障检测方法、装置、相关设备及存储介质
WO2018001351A1 (zh) 以太网路径的获取方法及装置
US20140269410A1 (en) Efficient Flooding of Link State Packets for Layer 2 Link State Protocols
CN105262686B (zh) 一种网络连通性验证方法和装置
WO2018036453A1 (zh) 一种sfc网络中同步拓扑信息的方法及路由网元
WO2018161827A1 (zh) 一种地址自学习的方法、装置及交换机
CN104348744A (zh) 一种路径计算方法及路径计算单元
US20130194967A1 (en) Node capabilities detection method and system
WO2017054471A1 (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: 17819348

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17819348

Country of ref document: EP

Kind code of ref document: A1