WO2019001101A1 - 路由路径分析方法及设备 - Google Patents

路由路径分析方法及设备 Download PDF

Info

Publication number
WO2019001101A1
WO2019001101A1 PCT/CN2018/083574 CN2018083574W WO2019001101A1 WO 2019001101 A1 WO2019001101 A1 WO 2019001101A1 CN 2018083574 W CN2018083574 W CN 2018083574W WO 2019001101 A1 WO2019001101 A1 WO 2019001101A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
key
traffic information
path
data packet
Prior art date
Application number
PCT/CN2018/083574
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 EP18824242.4A priority Critical patent/EP3618371B1/en
Publication of WO2019001101A1 publication Critical patent/WO2019001101A1/zh
Priority to US16/702,906 priority patent/US11258702B2/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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H04L45/507—Label distribution
    • 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/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • 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
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/02—Standardisation; Integration
    • H04L41/0213—Standardised network management protocols, e.g. simple network management protocol [SNMP]
    • 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/20—Hop count for routing purposes, e.g. TTL
    • 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/22—Alternate 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a routing path analysis method and device.
  • the basic feature of the segment routing (SR) technology is that the service entry (the first node) identifies the data packet in advance how to pass the label stack of the key node, when the data message is transmitted to a key node.
  • the node selects its transmission path in the network according to the label information carried in the data packet.
  • the SR technology has the function of protecting the stable transmission through the setting of the working path/protection path.
  • the general implementation manner is as follows: the administrator presets the working path and the protection path, and the first node can generate the label stack according to the working path.
  • the SR technology is simple and free to use, and also has certain manageability.
  • MPLS Multi-Protocol Label Switching
  • Native IP Native IP
  • the second traffic flow visual technology is based on the SR tag to collect traffic for key nodes.
  • the third technique is to acquire key nodes at the first node, and then use BFD technology to verify whether the key nodes are selected.
  • the embodiment of the invention provides a routing path analysis method and device, which can accurately determine the working path or protection path actually selected by the data packet according to the traffic information of the key node and the related node, and obtain more detailed routing path information. .
  • an embodiment of the present invention provides a routing path analysis method, including:
  • the key node includes a split node, a next hop working path node of the offload node, and a next hop protection path node of the offload node;
  • the branching node is a cross node of the working path and the protection path;
  • the traffic information of the key node and the related node can be accurately determined to be the working path or the protection path actually selected by the data packet, and more detailed routing path information is obtained.
  • the method before the determining, by the label stack of the segmented route of the data packet, the method further includes:
  • the label stack of the segmentation route can be obtained from the first node.
  • the method before the determining, by the method, the neighboring node of the key node as the related node, the method further includes:
  • the neighbor nodes of the key node are obtained according to a topology connection between the nodes.
  • the neighbor node of the key node can be obtained, and the traffic information of the neighbor node is obtained, thereby helping to obtain a more detailed routing path.
  • the method further includes:
  • the querying the traffic information of the key node and the related node includes:
  • the node tag is used to query traffic information of the key node and the related node.
  • the traffic information of the key node and the related node can be obtained through the embodiment of the present invention.
  • the querying the traffic information of the key node and the related node includes:
  • the traffic information of the key node and the related node is determined according to the uplink and downlink relationship and the active/standby sequence between the nodes provided in the node label.
  • the method further includes:
  • Determining a routing path according to the node through which the data packet flows includes:
  • the key node through which the data packet flows and the intermediate node between the related nodes can be preferentially determined by the shortest path, and then the traffic information of the three nodes is combined to determine the detailed routing path.
  • the querying the traffic information of the key node and the related node includes:
  • the traffic information of the key node and the related node is queried by using a simple network management protocol SNMP.
  • the SNMP protocol can be used to query the traffic information of a small number of nodes without performing network traffic monitoring.
  • an embodiment of the present invention provides a routing path analysis device, including:
  • a first determining unit configured to determine a key node according to the label stack of the segmented route of the data packet;
  • the key node includes a branching node, a next hop working path node of the branching node, and a next hop of the branching node a protection path node; wherein the distribution node is a cross node of a working path and a protection path;
  • a second determining unit configured to determine a neighbor node of the key node as a related node
  • a query unit configured to query traffic information of the key node and the related node
  • a selecting unit configured to select, according to the traffic information, a node through which the data packet flows in the key node and the related node;
  • a third determining unit configured to determine a routing path according to the node through which the data packet flows.
  • the device further includes:
  • a first acquiring unit configured to acquire a label stack of the segmentation route from a first node of the routing path.
  • the device further includes:
  • a second acquiring unit configured to acquire the neighbor node of the key node according to a topology connection between the nodes.
  • the device further includes:
  • a third acquiring unit configured to acquire a node label of the key node and the related node
  • the query unit is specifically configured to query, by using the node tag, traffic information of the key node and the related node.
  • the querying unit is configured to query traffic information of the key node and traffic information of the related node according to an uplink and a downlink and an active/standby sequence of the node label in the label stack.
  • the device further includes:
  • a fourth determining unit configured to preferentially determine, according to the shortest path, an intermediate node between nodes through which the data packet flows;
  • the third determining unit is specifically configured to determine a routing path according to the node through which the data packet flows and the intermediate node.
  • the query unit is specifically configured to query, by using a simple network management protocol, SNMP, traffic information of the key node and the related node.
  • SNMP simple network management protocol
  • an embodiment of the present invention provides a network device, including a transceiver, a processor, and a memory, where
  • the memory is for storing a computer program
  • the processor is configured to read a computer program stored in the memory, and perform the method described in the first aspect above.
  • an embodiment of the present invention provides a computer readable storage medium, where the computer readable storage medium stores a computer program, and when the computer program is executed by a processor, the method described in the first aspect is implemented.
  • the key node is determined according to the label stack of the segmented route of the data packet; the key node includes a split node, a next hop working path node of the offload node, and a next hop protection of the offload node a path node; wherein the branch node is a cross node of the working path and the protection path; determining a neighbor node of the key node as a related node; querying traffic information of the key node and the related node; The information selects a node through which the data packet flows in the key node and the related node; and determines a routing path according to the node through which the data packet flows. It can be seen that the embodiment of the present invention can accurately determine the working path or the protection path actually selected by the data packet according to the traffic information of the key node and the related node, and obtain more detailed routing path information.
  • FIG. 1 is a schematic flowchart of a routing path analysis method according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of a router network according to an embodiment of the present invention.
  • FIG. 3 is a schematic flowchart diagram of another routing path analysis method according to an embodiment of the present disclosure.
  • FIG. 4 is a schematic structural diagram of a routing path analysis device according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of another routing path analysis device according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of a network device according to an embodiment of the present invention.
  • FIG. 1 is a schematic flowchart diagram of a routing path analysis method according to an embodiment of the present invention. As shown in FIG. 1, the routing path analysis method may include the following steps:
  • the embodiment of the present invention may be performed by a network management server, or by a dedicated routing path analysis device, and the specific device is not limited.
  • the key node includes a branch node, a next hop working path node of the offload node, and a next hop protection path node of the offload node; wherein the offload node is a cross node of the working path and the protection path.
  • FIG. 2 is a schematic structural diagram of a router network according to an embodiment of the present invention.
  • CE1 is the head node
  • CE2 is the destination node. That is, CE2 is the router node directly connected to the destination IP address of the data packet.
  • the administrator pre-defined the working path on the CE1 of the first node: CE1->PE3->PE4->CE2, and pre-defined the protection path CE1->PE3->PE7->CE2 Label stack.
  • the offload node is PE3
  • the next hop working path node of the offload node is PE4
  • the next hop protection path node of the offload node is PE7.
  • the neighbor node of the key node may be obtained according to a topology connection between the router nodes, and the neighbor node is determined as the related node.
  • the neighbor nodes of the key node PE3 are PE2, PE4, and PE7
  • the neighbor nodes of the key node PE4 are PE3 and PE8
  • the neighbor nodes of the key node PE7 are PE6, PE3, and PE8.
  • the traffic information of the key node and the related node is queried according to the node label of the key node.
  • the Simple Network Management Protocol can be used to query the traffic information of the key node and related nodes according to the node label of the key node.
  • the traffic information of PE3, PE2, PE4, and PE7 can be queried according to the node label of the PE3 (that is, the traffic information of the neighboring node PE3 and the neighbor node of the key node PE3 is queried) according to the PE4.
  • the node tag queries the traffic information of PE4, PE3, and PE8, and queries the traffic information of PE7, PE6, PE3, and PE8 according to PE7.
  • the traffic information may be used to determine which key node and related node the data packet actually passes.
  • the router network described in FIG. 2 when the PE2 device fails, if the data packet is transmitted from CE1 to CE2, the traffic information of the key node and the related node is queried according to the setting of the working path and the protection path. After that, it can be determined that the key nodes and related nodes through which the data message passes and the order of the nodes are PE7->PE3->PE4.
  • the intermediate node that is passed when the data packet is transmitted between the key node and the related node may be determined by using the shortest path first manner, so as to determine the detailed path of the data packet route.
  • the network management server can query the traffic information of the key node and the related node, and determine the detailed path of the data packet route according to the traffic information of the nodes.
  • FIG. 3 is a schematic flowchart diagram of another routing path analysis method according to an embodiment of the present invention. As shown in FIG. 3, the routing path analysis method may include the following steps:
  • the embodiment of the present invention may be performed by a network management server, or by a dedicated routing path analysis device, and the specific device is not limited.
  • the administrator sets a label stack for indicating the working path and the protection path at the first node of the routing path. Therefore, the network management server can obtain the label stack of the segmentation route from the first node of the routing path.
  • the key node includes a branch node, a next hop working path node of the offload node, and a next hop protection path node of the offload node; wherein the offload node is a cross node of the working path and the protection path.
  • FIG. 2 is a schematic structural diagram of a router network according to an embodiment of the present invention.
  • CE1 is the head node
  • CE2 is the destination node. That is, CE2 is the router node directly connected to the destination IP address of the data packet.
  • the administrator pre-defined the working path on the CE1 of the first node: CE1->PE3->PE4->CE2, and pre-defined the protection path CE1->PE3->PE7->CE2 Label stack.
  • the offload node is PE3
  • the next hop working path node of the offload node is PE4
  • the next hop protection path node of the offload node is PE7.
  • the neighbor node of the key node may be obtained according to a topology connection between the router nodes, and the neighbor node is determined as the related node.
  • the neighbor nodes of the key node PE3 are PE2, PE4, and PE7
  • the neighbor nodes of the key node PE4 are PE3 and PE8
  • the neighbor nodes of the key node PE7 are PE6, PE3, and PE8.
  • the Simple Network Management Protocol can be used to query the traffic information of the key node and related nodes according to the node label of the key node.
  • the node label of the key node includes the upstream and downstream node information and the active/standby sequence information of the node, and can query the traffic information of the key node and the traffic information of the related node according to the upstream and downstream and the active/standby sequence of the node label.
  • the traffic information of PE3, PE2, PE4, and PE7 (that is, the traffic information of the neighboring node PE3 and the neighbor node of the key node PE3) can be queried according to the node label of the PE3, according to the PE4.
  • the node tag queries the traffic information of PE4, PE3, and PE8, and queries the traffic information of PE7, PE6, PE3, and PE8 according to PE7.
  • the traffic information may be used to determine which key node and related node the data packet actually passes.
  • the router network described in FIG. 2 when the PE2 device fails, if the data packet is transmitted from CE1 to CE2, the traffic information of the key node and the related node is queried according to the setting of the working path and the protection path. After that, it can be determined that the key nodes and related nodes through which the data message passes and the order of the nodes are PE7->PE3->PE4.
  • the intermediate node that is passed when the data packet is transmitted between the key node and the related node may be determined by using the shortest path first manner, so as to determine the detailed path of the data packet route.
  • the network management server can query the traffic information of the key nodes and related nodes, and determine the detailed path of the data packet routing according to the traffic information of the nodes.
  • FIG. 4 is a schematic structural diagram of a routing path analysis device 400 according to an embodiment of the present invention.
  • the routing path analysis device may include:
  • the first determining unit 401 is configured to determine a key node according to the label stack of the segmented route of the data packet.
  • the key node includes a branch node, a next hop working path node of the offload node, and a next hop protection path node of the offload node; wherein the offload node is a cross node of the working path and the protection path.
  • FIG. 2 is a schematic structural diagram of a router network according to an embodiment of the present invention.
  • CE1 is the head node
  • CE2 is the destination node. That is, CE2 is the router node directly connected to the destination IP address of the data packet.
  • the administrator pre-defined the working path on the CE1 of the first node: CE1->PE3->PE4->CE2, and pre-defined the protection path CE1->PE3->PE7->CE2 Label stack.
  • the offload node is PE3
  • the next hop working path node of the offload node is PE4
  • the next hop protection path node of the offload node is PE7.
  • the second determining unit 402 is configured to determine a neighbor node of the key node as a related node.
  • the neighbor node of the key node may be obtained according to a topology connection between the router nodes, and the neighbor node is determined as the related node.
  • the neighbor nodes of the key node PE3 are PE2, PE4, and PE7
  • the neighbor nodes of the key node PE4 are PE3 and PE8
  • the neighbor nodes of the key node PE7 are PE6, PE3, and PE8.
  • the query unit 403 is configured to query traffic information of the key node and the related node.
  • the traffic information of the key node and the related node is queried according to the node label of the key node.
  • the Simple Network Management Protocol can be used to query the traffic information of the key node and related nodes according to the node label of the key node.
  • the traffic information of PE3, PE2, PE4, and PE7 (that is, the traffic information of the neighboring node PE3 and the neighbor node of the key node PE3) can be queried according to the node label of the PE3, according to the PE4.
  • the node tag queries the traffic information of PE4, PE3, and PE8, and queries the traffic information of PE7, PE6, PE3, and PE8 according to PE7.
  • the selecting unit 404 is configured to select, according to the traffic information, a node through which the data packet flows in the key node and the related node.
  • the traffic information may be used to determine which key node and related node the data packet actually passes.
  • the router network described in FIG. 2 when the PE2 device fails, if the data packet is transmitted from CE1 to CE2, the traffic information of the key node and the related node is queried according to the setting of the working path and the protection path. After that, it can be determined that the key nodes and related nodes through which the data message passes and the order of the nodes are PE7->PE3->PE4.
  • the third determining unit 405 is configured to determine a routing path according to the node through which the data packet flows.
  • the intermediate node that is passed when the data packet is transmitted between the key node and the related node may be determined by using the shortest path first manner, so as to determine the detailed path of the data packet route.
  • the traffic information of the key node and the related node can be queried, and the detailed path of the data packet routing is determined according to the traffic information of the nodes.
  • FIG. 5 is a schematic structural diagram of another routing path analysis device 500 according to an embodiment of the present invention.
  • the routing path analysis device 500 described in FIG. 5 is obtained on the basis of the routing path analysis device described in FIG. 4.
  • the device described in FIG. 5 further includes:
  • the first obtaining unit 406 is configured to obtain a label stack of the segmentation route from a head node of the routing path.
  • the administrator sets a label stack for indicating the working path and the protection path at the first node of the routing path. Therefore, the network management server can obtain the label stack of the segmentation route from the first node of the routing path.
  • the second obtaining unit 407 is configured to acquire the neighbor node of the key node according to a topology connection between the nodes.
  • the third obtaining unit 408 is configured to acquire the node label of the key node and the related node.
  • the routing path analysis device 500 further includes:
  • the fourth determining unit 409 is configured to preferentially determine an intermediate node between the nodes through which the data packet flows according to the shortest path.
  • the third determining unit 405 is specifically configured to determine a routing path according to the node through which the data packet flows and the intermediate node.
  • the traffic information of the key node and the related node can be queried, and the detailed path of the data packet routing is determined according to the traffic information of the nodes.
  • FIG. 6 is a network device 600 according to an embodiment of the present invention.
  • the network device includes a processor 601, a memory 602, a transceiver 603, and a bus 604.
  • the processor 601, the memory 602, and the transceiver 603 pass.
  • the buses 604 are connected to each other.
  • the memory 602 includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), an Erasable Programmable Read Only Memory (EPROM), or A Compact Disc Read-Only Memory (CD-ROM) is used for related instructions and data.
  • the transceiver 603 is for receiving and transmitting data.
  • the processor 601 may be a central processing unit (CPU), and the processor may also be another general-purpose processor, a digital signal processor (DSP). , Application Specific Integrated Circuit (ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, etc.
  • the general purpose processor may be a microprocessor or the processor or any conventional processor or the like.
  • the processor 601 in the network device is configured to read the program code stored in the memory 602, and perform the following operations:
  • the key node includes a split node, a next hop working path node of the offload node, and a next hop protection path node of the offload node;
  • the branching node is a cross node of the working path and the protection path;
  • the processor 601 and the transceiver 603 in the embodiment of the present invention may implement the implementation manner described in any one of the foregoing embodiments of the routing path analysis method provided by the embodiment of the present invention, and may also perform the embodiment of the present invention.
  • the implementation of the described network device is not described here.
  • a computer readable storage medium in another embodiment, storing a computer program, the computer program being executed by a processor to implement the method steps described in any of the foregoing embodiments.
  • the computer readable storage medium may be an internal storage unit of the network device described in any of the foregoing embodiments, such as a hard disk or a memory of the network device.
  • the computer readable storage medium may also be an external storage device of a network device, such as a plug-in hard disk equipped with a network device, a smart memory card (SMC), a Secure Digital (SD) card, a flash memory card. (Flash Card), etc.
  • the above computer readable storage medium may also include both an internal storage unit of the above network device and an external storage device.
  • the above computer readable storage medium is for storing the above computer program and other programs and data required by the above network device.
  • the computer readable storage medium described above can also be used to temporarily store data that has been output or is about to be output.
  • the disclosed apparatus may be implemented in other ways.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or may be Integrate into another system, or some features can be ignored or not executed.
  • 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 electrical or otherwise.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. 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 computer readable memory. Based on such understanding, the technical solution 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 memory. A number of instructions are included to cause a computer device (which may be a personal computer, server or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention.
  • the foregoing memory includes: a U disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk, and the like, which can store program codes.
  • ROM Read-Only Memory
  • RAM Random Access Memory

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明实施例公开了一种路由路径分析方法及设备。本发明实施例中，根据数据报文的分段路由的标签栈确定关键节点；关键节点包括分流节点、分流节点的下一跳工作路径节点、分流节点的下一跳保护路径节点；其中，分流节点为工作路径和保护路径的交叉节点；将关键节点的邻居节点确定为相关节点；查询关键节点和相关节点的流量信息；根据上述流量信息选择出关键节点和相关节点中数据报文流经的节点；根据数据报文流经的节点确定出路由路径。由此可见，本发明实施例可以根据关键节点和相关节点的流量信息，准确确定数据报文实际选择的为工作路径或保护路径，并且获取到更为详细的路由路径信息。

Description

路由路径分析方法及设备
本申请要求于2017年6月28日提交中国专利局、申请号为201710510997.9，发明名称为“路由路径分析方法及设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明涉及通信技术领域，尤其涉及一种路由路径分析方法及设备。
背景技术
分段路由(Segment Routing，SR)技术的基本特点是，在业务入口(首节点)提前对数据报文标识上一组如何路经关键节点的标签栈，当数据报文传输到某一关键节点时，该节点会根据数据报文携带的标签信息选择其在网络中的传输路径。而SR技术的特性是，可以通过工作路径/保护路径的设置起到保护稳定传输的作用，其大致实现方式为：管理员预设工作路径和保护路径，首节点可以根据工作路径生成标签栈，按工作路径从各关键节点进行顺序传输；然而，如果首节点通过双向转发检测(Bidirectional Forwarding Detection，BFD)发现工作路径不通，会使用管理员预设的保护路径重新生成标签栈，按保护路径从各关键节点进行顺序传输。
因此，SR技术与多协议标记交换(Multiprotocol Label Switching，MPLS)技术和本地IP(Native IP)技术相比，在使用起来简单、自由的同时，也带来一定的可管理能力。然而，在实际路由中，数据报文从首节点发出后，其具体经过的路径就脱离了管理员的管控，即管理员并不知道报文是否会按照预期的路径传输，也无法了解到环路、绕行等情况的发生。
这是由于SR技术只规定关键路径，而关键路径并不等同于实际路径造成的。实际路径与关键路径的差异，会导致实际路径与管理员定义关键路径存在预期上的偏差，严重的时候可能背道而驰，这样就弱化了管理员的实际管理能力。为了弥补可管理性的上的缺陷，只能使用流量流向可视技术，对数据报文在关键路径上的传输进行跟踪，来进行管理上的弥补。
常用的流量流向可视技术有三种，一种是全网流量采集技术。这种技术需要采集全网流量，导致其对网络带宽的占用大，同时也增加了路由器的工作负担；并且网管服务器需要分析全网路由器上报的所有报文，其CPU和内存的需求很高，导致网管服务器成本高昂；除此之外，由于路由器和服务器处理的数据量过大，导致数据处理周期长，达不到实时性要求；而且，若路由器反馈没有接收到数据报文，无法辨别是由于路由器故障导致，还是该路由器本来就没有数据报文。
第二种流量流向可视技术是根据SR标签，对关键节点进行流量采集；第三种技术是在首节点获取关键节点，之后利用BFD技术验证关键节点是否被选择。这两种技术的缺点均在于，其只能获取关键节点的情况，而无法获取流量实际流经的非关键节点的情况，因此并不能反映出真实的流量路径。
发明内容
本发明实施例提供一种路由路径分析方法及设备，可以根据关键节点和相关节点的流量信息，准确确定数据报文实际选择的为工作路径或保护路径，并且获取到更为详细的路由 路径信息。
第一方面，本发明实施例提供一种路由路径分析方法，包括：
根据数据报文的分段路由的标签栈确定关键节点；所述关键节点包括分流节点、所述分流节点的下一跳工作路径节点、所述分流节点的下一跳保护路径节点；其中，所述分流节点为工作路径和保护路径的交叉节点；
将所述关键节点的邻居节点确定为相关节点；
查询所述关键节点和所述相关节点的流量信息；
根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点；
根据所述数据报文流经的节点确定出路由路径。
由此可见，通过本发明实施例，可以根据关键节点和相关节点的流量信息，准确确定数据报文实际选择的为工作路径或保护路径，并且获取到更为详细的路由路径信息。
作为一种可选的实施方式，所述根据数据报文的分段路由的标签栈确定关键节点之前，所述方法还包括：
从路由路径的首节点获取所述分段路由的标签栈。
由此可见，通过本发明实施例，根据分段路由的特性，可以从首节点获取到分段路由的标签栈。
作为一种可选的实施方式，所述将所述关键节点的邻居节点确定为相关节点之前，所述方法还包括：
根据节点之间的拓扑连接获取所述关键节点的所述邻居节点。
由此可见，通过本发明实施例，可以获取关键节点的邻居节点，进而获取邻居节点的流量信息，帮助获得更为明细的路由路径。
作为一种可选的实施方式，所述方法还包括：
获取所述关键节点和所述相关节点的节点标签；
所述查询所述关键节点和所述相关节点的流量信息，包括：
利用所述节点标签查询所述关键节点和所述相关节点的流量信息。
由此可见，通过本发明实施例，可以获得关键节点和相关节点的流量信息。
作为一种可选的实施方式，所述查询所述关键节点和所述相关节点的流量信息，包括：
根据所述标签栈中节点标签的上下游和主备顺序，查询所述关键节点的流量信息和所述相关节点的流量信息。
由此可见，通过本发明实施例，根据节点标签中提供的节点之间的上下游关系和主备顺序，确定关键节点和相关节点的流量信息。
作为一种可选的实施方式，所述根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点之后，所述方法还包括：
根据最短路径优先确定出所述数据报文流经的节点之间的中间节点；
所述根据所述数据报文流经的节点确定出路由路径，包括：
根据所述数据报文流经的节点和所述中间节点确定出路由路径。
由此可见，通过本发明实施例，可以通过最短路径优先确定数据报文流经的关键节点、相关节点之间的中间节点，之后结合这三种节点的流量信息，确定中详细的路由路径。
作为一种可选的实施方式，所述查询所述关键节点和所述相关节点的流量信息，包括：
利用简单网络管理协议SNMP查询所述关键节点和所述相关节点的流量信息。
由此可见，通过本发明实施例，可以利用SNMP协议查询少量节点的流量信息，而不需要进行全网流量监测。
第二方面，本发明实施例提供一种路由路径分析设备，包括：
第一确定单元，用于根据数据报文的分段路由的标签栈确定关键节点；所述关键节点包括分流节点、所述分流节点的下一跳工作路径节点、所述分流节点的下一跳保护路径节点；其中，所述分流节点为工作路径和保护路径的交叉节点；
第二确定单元，用于将所述关键节点的邻居节点确定为相关节点；
查询单元，用于查询所述关键节点和所述相关节点的流量信息；
选择单元，用于根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点；
第三确定单元，用于根据所述数据报文流经的节点确定出路由路径。
作为一种可选的实施方式，所述设备还包括：
第一获取单元，用于从路由路径的首节点获取所述分段路由的标签栈。
作为一种可选的实施方式，所述设备还包括：
第二获取单元，用于根据节点之间的拓扑连接获取所述关键节点的所述邻居节点。
作为一种可选的实施方式，所述设备还包括：
第三获取单元，用于获取所述关键节点和所述相关节点的节点标签；
所述查询单元，具体用于利用所述节点标签查询所述关键节点和所述相关节点的流量信息。
作为一种可选的实施方式，所述查询单元，具体用于根据所述标签栈中节点标签的上下游和主备顺序，查询所述关键节点的流量信息和所述相关节点的流量信息。
作为一种可选的实施方式，所述设备还包括：
第四确定单元，用于根据最短路径优先确定出所述数据报文流经的节点之间的中间节点；
所述第三确定单元，具体用于根据所述数据报文流经的节点和所述中间节点确定出路由路径。
作为一种可选的实施方式，所述查询单元，具体用于利用简单网络管理协议SNMP查询所述关键节点和所述相关节点的流量信息。
第三方面，本发明实施例提供一种网络设备，包括收发器、处理器和存储器，其中，
所述存储器用于存储计算机程序；
所述处理器，用于读取所述存储器中存储的计算机程序，执行上述第一方面所描述的方法。
第四方面，本发明实施例提供一种计算机可读存储介质，所述计算机可读存储介质存储有计算机程序，所述计算机程序被处理器执行时实现上述第一方面所描述的方法。
本发明实施例中，根据数据报文的分段路由的标签栈确定关键节点；所述关键节点包括分流节点、所述分流节点的下一跳工作路径节点、所述分流节点的下一跳保护路径节点；其中，所述分流节点为工作路径和保护路径的交叉节点；将所述关键节点的邻居节点确定为相关节点；查询所述关键节点和所述相关节点的流量信息；根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点；根据所述数据报文流经的节点确定出路由 路径。由此可见，本发明实施例可以根据关键节点和相关节点的流量信息，准确确定数据报文实际选择的为工作路径或保护路径，并且获取到更为详细的路由路径信息。
附图说明
为了更清楚地说明本发明实施例或背景技术中的技术方案，下面将对本发明实施例或背景技术中所需要使用的附图进行说明。
图1为本发明实施例公开的一种路由路径分析方法的流程示意图；
图2为本发明实施例公开的一种路由器网络的结构示意图；
图3为本发明实施例公开的另一种路由路径分析方法的流程示意图；
图4为本发明实施例公开的一种路由路径分析设备的结构示意图；
图5为本发明实施例公开的另一种路由路径分析设备的结构示意图；
图6是本发明实施例公开的一种网络设备的结构示意图。
具体实施方式
下面结合本发明实施例中的附图对本发明实施例进行描述。
请参阅图1，图1为本发明实施例公开的一种路由路径分析方法的流程示意图。如图1所示，该路由路径分析方法可以包括如下步骤：
101、根据数据报文的分段路由的标签栈确定关键节点。
本发明实施例可以由网络管理服务器执行，或者由专用的路由路径分析设备执行，具体采用何种设备，本发明实施例不做限定。
本发明实施例中，上述关键节点包括分流节点、分流节点的下一跳工作路径节点、分流节点的下一跳保护路径节点；其中，上述分流节点为工作路径和保护路径的交叉节点。
请参阅图2，图2为本发明实施例公开的一种路由器网络的结构示意图。如图2所示，数据报文在该路由器网络中传输时，CE1为首节点，CE2为目标节点，即CE2为该数据报文的目的地IP地址所直接连接的路由器节点。根据分段路由的原理，管理员在首节点CE1预定义了工作路径：CE1->PE3->PE4->CE2的标签栈，并预定义了保护路径CE1->PE3->PE7->CE2的标签栈。
根据图2所描述的路由器网络，分流节点为PE3，分流节点的下一跳工作路径节点为PE4，分流节点的下一跳保护路径节点为PE7。
102、将所述关键节点的邻居节点确定为相关节点。
作为一种可选的实施方式，可以根据路由器节点之间的拓扑连接获取上述关键节点的邻居节点，将邻居节点确定为上述相关节点。
根据图2所描述的路由器网络，关键节点PE3的邻居节点为PE2、PE4、PE7，关键节点PE4的邻居节点为PE3、PE8，关键节点PE7的邻居节点为PE6、PE3、PE8。
103、查询所述关键节点和所述相关节点的流量信息。
作为一种可选的实施方式，根据关键节点的节点标签查询关键节点和相关节点的流量信息。
作为一种可选的实施方式，可以使用简单网络管理协议(Simple Network Management Protocol，SNMP)，根据关键节点的节点标签查询关键节点和相关节点的流量信息。
根据图2所描述的路由器网络，可以使用SNMP协议，根据PE3的节点标签查询PE3、 PE2、PE4、PE7的流量信息(即查询关键节点PE3和关键节点PE3的邻居节点的流量信息)，根据PE4的节点标签查询PE4、PE3、PE8的流量信息，根据PE7查询PE7、PE6、PE3、PE8的流量信息。
104、根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点。
本发明实施例中，当查询了关键节点和相关节点的流量信息之后，可以根据流量信息判断数据报文真实经过哪个关键节点和相关节点。
根据图2所描述的路由器网络，在PE2设备发生故障时，若数据报文从CE1传输到CE2，则根据上述工作路径和保护路径的设置，在经过对关键节点和相关节点的流量信息进行查询后，可以确定出，数据报文经过的关键节点和相关节点以及这些节点的顺序为PE7->PE3->PE4。
105、根据所述数据报文流经的节点确定出路由路径。
作为一种可选的实施方式，可以通过最短路径优先的方式，确定出数据报文在关键节点和相关节点之间传输时，经过的中间节点，从而确定出数据报文路由的明细路径。
由此可见，利用图1所描述的方法，网络管理服务器可以查询关键节点和相关节点的流量信息，根据这些节点的流量信息确定数据报文路由的详细路径。
请参阅图3，图3为本发明实施例公开的另一种路由路径分析方法的流程示意图。如图3所示，该路由路径分析方法可以包括如下步骤：
301、从路由路径的首节点获取分段路由的标签栈。
本发明实施例可以由网络管理服务器执行，或者由专用的路由路径分析设备执行，具体采用何种设备，本发明实施例不做限定。
根据分段路由的特点，管理员会在路由路径的首节点设置用于指示工作路径和保护路径的标签栈，因此，网络管理服务器可以从路由路径的首节点获取分段路由的标签栈。
302、根据数据报文的所述分段路由的标签栈确定关键节点。
本发明实施例中，上述关键节点包括分流节点、分流节点的下一跳工作路径节点、分流节点的下一跳保护路径节点；其中，上述分流节点为工作路径和保护路径的交叉节点。
请参阅图2，图2为本发明实施例公开的一种路由器网络的结构示意图。如图2所示，数据报文在该路由器网络中传输时，CE1为首节点，CE2为目标节点，即CE2为该数据报文的目的地IP地址所直接连接的路由器节点。根据分段路由的原理，管理员在首节点CE1预定义了工作路径：CE1->PE3->PE4->CE2的标签栈，并预定义了保护路径CE1->PE3->PE7->CE2的标签栈。
根据图2所描述的路由器网络，分流节点为PE3，分流节点的下一跳工作路径节点为PE4，分流节点的下一跳保护路径节点为PE7。
303、将所述关键节点的邻居节点确定为相关节点。
作为一种可选的实施方式，可以根据路由器节点之间的拓扑连接获取上述关键节点的邻居节点，将邻居节点确定为上述相关节点。
根据图2所描述的路由器网络，关键节点PE3的邻居节点为PE2、PE4、PE7，关键节点PE4的邻居节点为PE3、PE8，关键节点PE7的邻居节点为PE6、PE3、PE8。
304、获取所述关键节点和所述相关节点的节点标签。
305、利用所述节点标签查询所述关键节点和所述相关节点的流量信息。
作为一种可选的实施方式，可以使用简单网络管理协议(Simple Network Management Protocol，SNMP)，根据关键节点的节点标签查询关键节点和相关节点的流量信息。
本发明实施例中，关键节点的节点标签中包含该节点的上下游节点信息和主备顺序信息，可以根据节点标签的上下游和主备顺序，查询关键节点的流量信息和相关节点的流量信息。
根据图2所描述的路由器网络，可以使用SNMP协议，根据PE3的节点标签查询PE3、PE2、PE4、PE7的流量信息(即查询关键节点PE3和关键节点PE3的邻居节点的流量信息)，根据PE4的节点标签查询PE4、PE3、PE8的流量信息，根据PE7查询PE7、PE6、PE3、PE8的流量信息。
306、根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点。
本发明实施例中，当查询了关键节点和相关节点的流量信息之后，可以根据流量信息判断数据报文真实经过哪个关键节点和相关节点。
根据图2所描述的路由器网络，在PE2设备发生故障时，若数据报文从CE1传输到CE2，则根据上述工作路径和保护路径的设置，在经过对关键节点和相关节点的流量信息进行查询后，可以确定出，数据报文经过的关键节点和相关节点以及这些节点的顺序为PE7->PE3->PE4。
307、根据最短路径优先确定出所述数据报文流经的节点之间的中间节点。
作为一种可选的实施方式，可以通过最短路径优先的方式，确定出数据报文在关键节点和相关节点之间传输时，经过的中间节点，从而确定出数据报文路由的明细路径。
308、根据所述数据报文流经的节点和所述中间节点确定出路由路径。
由此可见，利用图3所描述的方法，网络管理服务器可以查询关键节点和相关节点的流量信息，根据这些节点的流量信息确定数据报文路由的详细路径。
请参阅图4，图4为本发明实施例公开的一种路由路径分析设备400的结构示意图。如图4所示，该路由路径分析设备可以包括：
第一确定单元401，用于根据数据报文的分段路由的标签栈确定关键节点。
本发明实施例中，上述关键节点包括分流节点、分流节点的下一跳工作路径节点、分流节点的下一跳保护路径节点；其中，上述分流节点为工作路径和保护路径的交叉节点。
请参阅图2，图2为本发明实施例公开的一种路由器网络的结构示意图。如图2所示，数据报文在该路由器网络中传输时，CE1为首节点，CE2为目标节点，即CE2为该数据报文的目的地IP地址所直接连接的路由器节点。根据分段路由的原理，管理员在首节点CE1预定义了工作路径：CE1->PE3->PE4->CE2的标签栈，并预定义了保护路径CE1->PE3->PE7->CE2的标签栈。
根据图2所描述的路由器网络，分流节点为PE3，分流节点的下一跳工作路径节点为PE4，分流节点的下一跳保护路径节点为PE7。
第二确定单元402，用于将所述关键节点的邻居节点确定为相关节点。
作为一种可选的实施方式，可以根据路由器节点之间的拓扑连接获取上述关键节点的邻居节点，将邻居节点确定为上述相关节点。
根据图2所描述的路由器网络，关键节点PE3的邻居节点为PE2、PE4、PE7，关键节点PE4的邻居节点为PE3、PE8，关键节点PE7的邻居节点为PE6、PE3、PE8。
查询单元403，用于查询所述关键节点和所述相关节点的流量信息。
作为一种可选的实施方式，根据关键节点的节点标签查询关键节点和相关节点的流量信息。
作为一种可选的实施方式，可以使用简单网络管理协议(Simple Network Management Protocol，SNMP)，根据关键节点的节点标签查询关键节点和相关节点的流量信息。
根据图2所描述的路由器网络，可以使用SNMP协议，根据PE3的节点标签查询PE3、PE2、PE4、PE7的流量信息(即查询关键节点PE3和关键节点PE3的邻居节点的流量信息)，根据PE4的节点标签查询PE4、PE3、PE8的流量信息，根据PE7查询PE7、PE6、PE3、PE8的流量信息。
选择单元404，用于根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点。
本发明实施例中，当查询了关键节点和相关节点的流量信息之后，可以根据流量信息判断数据报文真实经过哪个关键节点和相关节点。
根据图2所描述的路由器网络，在PE2设备发生故障时，若数据报文从CE1传输到CE2，则根据上述工作路径和保护路径的设置，在经过对关键节点和相关节点的流量信息进行查询后，可以确定出，数据报文经过的关键节点和相关节点以及这些节点的顺序为PE7->PE3->PE4。
第三确定单元405，用于根据所述数据报文流经的节点确定出路由路径。
作为一种可选的实施方式，可以通过最短路径优先的方式，确定出数据报文在关键节点和相关节点之间传输时，经过的中间节点，从而确定出数据报文路由的明细路径。
由此可见，利用图4所描述的路由路径分析设备，可以查询关键节点和相关节点的流量信息，根据这些节点的流量信息确定数据报文路由的详细路径。
请参阅图5，图5为本发明实施例公开的另一种路由路径分析设备500的结构示意图。图5所描述的路由路径分析设备500在图4所描述的路由路径分析设备的基础上获得，与图4所描述的设备相比，图5所描述的设备还包括：
第一获取单元406，用于从路由路径的首节点获取所述分段路由的标签栈。
根据分段路由的特点，管理员会在路由路径的首节点设置用于指示工作路径和保护路径的标签栈，因此，网络管理服务器可以从路由路径的首节点获取分段路由的标签栈。
第二获取单元407，用于根据节点之间的拓扑连接获取所述关键节点的所述邻居节点。
第三获取单元408，用于获取所述关键节点和所述相关节点的节点标签。
作为一种可选的实施方式，路由路径分析设备500还包括：
第四确定单元409，用于根据最短路径优先确定出所述数据报文流经的节点之间的中间节点。
所述第三确定单元405，具体用于根据所述数据报文流经的节点和所述中间节点确定出路由路径。
由此可见，利用图5所描述的路由路径分析设备，可以查询关键节点和相关节点的流量信息，根据这些节点的流量信息确定数据报文路由的详细路径。
请参见图6，图6是本发明实施例提供的一种网络设备600，该网络设备包括处理器601、存储器602、收发器603和总线604，上述处理器601、存储器602和收发器603通过总线604相互连接。
存储器602包括但不限于是随机存储记忆体(Random Access Memory，RAM)、只读存储器(Read-Only Memory，ROM)、可擦除可编程只读存储器(Erasable Programmable Read Only Memory，EPROM)、或便携式只读存储器(Compact Disc Read-Only Memory，CD-ROM)，该存储器602用于相关指令及数据。收发器603用于接收和发送数据。
应当理解，在本发明实施例中，所称处理器601可以是中央处理单元(Central Processing Unit，CPU)，该处理器还可以是其他通用处理器、数字信号处理器(Digital Signal Processor，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、现成可编程门阵列(Field-Programmable Gate Array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
该网络设备中的处理器601用于读取上述存储器602中存储的程序代码，执行以下操作：
根据数据报文的分段路由的标签栈确定关键节点；所述关键节点包括分流节点、所述分流节点的下一跳工作路径节点、所述分流节点的下一跳保护路径节点；其中，所述分流节点为工作路径和保护路径的交叉节点；
将所述关键节点的邻居节点确定为相关节点；
查询所述关键节点和所述相关节点的流量信息；
根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点；
根据所述数据报文流经的节点确定出路由路径。
具体实现中，本发明实施例中所描述的处理器601、收发器603可执行本发明实施例提供的路由路径分析方法的前述任一实施例所描述的实现方式，也可执行本发明实施例所描述的网络设备的实现方式，在此不再赘述。
在本发明的另一实施例中提供一种计算机可读存储介质，上述计算机可读存储介质存储有计算机程序，上述计算机程序被处理器执行时实现前述任一实施例所描述的方法步骤。
上述计算机可读存储介质可以是前述任一实施例上述的网络设备的内部存储单元，例如网络设备的硬盘或内存。上述计算机可读存储介质也可以是网络设备的外部存储设备，例如网络设备上配备的插接式硬盘，智能存储卡(Smart Media Card,SMC)，安全数字(Secure Digital,SD)卡，闪存卡(Flash Card)等。进一步地，上述计算机可读存储介质还可以既包括上述网络设备的内部存储单元也包括外部存储设备。上述计算机可读存储介质用于存储上述计算机程序以及上述网络设备所需的其他程序和数据。上述计算机可读存储介质还可以用于暂时地存储已经输出或者将要输出的数据。
需要说明的是，对于前述的各方法实施例，为了简单描述，故将其都表述为一系列的动作组合，但是本领域技术人员应该知悉，本发明并不受所描述的动作顺序的限制，因为依据本发明，某些步骤可以采用其他顺序或者同时进行。其次，本领域技术人员也应该知悉，说明书中所描述的实施例均属于优选实施例，所涉及的动作和模块并不一定是本发明所必须的。
在上述实施例中，对各个实施例的描述都各有侧重，某个实施例中没有详述的部分，可以参见其他实施例的相关描述。
在本申请所提供的几个实施例中，应该理解到，所揭露的装置，可通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到 另一个***，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本发明各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储器中。基于这样的理解，本发明的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储器中，包括若干指令用以使得一台计算机设备(可为个人计算机、服务器或者网络设备等)执行本发明各个实施例所述方法的全部或部分步骤。而前述的存储器包括：U盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。
本领域普通技术人员可以理解上述实施例的各种方法中的全部或部分步骤是可以通过程序来指令相关的硬件来完成，该程序可以存储于一计算机可读存储器中，存储器可以包括：闪存盘、只读存储器(英文：Read-Only Memory，简称：ROM)、随机存取器(英文：Random Access Memory，简称：RAM)、磁盘或光盘等。
以上对本发明实施例进行了详细介绍，本文中应用了具体个例对本发明的原理及实施方式进行了阐述，以上实施例的说明只是用于帮助理解本发明的方法及其核心思想；同时，对于本领域的一般技术人员，依据本发明的思想，在具体实施方式及应用范围上均会有改变之处，综上所述，本说明书内容不应理解为对本发明的限制。

Claims (16)

  1. 一种路由路径分析方法，其特征在于，包括：
    根据数据报文的分段路由的标签栈确定关键节点；所述关键节点包括分流节点、所述分流节点的下一跳工作路径节点、所述分流节点的下一跳保护路径节点；其中，所述分流节点为工作路径和保护路径的交叉节点；
    将所述关键节点的邻居节点确定为相关节点；
    查询所述关键节点和所述相关节点的流量信息；
    根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点；
    根据所述数据报文流经的节点确定出路由路径。
  2. 根据权利要求1所述的方法，其特征在于，所述根据数据报文的分段路由的标签栈确定关键节点之前，所述方法还包括：
    从路由路径的首节点获取所述分段路由的标签栈。
  3. 根据权利要求1或2所述的方法，其特征在于，所述将所述关键节点的邻居节点确定为相关节点之前，所述方法还包括：
    根据节点之间的拓扑连接获取所述关键节点的所述邻居节点。
  4. 根据权利要求1～3中任意一项所述的方法，其特征在于，所述方法还包括：
    获取所述关键节点和所述相关节点的节点标签；
    所述查询所述关键节点和所述相关节点的流量信息，包括：
    利用所述节点标签查询所述关键节点和所述相关节点的流量信息。
  5. 根据权利要求4所述的方法，其特征在于，所述查询所述关键节点和所述相关节点的流量信息，包括：
    根据所述标签栈中节点标签的上下游和主备顺序，查询所述关键节点的流量信息和所述相关节点的流量信息。
  6. 根据权利要求5所述的方法，其特征在于，所述根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点之后，所述方法还包括：
    根据最短路径优先确定出所述数据报文流经的节点之间的中间节点；
    所述根据所述数据报文流经的节点确定出路由路径，包括：
    根据所述数据报文流经的节点和所述中间节点确定出路由路径。
  7. 根据权利要求1～6中任意一项所述的方法，其特征在于，所述查询所述关键节点和所述相关节点的流量信息，包括：
    利用简单网络管理协议SNMP查询所述关键节点和所述相关节点的流量信息。
  8. 一种路由路径分析设备，其特征在于，包括：
    第一确定单元，用于根据数据报文的分段路由的标签栈确定关键节点；所述关键节点包括分流节点、所述分流节点的下一跳工作路径节点、所述分流节点的下一跳保护路径节点；其中，所述分流节点为工作路径和保护路径的交叉节点；
    第二确定单元，用于将所述关键节点的邻居节点确定为相关节点；
    查询单元，用于查询所述关键节点和所述相关节点的流量信息；
    选择单元，用于根据所述流量信息选择出所述关键节点和所述相关节点中所述数据报文流经的节点；
    第三确定单元，用于根据所述数据报文流经的节点确定出路由路径。
  9. 根据权利要求8所述的设备，其特征在于，所述设备还包括：
    第一获取单元，用于从路由路径的首节点获取所述分段路由的标签栈。
  10. 根据权利要求8或9所述的设备，其特征在于，所述设备还包括：
    第二获取单元，用于根据节点之间的拓扑连接获取所述关键节点的所述邻居节点。
  11. 根据权利要求8～10中任意一项所述的设备，其特征在于，所述设备还包括：
    第三获取单元，用于获取所述关键节点和所述相关节点的节点标签；
    所述查询单元，具体用于利用所述节点标签查询所述关键节点和所述相关节点的流量信息。
  12. 根据权利要求11所述的设备，其特征在于，
    所述查询单元，具体用于根据所述标签栈中节点标签的上下游和主备顺序，查询所述关键节点的流量信息和所述相关节点的流量信息。
  13. 根据权利要求12所述的设备，其特征在于，所述设备还包括：
    第四确定单元，用于根据最短路径优先确定出所述数据报文流经的节点之间的中间节点；
    所述第三确定单元，具体用于根据所述数据报文流经的节点和所述中间节点确定出路由路径。
  14. 根据权利要求8～13中任意一项所述的设备，其特征在于，所述查询单元，具体用于利用简单网络管理协议SNMP查询所述关键节点和所述相关节点的流量信息。
  15. 一种网络设备，其特征在于，包括收发器、处理器和存储器，其中，
    所述存储器用于存储计算机程序；
    所述处理器，用于读取所述存储器中存储的计算机程序，执行权利要求1至7任意一项所述方法。
  16. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质存储有计算机程序，所述计算机程序被处理器执行时实现如权利要求1至7任一项所述方法。
PCT/CN2018/083574 2017-06-28 2018-04-18 路由路径分析方法及设备 WO2019001101A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18824242.4A EP3618371B1 (en) 2017-06-28 2018-04-18 Routing path analysis method and device
US16/702,906 US11258702B2 (en) 2017-06-28 2019-12-04 Routing path analysis method and device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710510997.9 2017-06-28
CN201710510997.9A CN109150707B (zh) 2017-06-28 2017-06-28 路由路径分析方法及设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/702,906 Continuation US11258702B2 (en) 2017-06-28 2019-12-04 Routing path analysis method and device

Publications (1)

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

Family

ID=64740357

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/083574 WO2019001101A1 (zh) 2017-06-28 2018-04-18 路由路径分析方法及设备

Country Status (4)

Country Link
US (1) US11258702B2 (zh)
EP (1) EP3618371B1 (zh)
CN (1) CN109150707B (zh)
WO (1) WO2019001101A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111522840A (zh) * 2020-04-27 2020-08-11 平安科技（深圳）有限公司 标签的配置方法、装置、设备及计算机可读存储介质

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11115319B2 (en) * 2019-07-23 2021-09-07 Hewlett Packard Enterprise Development Lp Using BFD packets in a network tunnel environment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102035691A (zh) * 2009-09-28 2011-04-27 ***通信集团公司 网络链路质量检测的方法及装置
US20140269266A1 (en) * 2012-10-05 2014-09-18 Cisco Technology, Inc. Method and system for path monitoring using segment routing
CN105704019A (zh) * 2014-12-16 2016-06-22 思科技术公司 用于分段路由邻接分段的节点保护
CN106161246A (zh) * 2016-06-15 2016-11-23 杭州华三通信技术有限公司 备用路由的实现方法及装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9450864B2 (en) * 2013-10-11 2016-09-20 Futurewei Technologies, Inc. Using PCE as SDN controller
CN105282028A (zh) * 2014-06-05 2016-01-27 中兴通讯股份有限公司 一种报文传输方法、节点及路径管理服务器
US10212088B2 (en) * 2016-11-07 2019-02-19 Cisco Technology, Inc. Tactical traffic engineering based on segment routing policies

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102035691A (zh) * 2009-09-28 2011-04-27 ***通信集团公司 网络链路质量检测的方法及装置
US20140269266A1 (en) * 2012-10-05 2014-09-18 Cisco Technology, Inc. Method and system for path monitoring using segment routing
CN105704019A (zh) * 2014-12-16 2016-06-22 思科技术公司 用于分段路由邻接分段的节点保护
CN106161246A (zh) * 2016-06-15 2016-11-23 杭州华三通信技术有限公司 备用路由的实现方法及装置

Non-Patent Citations (1)

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

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111522840A (zh) * 2020-04-27 2020-08-11 平安科技（深圳）有限公司 标签的配置方法、装置、设备及计算机可读存储介质
CN111522840B (zh) * 2020-04-27 2023-08-11 平安科技（深圳）有限公司 标签的配置方法、装置、设备及计算机可读存储介质

Also Published As

Publication number Publication date
CN109150707A (zh) 2019-01-04
US11258702B2 (en) 2022-02-22
EP3618371A1 (en) 2020-03-04
CN109150707B (zh) 2020-10-27
US20200106701A1 (en) 2020-04-02
EP3618371B1 (en) 2024-02-21
EP3618371A4 (en) 2020-04-22

Similar Documents

Publication Publication Date Title
US11876883B2 (en) Packet processing method, network node, and system
WO2020233192A1 (zh) 一种为业务流提供业务服务的方法和装置
CN105024985B (zh) 一种报文处理方法及装置
CN103748835B (zh) 标签交换路径的动态更新
WO2021258754A1 (zh) 报文指示方法、装置、设备和存储介质
EP3591913B1 (en) Traceroute in virtual extensible local area networks
US20220078106A1 (en) Packet Measurement Method, Device, and System
WO2016041379A1 (zh) Nni ping的实现方法及装置
WO2022078293A1 (zh) 组播业务流的检测方法及相关装置
EP3783837B1 (en) Service fault locating method and apparatus
CN109039903B (zh) 路由确定方法、装置及机器可读存储介质
WO2019001101A1 (zh) 路由路径分析方法及设备
JP7056207B2 (ja) トポロジ決定装置、トポロジ決定方法、トポロジ決定プログラムおよび通信システム
CN116248479A (zh) 网络路径探测方法、装置、设备及存储介质
US11582156B2 (en) Traffic detection method, apparatus, and system
US10904123B2 (en) Trace routing in virtual networks
WO2014000509A1 (zh) 一种传输监控方法及装置
CN111600737B (zh) 一种拓扑信息收集方法及网络设备
CN110838965B (zh) 一种隧道建立方法以及接收节点
CN116781599A (zh) 一种路由监控方法及装置
CN116800668A (zh) 网络数据报文的转发方法、装置、存储介质及电子设备
WO2012159316A1 (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: 18824242

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2018824242

Country of ref document: EP

Effective date: 20191128

NENP Non-entry into the national phase

Ref country code: DE