WO2019080927A1 - Message processing method and device, and computer-readable storage medium - Google Patents

Message processing method and device, and computer-readable storage medium

Info

Publication number
WO2019080927A1
WO2019080927A1 PCT/CN2018/112084 CN2018112084W WO2019080927A1 WO 2019080927 A1 WO2019080927 A1 WO 2019080927A1 CN 2018112084 W CN2018112084 W CN 2018112084W WO 2019080927 A1 WO2019080927 A1 WO 2019080927A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
node
instance number
packet
rsvp
Prior art date
Application number
PCT/CN2018/112084
Other languages
French (fr)
Chinese (zh)
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 WO2019080927A1 publication Critical patent/WO2019080927A1/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 

Definitions

  • the present disclosure relates to, but is not limited to, the field of communication technologies, and in particular, to a message processing method and apparatus, and a computer readable storage medium.
  • the Resource Reservation Protocol-Traffic Engineer (RSVP-TE) is an extension of the traditional Resource Reservation Protocol (RSVP) for multi-protocol label switching.
  • the traffic engineering is implemented in the Switching (MPLS)/IP (Internet Protocol) network.
  • MPLS Switching
  • IP Internet Protocol
  • the traffic is forwarded in the Traffic Engineer (TE) tunnel through the information release, path calculation, signaling interaction, and traffic forwarding.
  • TE Traffic Engineer
  • the path calculation relies on the traffic engineering-based Interior Gateway Protocol-Import Engineering (IGP-TE) flooding of TE links and attributes to form a TE database, and then through Constrained Shortest Path First (Constrained Shortest Path First, The CSPF algorithm calculates the path information of a tunnel.
  • IGP-TE generally includes extensions of TE for Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (ISIS).
  • OSPF Open Shortest Path First
  • ISIS Intermediate System to Intermediate System
  • the internal gateway protocol (IGP) internally divides the network logically by the instance number.
  • the physical number of the physical device can be divided into multiple logical devices by using the instance number.
  • IGP internal gateway protocol
  • the first type divided by exclusive port mode
  • three physical devices R1, R2, and R3 can be divided into two logical devices by dividing instance 1 and instance 2 on each device.
  • Link L12 and link L23 belong to instance 1.
  • Road L21 and link L32 belong to instance 2, and each device is divided into two logical devices;
  • R1, R2, and R3 are also configured with routing instance 1 and routing instance 2 for each device to divide the device into two logical devices.
  • the first method is the link.
  • L12 and link L23 belong to both instance 1 and instance 2. This division is more logically distinguishable.
  • the entire tunnel path is preferably located in the same routing instance.
  • the present disclosure provides a message processing method and apparatus, and a computer readable storage medium, which enables a path of an entire tunnel to be located in the same routing instance as much as possible.
  • An embodiment of the present disclosure provides a packet processing method, including: when a node needs to calculate a path, detecting whether there is a received RSVP-TE packet and whether the received RSVP-TE packet carries a routing instance number; When there is a received RSVP-TE packet and the received RSVP-TE packet carries the route instance number, it is detected whether the path of the node to the next hop node includes the path belonging to the carried route instance number. When the path belongs to the carried route instance number, the path is calculated according to the carried route instance number; when the path belonging to the carried route instance number is not included, the route instance number calculation path of the node is traversed; Send an RSVP-TE packet carrying the calculated path and its associated route instance number to the next hop node.
  • Embodiments of the present disclosure also provide a computer readable storage medium storing one or more programs, the one or more programs being executable by one or more processors to implement the following Step:
  • the node needs to calculate the path, it detects whether there is a received RSVP-TE packet and the received RSVP-TE packet carries the route instance number; if there is a received RSVP-TE packet and has received
  • the RSVP-TE packet carries the route instance number, it is detected whether the path of the node to the next hop node includes the path belonging to the carried route instance number, and when the route belonging to the carried route instance number is included, Calculating the path according to the carried route instance number; when the path belonging to the carried route instance number is not included, traversing the route instance number of the node to calculate the path; sending the carried path and the route instance number to which it belongs
  • the RSVP-TE packet is sent to the next hop node.
  • the embodiment of the present disclosure further provides a message processing apparatus, including a path calculation unit and a sending unit, wherein: the path calculating unit is configured to calculate a path of the node to which the node belongs to the next hop node, and calculate the path and the path to which it belongs.
  • the routing instance number is output to the sending unit, and the sending unit is configured to send the RSVP-TE packet carrying the calculated path and the route instance number to which it belongs to the next hop node.
  • FIG. 1 is a schematic structural diagram of dividing a physical device into multiple logical devices by using an exclusive port mode in some cases
  • FIG. 2 is a schematic structural diagram of dividing a physical device into multiple logical devices by using a shared port mode in some cases
  • FIG. 3 is a schematic flowchart of a packet processing method according to an embodiment of the present disclosure
  • FIG. 4 is a schematic structural diagram of a message processing apparatus according to a first embodiment of the present disclosure
  • FIG. 5 is a schematic structural diagram of a message processing apparatus according to a second embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of a type-Length-Value (TLV) of a route instance number according to an alternative embodiment of the present disclosure
  • FIG. 7 is a schematic flowchart of processing when receiving an RSVP-TE packet according to an optional embodiment of the present disclosure
  • FIG. 8 is a schematic flowchart of processing when an RSVP-TE packet is sent according to an optional embodiment of the present disclosure
  • FIG. 9 is a schematic structural diagram of dividing a physical device into multiple logical devices by using a shared port mode according to an alternative embodiment of the present disclosure.
  • the entire tunnel path is preferably located in the same Route Instance.
  • the header is assumed.
  • Point path calculation selects the path of instance 1.
  • the instance number selected by itself is not transmitted to the downstream node.
  • the downstream node has a loose node, the path needs to be calculated at the loose node.
  • the loose node can select The path of the instance 1 can also be selected as the path of the instance 2. Therefore, in the routing multi-instance environment, the paths of the same tunnel may be in different instances, and the route isolation effect is not achieved.
  • a message processing method may include the following steps:
  • Step 301 When the node needs to calculate the path, it is detected whether there is a received RSVP-TE packet and the received RSVP-TE packet carries the routing instance number.
  • Step 302 When there is a received RSVP-TE packet and the received RSVP-TE packet carries the route instance number, it is detected whether the path of the node to the next hop node includes the route instance number that belongs to the carried Path; when included, go to step 303; when not included, go to step 304;
  • Step 303 Calculate the path according to the carried route instance number, and go to step 305;
  • Step 304 traverse the route instance number calculation path of the node
  • Step 305 Send an RSVP-TE packet carrying the calculated path and the route instance number to which it belongs to the next hop node.
  • the packet processing method further includes: traversing the routing instance number of the node when there is no received RSVP-TE packet, or the received RSVP-TE packet does not carry the routing instance number. Calculate the path.
  • the packet processing method further includes: after step 301, when there is no received RSVP-TE packet, or the received RSVP-TE packet does not carry the routing instance number, step 304 is performed.
  • the packet processing method further includes: when the node does not need to calculate a path, forward the received RSVP-TE packet to the next hop node.
  • the received RSVP-TE packet may include a routing instance number or may not include a routing instance number.
  • the packet processing method further includes: when the node needs to calculate a backup path, detecting whether the path of the node to the next hop node includes other routing instances belonging to the primary path, except the primary path.
  • the path of the number; when included, the backup path is calculated according to the route instance number of the primary path; when not included, the route instance number of the node is traversed to calculate the backup path.
  • the present disclosure also discloses a computer readable storage medium storing one or more programs, the one or more programs being executable by one or more processors to implement the following steps:
  • the node checks whether there is a received RSVP-TE packet and whether the received RSVP-TE packet carries the route instance number; if there is a received RSVP-TE packet and the received RSVP- If the path of the route to the next hop node is included in the TE packet, the path of the route to the next hop node is included in the path of the route instance number.
  • the route instance number calculation path is carried; when the route belonging to the carried route instance number is not included, the route instance number of the node is traversed; the RSVP carrying the calculated path and the route instance number to which it belongs is sent. - TE message to the next hop node.
  • the one or more programs may be executed by one or more processors to implement the following steps: when there is no received RSVP-TE message, or there is no received RSVP-TE message When carrying the route instance number, it traverses the route instance number calculation path of the node.
  • the one or more programs may be executed by one or more processors to implement the following steps: when the node does not need to calculate a path, forward the received RSVP-TE message directly to the next Jump the node.
  • the received RSVP-TE packet may include a routing instance number or may not include a routing instance number.
  • the one or more programs may also be executed by one or more processors to implement the following steps: when the node needs to calculate a backup path, detect the path of the node to the next hop node except the main Outside the path, whether the path of the route instance number of the primary path is included; when included, the backup path is calculated according to the route instance number of the primary path; when not included, the route instance number of the node is traversed to calculate the backup path.
  • a message processing apparatus may include a path calculation unit 401 and a sending unit 402, wherein: the path calculation unit 401 is configured to calculate a path of a node to which the node belongs to the next hop node, and The calculated path and the route instance number to which it belongs are output to the sending unit 402.
  • the sending unit 402 is configured to send the RSVP-TE packet carrying the calculated path and the route instance number to which it belongs to the next hop node.
  • the packet processing apparatus further includes a receiving unit 403, where: the receiving unit 403 is configured to receive an RSVP-TE packet, and detect, according to the received RSVP-TE packet, whether the node to which the node belongs The path calculation unit 401 is required to calculate the path, and the path calculation unit 401 is configured to calculate the path; and the route instance number is received in the received RSVP-TE message.
  • the path calculation unit 401 is further configured to receive the notification and output route instance number of the receiving unit 403, and detect whether the path of the node to which the node belongs to the next hop node includes the path belonging to the carried route instance number, when When the path of the carried route instance number is the path, the path is calculated according to the carried route instance number; when the path belonging to the carried route instance number is not included, the route instance number calculation path of the node to which the node belongs is traversed.
  • the path calculation unit 401 is further configured to: when the notification of the receiving unit 403 is not received, or when the routing instance number output by the receiving unit 403 is not received, traverse the routing instance number of the node to which the node belongs.
  • the receiving unit 403 is further configured to output the received RSVP-TE message directly to the sending unit 402 when the node to which the node belongs does not need to calculate the path; the sending unit 402 is further configured to: The received RSVP-TE packet is directly forwarded to the next hop node.
  • the path calculation unit 401 is further configured to: when the node to which the node belongs needs to calculate the backup path, detect whether the path of the node to which the node belongs to the next hop node includes other routes belonging to the primary path, except the primary path. Path of the instance number; when included, the backup path is calculated according to the route instance number of the primary path; when not included, the route instance number of the node is traversed to calculate the backup path.
  • a node When a node performs path calculation, it returns a path and returns the route instance number of the path.
  • the present disclosure may carry the RSVP-TE protocol by carrying the routing instance number in the RSVP-TE tunnel signaling interaction, and carries the routing instance number in the signaling, and defines the length of the protocol number to be 2 bytes.
  • an object can be added or expanded in an existing field.
  • Figure 6 shows the extended TLV structure of the newly added object, and Reserved is a 2-byte reserved field.
  • the path calculation is optionally performed in the instance number carried in the signaling.
  • the instance number can be ignored.
  • the path calculation needs to be prioritized in the instance number carried in the signaling.
  • the backup path calculation is performed in the specified route instance according to the local policy by searching the route instance number of the primary path.
  • the processing flow of the RSVP-TE receiving packet is performed according to whether the packet carries the routing instance number information.
  • the node traverses the routing instance number when calculating the path.
  • the path calculation is performed until the path calculation is successful.
  • the node calculates the path number in the packet according to the instance number in the packet.
  • the process of sending the RSVP-TE packet is as shown in Figure 8.
  • the local number is calculated according to whether the local calculation and the upstream packet carry the route instance number. When there is no path calculation, the instance number in the packet does not change. When the local path is calculated, the instance number in the packet is changed to the instance number of the local path and continues to be sent downstream.
  • the multi-instance of the routing type of the port type is established.
  • the tunnel is established from the physical device R1 to the physical device R3, and is loose to the intermediate node R2 (that is, the intermediate node R2 is a loose node).
  • the route instance is divided into: link L12, link L23 belongs to instance 1, link L21, and link L32 belong to instance 2.
  • the destination is R2.
  • the PATH packet sent to the R2 carries the route instance number of the instance 1.
  • the instance number in the read message is 1.
  • the path is calculated to the path of R3, optionally, it can be calculated in instance 1.
  • the calculated path is L23, due to calculation.
  • the path is still instance 1, and when R2 sends a PATH message to R3, the route instance still fills in the value of instance 1.
  • the entire path that the physical device R1 establishes to the physical device R3 is L12 and L23, and belongs to the routing instance 1.
  • the multi-instance of the port type is shared.
  • the tunnel is established from the physical device R1 to the physical device R3 and is loose to the intermediate node R2 (that is, the intermediate node R2 is a loose node).
  • the division of the routing instance is as follows: the link L12, the link L23, and the link L13 belong to the instance 1, and the link L12, the link L23, and the link L31 belong to the instance 2.
  • the links L12 and L23 links are in both instances 1 and 2.
  • the path to the R2 is calculated at the head node R1.
  • the calculated path is the link L12, since the link L12 belongs to the instance 1 and the instance 2, the instance number returned by the path calculation determines the PATH message sent as the R2. Value, in this case returning both instance 1 and instance 2 are possible;
  • the head node R1 sends a PATH message to the intermediate node R2, carrying the route instance number 1 or the route instance number 2;
  • the intermediate node R2 When receiving the PATH message sent by R1, the intermediate node R2 reads the instance number in the packet. When the instance number is 1, and the path is calculated to the path of R3, it can optionally be calculated in the instance 1. The calculated path is L23. When the instance number is 2, the path is calculated to the path of R3, optionally calculated in the example 2, and the calculated path is the link L23;
  • R2 sends a PATH message to R3
  • the routing instance fills in the instance number of the local node path.
  • the entire path established by R1 to R3 is link L12 and link L23, belonging to route instance 1 or instance 2.
  • the path calculation can be performed according to the route instance number adopted by the primary path.
  • the route instance 1 is also used for calculation, so that the calculated path is the link L13.
  • the primary path is the link L12 and the link L23
  • the backup path is the link L13, which belongs to the routing instance 1.
  • Embodiments of the present disclosure also provide a computer readable storage medium storing computer executable instructions that, when executed, implement the message processing method described above.
  • the message processing method and apparatus and the computer readable storage medium provided by the present disclosure transmit an RSVP-TE message carrying a route instance number to which the path calculated by the local node belongs to the next hop node and preferentially follow the received RSVP-TE.
  • the routing instance number carried in the packet calculates the path, so that in the routing multi-instance environment, the path of the same tunnel is located in the same instance as much as possible, or even the largest possible, thus truly achieving the effect of route isolation.
  • the message processing method and apparatus and the computer readable storage medium provided by the present disclosure transmit an RSVP-TE message carrying a route instance number to which the path calculated by the local node belongs to the next hop node and preferentially follow the received RSVP-TE.
  • the routing instance number carried in the packet calculates the path, so that in the routing multi-instance environment, the downstream node can perform related path calculation with reference, so that the path of the same tunnel is located in the same instance as much as possible, and thus the real The effect of route isolation.
  • computer storage medium includes volatile and nonvolatile, implemented in any method or technology for storing information, such as computer readable instructions, data structures, program modules or other data. Sex, removable and non-removable media.
  • Computer storage media include, but are not limited to, Random Access Memory (RAM), Read-Only Memory (ROM), and Electrically Erasable Programmable Read-only Memory (EEPROM). Flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical disc storage, magnetic cassette, magnetic tape, disk storage or other magnetic storage device, or Any other medium used to store the desired information and that can be accessed by the computer.
  • communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and can include any information delivery media. .

Landscapes

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

Abstract

A message processing method, which comprises: when a node needs to calculate a path, detecting whether there is a received RSVP-TE message and whether the message carries a routing instance number (301); when such message exists and carries the routing instance number, detecting whether a path from the node to a next node comprises a path pertaining to the carried routing instance number, and if so, calculating a path according to the carried routing instance number (302); if not, traversing the routing instance number of the node to calculate a path (303); and sending to the next node the RSVP-TE message carrying the calculated path and the routing instance number to which the path pertains (304).

Description

一种报文处理方法和装置、计算机可读存储介质Message processing method and device, computer readable storage medium 技术领域Technical field
本公开涉及但不限于通信技术领域,尤其是一种报文处理方法和装置、计算机可读存储介质。The present disclosure relates to, but is not limited to, the field of communication technologies, and in particular, to a message processing method and apparatus, and a computer readable storage medium.
背景技术Background technique
基于流量工程的资源预留协议(Resource Reservation Protocol-Traffic Engineer,RSVP-TE)是对传统的资源预留协议(Resource Reservation Protocol,RSVP)的扩展,用于在多协议标签交换(Multi-Protocol Label Switching,MPLS)/IP(Internet Protocol)网络中实现流量工程,通过信息发布、路径计算、信令交互、流量的转发实现业务流量在TE(Traffic Engineer)隧道中的转发。The Resource Reservation Protocol-Traffic Engineer (RSVP-TE) is an extension of the traditional Resource Reservation Protocol (RSVP) for multi-protocol label switching. The traffic engineering is implemented in the Switching (MPLS)/IP (Internet Protocol) network. The traffic is forwarded in the Traffic Engineer (TE) tunnel through the information release, path calculation, signaling interaction, and traffic forwarding.
路径计算依赖于基于流量工程的内部网关协议(Interior Gateway Protocol-Traffic Engineering,IGP-TE)对TE链路以及属性的洪泛,形成TE数据库,然后通过基于约束最短路径优先(Constrained Shortest Path First,CSPF)算法,计算出一条隧道的路径信息。IGP-TE大致包括开放式最短路径优先(Open Shortest Path First,OSPF)和中间系统到中间系统(Intermediate system to intermediate system,ISIS)两种协议对于TE的扩展。The path calculation relies on the traffic engineering-based Interior Gateway Protocol-Import Engineering (IGP-TE) flooding of TE links and attributes to form a TE database, and then through Constrained Shortest Path First (Constrained Shortest Path First, The CSPF algorithm calculates the path information of a tunnel. IGP-TE generally includes extensions of TE for Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (ISIS).
随着网络的应用和发展,内部网关协议(Interior Gateway Protocol,IGP)内部通过实例号来逻辑上划分网络,通过实例号可以将一台物理设备划分为多台逻辑设备,目前存在两种划分方式:With the application and development of the network, the internal gateway protocol (IGP) internally divides the network logically by the instance number. The physical number of the physical device can be divided into multiple logical devices by using the instance number. Currently, there are two types of division. :
第一种:通过独占端口方式划分;The first type: divided by exclusive port mode;
如图1所示,三台物理设备R1、R2、R3,通过在每台设备上划分实例1和实例2,可以将设备分成两台逻辑设备,链路L12和链路L23属于实例1,链路L21和链路L32属于实例2,每一台设备都划分为两台逻辑设备;As shown in Figure 1, three physical devices R1, R2, and R3 can be divided into two logical devices by dividing instance 1 and instance 2 on each device. Link L12 and link L23 belong to instance 1. Road L21 and link L32 belong to instance 2, and each device is divided into two logical devices;
第二种:通过共享端口方式划分;Second: divided by shared port mode;
如图2所示,三台物理设备R1、R2、R3,同样通过每台设备配置路由 实例1和路由实例2,将设备划分为两台逻辑设备,与第一种方式不同的是,链路L12和链路L23同属于实例1和实例2,这种划分更能体现逻辑意义上的区分。As shown in Figure 2, three physical devices, R1, R2, and R3, are also configured with routing instance 1 and routing instance 2 for each device to divide the device into two logical devices. The first method is the link. L12 and link L23 belong to both instance 1 and instance 2. This division is more logically distinguishable.
按照隔离的特征,整条隧道路径最好位于同一个路由实例中。According to the characteristics of the isolation, the entire tunnel path is preferably located in the same routing instance.
发明概述Summary of invention
本公开提供了一种报文处理方法和装置、计算机可读存储介质,能够使得整条隧道的路径尽可能地位于同一个路由实例中。The present disclosure provides a message processing method and apparatus, and a computer readable storage medium, which enables a path of an entire tunnel to be located in the same routing instance as much as possible.
本公开实施例的技术方案是这样实现的:The technical solution of the embodiment of the present disclosure is implemented as follows:
本公开实施例提供了一种报文处理方法,包括:当节点需要计算路径时,检测是否有已接收的RSVP-TE报文且已接收的RSVP-TE报文中是否携带路由实例号;当有已接收的RSVP-TE报文且已接收的RSVP-TE报文中携带路由实例号时,检测所述节点到下一跳节点的路径是否包括属于所述携带的路由实例号的路径,当包括属于所述携带的路由实例号的路径时,按照所述携带的路由实例号计算路径;当不包括属于所述携带的路由实例号的路径时,遍历所述节点的路由实例号计算路径;发送携带计算出的路径及其所属的路由实例号的RSVP-TE报文至下一跳节点。An embodiment of the present disclosure provides a packet processing method, including: when a node needs to calculate a path, detecting whether there is a received RSVP-TE packet and whether the received RSVP-TE packet carries a routing instance number; When there is a received RSVP-TE packet and the received RSVP-TE packet carries the route instance number, it is detected whether the path of the node to the next hop node includes the path belonging to the carried route instance number. When the path belongs to the carried route instance number, the path is calculated according to the carried route instance number; when the path belonging to the carried route instance number is not included, the route instance number calculation path of the node is traversed; Send an RSVP-TE packet carrying the calculated path and its associated route instance number to the next hop node.
本公开实施例还提供了一种计算机可读存储介质,所述计算机可读存储介质存储有一个或者多个程序,所述一个或者多个程序可被一个或者多个处理器执行,以实现以下步骤:当节点需要计算路径时,检测是否有已接收的RSVP-TE报文且已接收的RSVP-TE报文中是否携带路由实例号;当有已接收的RSVP-TE报文且已接收的RSVP-TE报文中携带路由实例号时,检测所述节点到下一跳节点的路径是否包括属于所述携带的路由实例号的路径,当包括属于所述携带的路由实例号的路径时,按照所述携带的路由实例号计算路径;当不包括属于所述携带的路由实例号的路径时,遍历所述节点的路由实例号计算路径;发送携带计算出的路径及其所属的路由实例号的RSVP-TE报文至下一跳节点。Embodiments of the present disclosure also provide a computer readable storage medium storing one or more programs, the one or more programs being executable by one or more processors to implement the following Step: When the node needs to calculate the path, it detects whether there is a received RSVP-TE packet and the received RSVP-TE packet carries the route instance number; if there is a received RSVP-TE packet and has received When the RSVP-TE packet carries the route instance number, it is detected whether the path of the node to the next hop node includes the path belonging to the carried route instance number, and when the route belonging to the carried route instance number is included, Calculating the path according to the carried route instance number; when the path belonging to the carried route instance number is not included, traversing the route instance number of the node to calculate the path; sending the carried path and the route instance number to which it belongs The RSVP-TE packet is sent to the next hop node.
本公开实施例还提供了一种报文处理装置,包括路径计算单元和发送单 元,其中:路径计算单元,设置为计算自身所属节点到下一跳节点的路径,将计算出的路径及其所属的路由实例号输出至发送单元;发送单元,设置为发送携带计算出的路径及其所属的路由实例号的RSVP-TE报文至下一跳节点。The embodiment of the present disclosure further provides a message processing apparatus, including a path calculation unit and a sending unit, wherein: the path calculating unit is configured to calculate a path of the node to which the node belongs to the next hop node, and calculate the path and the path to which it belongs. The routing instance number is output to the sending unit, and the sending unit is configured to send the RSVP-TE packet carrying the calculated path and the route instance number to which it belongs to the next hop node.
附图概述BRIEF abstract
图1为在一些情形下,通过独占端口方式,将一台物理设备划分为多台逻辑设备的结构示意图;FIG. 1 is a schematic structural diagram of dividing a physical device into multiple logical devices by using an exclusive port mode in some cases;
图2为在一些情形下,通过共享端口方式,将一台物理设备划分为多台逻辑设备的结构示意图;2 is a schematic structural diagram of dividing a physical device into multiple logical devices by using a shared port mode in some cases;
图3为本公开实施例的一种报文处理方法的流程示意图;FIG. 3 is a schematic flowchart of a packet processing method according to an embodiment of the present disclosure;
图4为本公开第一实施例的一种报文处理装置的结构示意图;4 is a schematic structural diagram of a message processing apparatus according to a first embodiment of the present disclosure;
图5为本公开第二实施例的一种报文处理装置的结构示意图;FIG. 5 is a schematic structural diagram of a message processing apparatus according to a second embodiment of the present disclosure;
图6为本公开可选实施例的一种路由实例号的扩展的类型-长度-值(Type-Length-Value,TLV)结构示意图;FIG. 6 is a schematic structural diagram of a type-Length-Value (TLV) of a route instance number according to an alternative embodiment of the present disclosure;
图7为本公开可选实施例的一种接收RSVP-TE报文时的处理流程示意图;FIG. 7 is a schematic flowchart of processing when receiving an RSVP-TE packet according to an optional embodiment of the present disclosure;
图8为本公开可选实施例的一种发送RSVP-TE报文时的处理流程示意图;FIG. 8 is a schematic flowchart of processing when an RSVP-TE packet is sent according to an optional embodiment of the present disclosure;
图9为本公开可选实施例的通过共享端口方式,将一台物理设备划分为多台逻辑设备的结构示意图。FIG. 9 is a schematic structural diagram of dividing a physical device into multiple logical devices by using a shared port mode according to an alternative embodiment of the present disclosure.
详述Detailed
下面结合附图对本公开的实施方式进行描述。Embodiments of the present disclosure will be described below with reference to the accompanying drawings.
在一些情形下,按照隔离的特征,整条隧道路径最好位于同一个路由实例(Route Instance)中,但是,在一些情形下,RSVP-TE部署在路由多实例的环境中时,假设头结点路径计算选择实例1的路径,但是,发送信令时没 有将自身所选择的实例号传输至下游节点,当下游节点存在松散节点时,需要在松散节点计算路径,此时,松散节点可以选择实例1的路径,也可以选择实例2的路径,所以导致在路由多实例环境中,同一条隧道的路径可能位于不同的实例中,达不到路由隔离的效果。In some cases, according to the characteristics of isolation, the entire tunnel path is preferably located in the same Route Instance. However, in some cases, when RSVP-TE is deployed in the environment of routing multiple instances, the header is assumed. Point path calculation selects the path of instance 1. However, when sending signaling, the instance number selected by itself is not transmitted to the downstream node. When the downstream node has a loose node, the path needs to be calculated at the loose node. At this time, the loose node can select The path of the instance 1 can also be selected as the path of the instance 2. Therefore, in the routing multi-instance environment, the paths of the same tunnel may be in different instances, and the route isolation effect is not achieved.
如图3所示,根据本公开的一种报文处理方法,可以包括如下步骤:As shown in FIG. 3, a message processing method according to the present disclosure may include the following steps:
步骤301:当节点需要计算路径时,检测是否有已接收的RSVP-TE报文且已接收的RSVP-TE报文中是否携带路由实例号;Step 301: When the node needs to calculate the path, it is detected whether there is a received RSVP-TE packet and the received RSVP-TE packet carries the routing instance number.
步骤302:当有已接收的RSVP-TE报文且已接收的RSVP-TE报文中携带路由实例号时,检测所述节点到下一跳节点的路径是否包括属于所述携带的路由实例号的路径;当包括时,转到步骤303;当不包括时,转到步骤304;Step 302: When there is a received RSVP-TE packet and the received RSVP-TE packet carries the route instance number, it is detected whether the path of the node to the next hop node includes the route instance number that belongs to the carried Path; when included, go to step 303; when not included, go to step 304;
步骤303:按照所述携带的路由实例号计算路径,转到步骤305;Step 303: Calculate the path according to the carried route instance number, and go to step 305;
步骤304:遍历所述节点的路由实例号计算路径;Step 304: traverse the route instance number calculation path of the node;
步骤305:发送携带计算出的路径及其所属的路由实例号的RSVP-TE报文至下一跳节点。Step 305: Send an RSVP-TE packet carrying the calculated path and the route instance number to which it belongs to the next hop node.
可选地,所述报文处理方法还包括:当没有已接收的RSVP-TE报文,或者,已接收的RSVP-TE报文中没有携带路由实例号时,遍历所述节点的路由实例号计算路径。Optionally, the packet processing method further includes: traversing the routing instance number of the node when there is no received RSVP-TE packet, or the received RSVP-TE packet does not carry the routing instance number. Calculate the path.
可选地,所述报文处理方法还包括:步骤301之后,当没有已接收的RSVP-TE报文,或者,已接收的RSVP-TE报文中没有携带路由实例号时,执行步骤304。Optionally, the packet processing method further includes: after step 301, when there is no received RSVP-TE packet, or the received RSVP-TE packet does not carry the routing instance number, step 304 is performed.
可选地,所述报文处理方法还包括:当所述节点不需要计算路径时,将接收的RSVP-TE报文直接转发至下一跳节点。Optionally, the packet processing method further includes: when the node does not need to calculate a path, forward the received RSVP-TE packet to the next hop node.
可以说明的是,所述接收的RSVP-TE报文可以包括路由实例号,也可以不包括路由实例号。It can be noted that the received RSVP-TE packet may include a routing instance number or may not include a routing instance number.
可选地,所述报文处理方法还包括:当所述节点需要计算备份路径时,检测所述节点到下一跳节点的路径除主路径外,是否包括其它属于所述主路径的路由实例号的路径;当包括时,按照主路径的路由实例号计算备份路径;当不包括时,遍历所述节点的路由实例号计算备份路径。Optionally, the packet processing method further includes: when the node needs to calculate a backup path, detecting whether the path of the node to the next hop node includes other routing instances belonging to the primary path, except the primary path. The path of the number; when included, the backup path is calculated according to the route instance number of the primary path; when not included, the route instance number of the node is traversed to calculate the backup path.
本公开还公开了一种计算机可读存储介质,所述计算机可读存储介质存储有一个或者多个程序,所述一个或者多个程序可被一个或者多个处理器执行,以实现以下步骤:当节点需要计算路径时,检测是否有已接收的RSVP-TE报文且已接收的RSVP-TE报文中是否携带路由实例号;当有已接收的RSVP-TE报文且已接收的RSVP-TE报文中携带路由实例号时,检测所述节点到下一跳节点的路径是否包括属于所述携带的路由实例号的路径,当包括属于所述携带的路由实例号的路径时,按照所述携带的路由实例号计算路径;当不包括属于所述携带的路由实例号的路径时,遍历所述节点的路由实例号计算路径;发送携带计算出的路径及其所属的路由实例号的RSVP-TE报文至下一跳节点。The present disclosure also discloses a computer readable storage medium storing one or more programs, the one or more programs being executable by one or more processors to implement the following steps: When the node needs to calculate the path, it checks whether there is a received RSVP-TE packet and whether the received RSVP-TE packet carries the route instance number; if there is a received RSVP-TE packet and the received RSVP- If the path of the route to the next hop node is included in the TE packet, the path of the route to the next hop node is included in the path of the route instance number. The route instance number calculation path is carried; when the route belonging to the carried route instance number is not included, the route instance number of the node is traversed; the RSVP carrying the calculated path and the route instance number to which it belongs is sent. - TE message to the next hop node.
可选地,所述一个或者多个程序还可被一个或者多个处理器执行,以实现以下步骤:当没有已接收的RSVP-TE报文,或者,已接收的RSVP-TE报文中没有携带路由实例号时,遍历所述节点的路由实例号计算路径。Optionally, the one or more programs may be executed by one or more processors to implement the following steps: when there is no received RSVP-TE message, or there is no received RSVP-TE message When carrying the route instance number, it traverses the route instance number calculation path of the node.
可选地,所述一个或者多个程序还可被一个或者多个处理器执行,以实现以下步骤:当所述节点不需要计算路径时,将接收的RSVP-TE报文直接转发至下一跳节点。Optionally, the one or more programs may be executed by one or more processors to implement the following steps: when the node does not need to calculate a path, forward the received RSVP-TE message directly to the next Jump the node.
可以说明的是,所述接收的RSVP-TE报文可以包括路由实例号,也可以不包括路由实例号。It can be noted that the received RSVP-TE packet may include a routing instance number or may not include a routing instance number.
可选地,所述一个或者多个程序还可被一个或者多个处理器执行,以实现以下步骤:当所述节点需要计算备份路径时,检测所述节点到下一跳节点的路径除主路径外,是否包括其它属于所述主路径的路由实例号的路径;当包括时,按照主路径的路由实例号计算备份路径;当不包括时,遍历所述节点的路由实例号计算备份路径。Optionally, the one or more programs may also be executed by one or more processors to implement the following steps: when the node needs to calculate a backup path, detect the path of the node to the next hop node except the main Outside the path, whether the path of the route instance number of the primary path is included; when included, the backup path is calculated according to the route instance number of the primary path; when not included, the route instance number of the node is traversed to calculate the backup path.
如图4所示,根据本公开的一种报文处理装置,可以包括路径计算单元401和发送单元402,其中:路径计算单元401,设置为计算自身所属节点到下一跳节点的路径,将计算出的路径及其所属的路由实例号输出至发送单元402;发送单元402,设置为发送携带计算出的路径及其所属的路由实例号的RSVP-TE报文至下一跳节点。As shown in FIG. 4, a message processing apparatus according to the present disclosure may include a path calculation unit 401 and a sending unit 402, wherein: the path calculation unit 401 is configured to calculate a path of a node to which the node belongs to the next hop node, and The calculated path and the route instance number to which it belongs are output to the sending unit 402. The sending unit 402 is configured to send the RSVP-TE packet carrying the calculated path and the route instance number to which it belongs to the next hop node.
可选地,如图5所示,所述报文处理装置还包括接收单元403,其中: 接收单元403,设置为接收RSVP-TE报文,根据接收的RSVP-TE报文检测自身所属节点是否需要计算路径,当需要计算路径时,通知路径计算单元401计算路径;并检测接收的RSVP-TE报文中是否携带路由实例号,当携带时,将携带的路由实例号输出至路径计算单元401;所述路径计算单元401,还设置为接收接收单元403的通知和输出的路由实例号,检测自身所属节点到下一跳节点的路径是否包括属于所述携带的路由实例号的路径,当包括属于所述携带的路由实例号的路径时,按照所述携带的路由实例号计算路径;当不包括属于所述携带的路由实例号的路径时,遍历自身所属节点的路由实例号计算路径。Optionally, as shown in FIG. 5, the packet processing apparatus further includes a receiving unit 403, where: the receiving unit 403 is configured to receive an RSVP-TE packet, and detect, according to the received RSVP-TE packet, whether the node to which the node belongs The path calculation unit 401 is required to calculate the path, and the path calculation unit 401 is configured to calculate the path; and the route instance number is received in the received RSVP-TE message. The path calculation unit 401 is further configured to receive the notification and output route instance number of the receiving unit 403, and detect whether the path of the node to which the node belongs to the next hop node includes the path belonging to the carried route instance number, when When the path of the carried route instance number is the path, the path is calculated according to the carried route instance number; when the path belonging to the carried route instance number is not included, the route instance number calculation path of the node to which the node belongs is traversed.
可选地,所述路径计算单元401还设置为:当没有接收到接收单元403的通知,或者没有接收到接收单元403输出的路由实例号时,遍历自身所属节点的路由实例号计算路径。Optionally, the path calculation unit 401 is further configured to: when the notification of the receiving unit 403 is not received, or when the routing instance number output by the receiving unit 403 is not received, traverse the routing instance number of the node to which the node belongs.
可选地,所述接收单元403还设置为:当自身所属节点不需要计算路径时,将接收的RSVP-TE报文直接输出至所述发送单元402;所述发送单元402还设置为:将接收的RSVP-TE报文直接转发至下一跳节点。Optionally, the receiving unit 403 is further configured to output the received RSVP-TE message directly to the sending unit 402 when the node to which the node belongs does not need to calculate the path; the sending unit 402 is further configured to: The received RSVP-TE packet is directly forwarded to the next hop node.
可选地,所述路径计算单元401还设置为:当自身所属节点需要计算备份路径时,检测自身所属节点到下一跳节点的路径除主路径外,是否包括其它属于所述主路径的路由实例号的路径;当包括时,按照主路径的路由实例号计算备份路径;当不包括时,遍历所述节点的路由实例号计算备份路径。Optionally, the path calculation unit 401 is further configured to: when the node to which the node belongs needs to calculate the backup path, detect whether the path of the node to which the node belongs to the next hop node includes other routes belonging to the primary path, except the primary path. Path of the instance number; when included, the backup path is calculated according to the route instance number of the primary path; when not included, the route instance number of the node is traversed to calculate the backup path.
本公开实施例还提供了几个可选的实施例对本公开进行解释,以便更好的描述本公开。The present disclosure is also provided with a few alternative embodiments to explain the present disclosure in order to better describe the present disclosure.
一可选实施例An alternative embodiment
①路径计算,返回路径的同时,返回路径的实例号;1 path calculation, returning the path, while returning the instance number of the path;
节点进行路径计算的时候,返回一条路径的同时,返回该路径所在的路由实例号。When a node performs path calculation, it returns a path and returns the route instance number of the path.
②扩展RSVP-TE协议,携带路由实例号,在RSVP-TE隧道信令交互中携带路由实例号;2 extending the RSVP-TE protocol, carrying the routing instance number, and carrying the routing instance number in the signaling interaction of the RSVP-TE tunnel;
可以说明的是,在一些情形下,本公开在RSVP-TE隧道信令交互中携 带路由实例号可以扩展RSVP-TE协议,在信令中携带路由实例号,定义协议号的长度为2字节,与路由实例号的一致,可以新增对象或者在已有字段中扩展,图6所示为新增对象的扩展TLV结构,预留(Reserved)为2字节保留字段。It can be noted that, in some cases, the present disclosure may carry the RSVP-TE protocol by carrying the routing instance number in the RSVP-TE tunnel signaling interaction, and carries the routing instance number in the signaling, and defines the length of the protocol number to be 2 bytes. In accordance with the routing instance number, an object can be added or expanded in an existing field. Figure 6 shows the extended TLV structure of the newly added object, and Reserved is a 2-byte reserved field.
③对于RSVP-TE报文中路由实例号的处理,当节点需要路径计算时,可选地,需要优先考虑在信令携带的实例号中进行路径计算。For the processing of the routing instance number in the RSVP-TE packet, when the node needs the path calculation, the path calculation is optionally performed in the instance number carried in the signaling.
当节点不需要路径计算时,可以忽略该实例号;当节点需要路径计算时,可选地,路径计算的时候需要优先考虑在信令携带的实例号中进行路径计算。When the node does not need the path calculation, the instance number can be ignored. When the node needs the path calculation, the path calculation needs to be prioritized in the instance number carried in the signaling.
④根据本地策略,计算备份路径的时候,通过查找主路径的路由实例号,使备份路径计算根据本地策略在指定的路由实例中进行计算。4 When calculating the backup path according to the local policy, the backup path calculation is performed in the specified route instance according to the local policy by searching the route instance number of the primary path.
另一可选实施例Another alternative embodiment
RSVP-TE接收报文的处理流程,如图7所示,根据报文中是否携带路由实例号的信息分别进行相应的处理:当不携带时,节点计算路径的时候按照路由实例号遍历的方式进行路径计算,直至路径计算成功;当携带时,节点在路径计算的时候优先按照报文中的实例号进行计算。The processing flow of the RSVP-TE receiving packet, as shown in Figure 7, is performed according to whether the packet carries the routing instance number information. When not carrying, the node traverses the routing instance number when calculating the path. The path calculation is performed until the path calculation is successful. When carrying, the node calculates the path number in the packet according to the instance number in the packet.
RSVP-TE报文发送处理流程,如图8所示,根据本地是否计算以及上游报文是否携带路由实例号分别进行相应处理:当本地没有路径计算时,报文中的实例号不变,继续发往下游;当本地有路径计算时,报文中的实例号修改为本地路径计算成功的实例号,继续发往下游。The process of sending the RSVP-TE packet is as shown in Figure 8. The local number is calculated according to whether the local calculation and the upstream packet carry the route instance number. When there is no path calculation, the instance number in the packet does not change. When the local path is calculated, the instance number in the packet is changed to the instance number of the local path and continues to be sent downstream.
又一可选实施例:Yet another alternative embodiment:
如图1所示,独占端口类型的路由多实例,隧道从物理设备R1建立到物理设备R3,松散到中间节点R2(即中间节点R2为松散节点)。路由实例的划分为:链路L12、链路L23属于实例1,链路L21、链路L32属于实例2。As shown in Figure 1, the multi-instance of the routing type of the port type is established. The tunnel is established from the physical device R1 to the physical device R3, and is loose to the intermediate node R2 (that is, the intermediate node R2 is a loose node). The route instance is divided into: link L12, link L23 belongs to instance 1, link L21, and link L32 belong to instance 2.
在R1路径计算的时候,目的地是R2,当选择的路径是实例1的L12时,在发往R2的PATH报文中携带实例1的路由实例号;When the R1 path is calculated, the destination is R2. When the selected path is the L12 of the instance 1, the PATH packet sent to the R2 carries the route instance number of the instance 1.
R2接收到R1发出的PATH消息时,读取报文中的实例号为1,路径计算至R3的路径时,可选地,可以在实例1中计算,经过计算得到的路径为L23,由于计算的路径仍然为实例1,R2向R3发送PATH消息的时候,路 由实例仍然填实例1的数值。When R2 receives the PATH message sent by R1, the instance number in the read message is 1. When the path is calculated to the path of R3, optionally, it can be calculated in instance 1. The calculated path is L23, due to calculation. The path is still instance 1, and when R2 sends a PATH message to R3, the route instance still fills in the value of instance 1.
这样物理设备R1建立到物理设备R3的整个路径为L12、L23,属于路由实例1。Thus, the entire path that the physical device R1 establishes to the physical device R3 is L12 and L23, and belongs to the routing instance 1.
再一可选实施例:Yet another optional embodiment:
如图9所示,共享端口类型的路由多实例,隧道从物理设备R1建立到物理设备R3,松散到中间节点R2(即中间节点R2为松散节点)。路由实例的划分为:链路L12、链路L23及链路L13属于实例1,链路L12、链路L23、链路L31属于实例2。链路L12和L23链路同时在实例1和实例2中。As shown in Figure 9, the multi-instance of the port type is shared. The tunnel is established from the physical device R1 to the physical device R3 and is loose to the intermediate node R2 (that is, the intermediate node R2 is a loose node). The division of the routing instance is as follows: the link L12, the link L23, and the link L13 belong to the instance 1, and the link L12, the link L23, and the link L31 belong to the instance 2. The links L12 and L23 links are in both instances 1 and 2.
在头结点R1计算到R2的路径,当计算的路径为链路L12时,由于链路L12同属于实例1和实例2,根据路径计算返回的实例号来决定发送为R2的PATH消息携带的值,这种情况返回实例1和实例2都是可能的;The path to the R2 is calculated at the head node R1. When the calculated path is the link L12, since the link L12 belongs to the instance 1 and the instance 2, the instance number returned by the path calculation determines the PATH message sent as the R2. Value, in this case returning both instance 1 and instance 2 are possible;
头结点R1向中间节点R2发送PATH消息,携带路由实例号1或者路由实例号2;The head node R1 sends a PATH message to the intermediate node R2, carrying the route instance number 1 or the route instance number 2;
中间节点R2接收到R1发出的PATH消息时,读取报文中的实例号,当实例号为1,路径计算至R3的路径时,可选地可以在实例1中计算,经过计算路径为L23;当实例号为2,路径计算至R3的路径时,可选地可以在实例2中计算,经过计算路径为链路L23;When receiving the PATH message sent by R1, the intermediate node R2 reads the instance number in the packet. When the instance number is 1, and the path is calculated to the path of R3, it can optionally be calculated in the instance 1. The calculated path is L23. When the instance number is 2, the path is calculated to the path of R3, optionally calculated in the example 2, and the calculated path is the link L23;
R2向R3发送PATH消息的时候,路由实例填写本地节点路径计算成功的实例号。这样R1建立到R3的整个路径为链路L12、链路L23,属于路由实例1或者实例2。When R2 sends a PATH message to R3, the routing instance fills in the instance number of the local node path. Thus, the entire path established by R1 to R3 is link L12 and link L23, belonging to route instance 1 or instance 2.
为上述路径建立一条备份路径的时候,可以根据主路径所采用的路由实例号进行路径计算。When a backup path is created for the above path, the path calculation can be performed according to the route instance number adopted by the primary path.
在R1节点,当主路径确定是用实例1计算成功时,在R1节点计算备份路径的时候,同样采用路由实例1进行计算,这样计算出来的路径为链路L13。On the R1 node, when the primary path is determined to be successful with the instance 1, when the R1 node calculates the backup path, the route instance 1 is also used for calculation, so that the calculated path is the link L13.
这样主路径为链路L12、链路L23,备份路径为链路L13,同属于路由实例1中。The primary path is the link L12 and the link L23, and the backup path is the link L13, which belongs to the routing instance 1.
本公开实施例还提供了一种计算机可读存储介质,存储有计算机可执行指令,所述计算机可执行指令被执行时实现上述报文处理方法。Embodiments of the present disclosure also provide a computer readable storage medium storing computer executable instructions that, when executed, implement the message processing method described above.
本公开提供的报文处理方法和装置、计算机可读存储介质,通过发送携带本节点计算出的路径所属的路由实例号的RSVP-TE报文至下一跳节点以及优先按照接收的RSVP-TE报文中携带的路由实例号计算路径,使得在路由多实例环境中,同一条隧道的路径尽可能地、甚至最大可能地位于相同的实例中,从而真正达到路由隔离的效果。The message processing method and apparatus and the computer readable storage medium provided by the present disclosure transmit an RSVP-TE message carrying a route instance number to which the path calculated by the local node belongs to the next hop node and preferentially follow the received RSVP-TE. The routing instance number carried in the packet calculates the path, so that in the routing multi-instance environment, the path of the same tunnel is located in the same instance as much as possible, or even the largest possible, thus truly achieving the effect of route isolation.
本公开提供的报文处理方法和装置、计算机可读存储介质,通过发送携带本节点计算出的路径所属的路由实例号的RSVP-TE报文至下一跳节点以及优先按照接收的RSVP-TE报文中携带的路由实例号计算路径,使得在路由多实例环境中,下游节点可以有参照性的进行相关路径计算,从而使得同一条隧道的路径尽可能地位于相同的实例中,进而真正达到路由隔离的效果。The message processing method and apparatus and the computer readable storage medium provided by the present disclosure transmit an RSVP-TE message carrying a route instance number to which the path calculated by the local node belongs to the next hop node and preferentially follow the received RSVP-TE. The routing instance number carried in the packet calculates the path, so that in the routing multi-instance environment, the downstream node can perform related path calculation with reference, so that the path of the same tunnel is located in the same instance as much as possible, and thus the real The effect of route isolation.
本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序来指令相关硬件完成,所述程序可以存储于计算机可读存储介质中,如只读存储器、磁盘或光盘等。可选地,上述实施例的全部或部分步骤也可以使用一个或多个集成电路来实现,相应地,上述实施例中的每个模块/单元可以采用硬件的形式实现,也可以采用软件功能模块的形式实现。本公开不限制于任何特定形式的硬件和软件的结合。One of ordinary skill in the art will appreciate that all or a portion of the steps described above can be accomplished by a program that instructs the associated hardware, such as a read-only memory, a magnetic or optical disk, and the like. Optionally, all or part of the steps of the foregoing embodiments may also be implemented by using one or more integrated circuits. Accordingly, each module/unit in the foregoing embodiment may be implemented in the form of hardware, or may be implemented by using a software function module. The form is implemented. The present disclosure is not limited to any specific form of combination of hardware and software.
本领域普通技术人员可以理解,上文中所公开方法中的全部或某些步骤、系统、装置中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。在硬件实施方式中,在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分;例如,一个物理组件可以具有多个功能,或者一个功能或步骤可以由若干物理组件合作执行。某些组件或所有组件可以被实施为由处理器,如数字信号处理器或微处理器执行的软件,或者被实施为硬件,或者被实施为集成电路,如专用集成电路。这样的软件可以分布在计算机可读介质上,计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的,术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于随机存取存储器(RAM,Random Access Memory)、只读存储器(ROM,Read-Only Memory)、电可擦除只 读存储器(EEPROM,Electrically Erasable Programmable Read-only Memory)、闪存或其他存储器技术、光盘只读存储器(CD-ROM,Compact Disc Read-Only Memory)、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外,本领域普通技术人员公知的是,通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据,并且可包括任何信息递送介质。Those of ordinary skill in the art will appreciate that all or some of the steps, systems, and functional blocks/units of the methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be composed of several physical The components work together. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on a computer readable medium, which may include computer storage media (or non-transitory media) and communication media (or transitory media). As is well known to those of ordinary skill in the art, the term computer storage medium includes volatile and nonvolatile, implemented in any method or technology for storing information, such as computer readable instructions, data structures, program modules or other data. Sex, removable and non-removable media. Computer storage media include, but are not limited to, Random Access Memory (RAM), Read-Only Memory (ROM), and Electrically Erasable Programmable Read-only Memory (EEPROM). Flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical disc storage, magnetic cassette, magnetic tape, disk storage or other magnetic storage device, or Any other medium used to store the desired information and that can be accessed by the computer. Moreover, it is well known to those skilled in the art that communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and can include any information delivery media. .
本领域的普通技术人员可以理解,可以对本公开的技术方案进行修改或者等同替换,而不脱离本公开技术方案的精神和范围,均应涵盖在本公开的权利要求范围当中。A person skilled in the art can understand that the technical solutions of the present disclosure may be modified or equivalent, without departing from the spirit and scope of the present disclosure, and should be included in the scope of the claims of the present disclosure.

Claims (10)

  1. 一种报文处理方法,其特征在于,包括:A packet processing method, comprising:
    当节点需要计算路径时,检测是否有已接收的基于流量工程的资源预留协议RSVP-TE报文且已接收的RSVP-TE报文中是否携带路由实例号;When the node needs to calculate the path, it detects whether there is a received traffic engineering resource reservation protocol RSVP-TE packet and whether the received RSVP-TE packet carries the routing instance number;
    当有已接收的RSVP-TE报文且已接收的RSVP-TE报文中携带路由实例号时,检测所述节点到下一跳节点的路径是否包括属于所述携带的路由实例号的路径,当包括属于所述携带的路由实例号的路径时,按照所述携带的路由实例号计算路径;当不包括属于所述携带的路由实例号的路径时,遍历所述节点的路由实例号计算路径;When there is a received RSVP-TE packet and the received RSVP-TE packet carries the route instance number, it is detected whether the path of the node to the next hop node includes the path belonging to the carried route instance number. When a path belonging to the carried route instance number is included, the path is calculated according to the carried route instance number; when the path belonging to the carried route instance number is not included, the route instance number calculation path of the node is traversed ;
    发送携带计算出的路径及其所属的路由实例号的RSVP-TE报文至下一跳节点。Send an RSVP-TE packet carrying the calculated path and its associated route instance number to the next hop node.
  2. 根据权利要求1所述的报文处理方法,其特征在于,所述报文处理方法还包括:The packet processing method according to claim 1, wherein the packet processing method further comprises:
    当没有已接收的RSVP-TE报文,或者,已接收的RSVP-TE报文中没有携带路由实例号时,遍历所述节点的路由实例号计算路径。When there is no received RSVP-TE packet, or the received RSVP-TE packet does not carry the routing instance number, the route instance number of the node is traversed.
  3. 根据权利要求1所述的报文处理方法,其特征在于,所述报文处理方法还包括:The packet processing method according to claim 1, wherein the packet processing method further comprises:
    当所述节点不需要计算路径时,将接收的RSVP-TE报文直接转发至下一跳节点。When the node does not need to calculate a path, the received RSVP-TE packet is directly forwarded to the next hop node.
  4. 根据权利要求1所述的报文处理方法,其特征在于,所述报文处理方法还包括:The packet processing method according to claim 1, wherein the packet processing method further comprises:
    当所述节点需要计算备份路径时,检测所述节点到下一跳节点的路径除主路径外,是否包括其它属于所述主路径的路由实例号的路径;When the node needs to calculate the backup path, it is detected whether the path of the node to the next hop node includes other paths belonging to the route instance number of the primary path, except for the primary path;
    当包括时,按照主路径的路由实例号计算备份路径;当不包括时,遍历所述节点的路由实例号计算备份路径。When included, the backup path is calculated according to the route instance number of the primary path; when not included, the route instance number of the node is traversed to calculate the backup path.
  5. 一种计算机可读存储介质,其特征在于,所述计算机可读存储介质存储有一个或者多个程序,所述一个或者多个程序可被一个或者多个处理器执 行,以实现以下步骤:A computer readable storage medium, characterized in that the computer readable storage medium stores one or more programs, the one or more programs being executable by one or more processors to implement the following steps:
    当节点需要计算路径时,检测是否有已接收的基于流量工程的资源预留协议RSVP-TE报文且已接收的RSVP-TE报文中是否携带路由实例号;When the node needs to calculate the path, it detects whether there is a received traffic engineering resource reservation protocol RSVP-TE packet and whether the received RSVP-TE packet carries the routing instance number;
    当有已接收的RSVP-TE报文且已接收的RSVP-TE报文中携带路由实例号时,检测所述节点到下一跳节点的路径是否包括属于所述携带的路由实例号的路径,当包括属于所述携带的路由实例号的路径时,按照所述携带的路由实例号计算路径;当不包括属于所述携带的路由实例号的路径时,遍历所述节点的路由实例号计算路径;When there is a received RSVP-TE packet and the received RSVP-TE packet carries the route instance number, it is detected whether the path of the node to the next hop node includes the path belonging to the carried route instance number. When a path belonging to the carried route instance number is included, the path is calculated according to the carried route instance number; when the path belonging to the carried route instance number is not included, the route instance number calculation path of the node is traversed ;
    发送携带计算出的路径及其所属的路由实例号的RSVP-TE报文至下一跳节点。Send an RSVP-TE packet carrying the calculated path and its associated route instance number to the next hop node.
  6. 一种报文处理装置,其特征在于,包括路径计算单元和发送单元,其中:A message processing apparatus, comprising: a path calculation unit and a sending unit, wherein:
    路径计算单元,设置为:计算自身所属节点到下一跳节点的路径,将计算出的路径及其所属的路由实例号输出至发送单元;The path calculation unit is configured to: calculate a path from the node to which the node belongs to the next hop node, and output the calculated path and the route instance number to which it belongs to the sending unit;
    发送单元,设置为:发送携带计算出的路径及其所属的路由实例号的基于流量工程的资源预留协议RSVP-TE报文至下一跳节点。The sending unit is configured to: send a traffic engineering-based resource reservation protocol RSVP-TE packet carrying the calculated path and its associated route instance number to the next hop node.
  7. 根据权利要求6所述的报文处理装置,其特征在于,还包括接收单元,其中:The message processing device according to claim 6, further comprising a receiving unit, wherein:
    接收单元,设置为:接收RSVP-TE报文,根据接收的RSVP-TE报文检测自身所属节点是否需要计算路径,当需要计算路径时,通知路径计算单元计算路径;并检测接收的RSVP-TE报文中是否携带路由实例号,当携带时,将携带的路由实例号输出至路径计算单元;The receiving unit is configured to: receive an RSVP-TE packet, and detect, according to the received RSVP-TE packet, whether the node to which the node belongs needs to calculate a path, and when the path needs to be calculated, notify the path calculation unit to calculate the path; and detect the received RSVP-TE. Whether the route instance number is carried in the packet, and when carried, the route instance number carried is output to the path calculation unit;
    所述路径计算单元,还设置为:接收接收单元的通知和输出的路由实例号,检测自身所属节点到下一跳节点的路径是否包括属于所述携带的路由实例号的路径,当包括属于所述携带的路由实例号的路径时,按照所述携带的路由实例号计算路径;当不包括属于所述携带的路由实例号的路径时,遍历自身所属节点的路由实例号计算路径。The path calculation unit is further configured to: receive the notification of the receiving unit and the output route instance number, and detect whether the path of the node to which the node belongs to the next hop node includes the path belonging to the carried route instance number, and includes the belonging to the When the path of the carried route instance number is described, the path is calculated according to the carried route instance number; when the path belonging to the carried route instance number is not included, the route instance number of the node to which the node belongs is traversed.
  8. 根据权利要求7所述的报文处理装置,其特征在于,所述路径计算单 元还设置为:The message processing device according to claim 7, wherein the path calculation unit is further configured to:
    当没有接收到接收单元的通知,或者没有接收到接收单元输出的路由实例号时,遍历自身所属节点的路由实例号计算路径。When the notification of the receiving unit is not received, or the routing instance number output by the receiving unit is not received, the routing instance number of the node to which it belongs is traversed.
  9. 根据权利要求7所述的报文处理装置,其特征在于,所述接收单元还设置为:The message processing device according to claim 7, wherein the receiving unit is further configured to:
    当自身所属节点不需要计算路径时,将接收的RSVP-TE报文直接输出至所述发送单元;When the node to which the node belongs does not need to calculate the path, the received RSVP-TE packet is directly output to the sending unit;
    所述发送单元还设置为,将接收的RSVP-TE报文直接转发至下一跳节点。The sending unit is further configured to forward the received RSVP-TE message directly to the next hop node.
  10. 根据权利要求6所述的报文处理装置,其特征在于,所述路径计算单元还设置为:The message processing device according to claim 6, wherein the path calculation unit is further configured to:
    当自身所属节点需要计算备份路径时,检测自身所属节点到下一跳节点的路径除主路径外,是否包括其它属于所述主路径的路由实例号的路径;When the node to which the node belongs needs to calculate the backup path, it is detected whether the path of the node to which the node belongs to the next hop node includes the path of the route instance number of the primary path, except for the primary path.
    当包括时,按照主路径的路由实例号计算备份路径;当不包括时,遍历所述节点的路由实例号计算备份路径。When included, the backup path is calculated according to the route instance number of the primary path; when not included, the route instance number of the node is traversed to calculate the backup path.
PCT/CN2018/112084 2017-10-27 2018-10-26 Message processing method and device, and computer-readable storage medium WO2019080927A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201711025412.0 2017-10-27
CN201711025412.0A CN109729006B (en) 2017-10-27 2017-10-27 Message processing method and device and computer readable storage medium

Publications (1)

Publication Number Publication Date
WO2019080927A1 true WO2019080927A1 (en) 2019-05-02

Family

ID=66246223

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/112084 WO2019080927A1 (en) 2017-10-27 2018-10-26 Message processing method and device, and computer-readable storage medium

Country Status (2)

Country Link
CN (1) CN109729006B (en)
WO (1) WO2019080927A1 (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050169266A1 (en) * 2004-02-03 2005-08-04 Rahul Aggarwal MPLS traffic engineering for point-to-multipoint label switched paths
KR20050080703A (en) * 2004-02-10 2005-08-17 삼성전자주식회사 Apparatus and method for automatically reconfiguration path
CN1705292A (en) * 2004-05-31 2005-12-07 华为技术有限公司 Route selection method for implementing cross-domain constraint-based routing
CN102904808A (en) * 2011-07-25 2013-01-30 中兴通讯股份有限公司 Method and system for establishing label switch path of resource reservation-protocol traffic engineering

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100514912C (en) * 2005-08-19 2009-07-15 华为技术有限公司 Method of realizing Pipe model based on distinction service
CN105681190A (en) * 2014-11-21 2016-06-15 中兴通讯股份有限公司 Tunnel restraint information sending, receiving method and device
US9843508B2 (en) * 2015-03-06 2017-12-12 Juniper Networks, Inc. RSVP make-before-break label reuse
CN105450520B (en) * 2015-12-31 2019-02-19 北京华为数字技术有限公司 Message processing method and device, the method and apparatus for establishing aggregating tunnel

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050169266A1 (en) * 2004-02-03 2005-08-04 Rahul Aggarwal MPLS traffic engineering for point-to-multipoint label switched paths
KR20050080703A (en) * 2004-02-10 2005-08-17 삼성전자주식회사 Apparatus and method for automatically reconfiguration path
CN1705292A (en) * 2004-05-31 2005-12-07 华为技术有限公司 Route selection method for implementing cross-domain constraint-based routing
CN102904808A (en) * 2011-07-25 2013-01-30 中兴通讯股份有限公司 Method and system for establishing label switch path of resource reservation-protocol traffic engineering

Also Published As

Publication number Publication date
CN109729006B (en) 2021-08-31
CN109729006A (en) 2019-05-07

Similar Documents

Publication Publication Date Title
US11909645B2 (en) Segment routing traffic engineering based on link utilization
US9401858B2 (en) Loop avoidance during network convergence in switched networks
US7848224B2 (en) Method and apparatus for constructing a repair path for multicast data
US9838246B1 (en) Micro-loop prevention using source packet routing
US9491046B2 (en) System and method for switching traffic from sub-optimal primary P2MP to standby P2MP
US10187298B2 (en) Merge point determination in refresh interval independent fast reroute facility protection
US8817591B2 (en) Inter-domain signaling to update remote path computation elements after a call set-up failure
US9369380B1 (en) Handling entropy labels when stitching label-switched paths
US10554537B2 (en) Segment routing in a multi-domain network
US9571381B2 (en) System and method for inter-domain RSVP-TE LSP load balancing
US20060268682A1 (en) System and method for protecting against failure of a TE-LSP tail-end node
US11271864B2 (en) Tunnel establishment method, apparatus, and system
CN108141410B (en) Make-before-break mechanism for label switched paths
US9473350B2 (en) Protecting a label switched path egress without using downstream labels
US9769066B2 (en) Establishing and protecting label switched paths across topology-transparent zones
US11677658B2 (en) Packet routing based on common node protection
US9590845B1 (en) Inter-area LDP node protection
US11502940B2 (en) Explicit backups and fast re-route mechanisms for preferred path routes in a network
WO2017152596A1 (en) Method and device for protecting p2mp main tunnel node
US20190379596A1 (en) Methods and Systems preventing Make Before Break failures during soft preemption in MPLS
CN107347034B (en) Link information processing method, device and system
CN111224870B (en) Fault repairing method, equipment and storage medium in SR-MPLS Anycast scene
WO2017162202A1 (en) Link state information processing
WO2019080927A1 (en) Message processing method and device, and computer-readable storage medium
WO2018113460A1 (en) Multi-layer lsp control method and apparatus

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: 18871211

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205 DATED 08/09/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18871211

Country of ref document: EP

Kind code of ref document: A1