WO2019080927A1 - Procédé et dispositif de traitement de messages, et support de stockage lisible par ordinateur - Google Patents

Procédé et dispositif de traitement de messages, et support de stockage lisible par ordinateur

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
English (en)
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/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-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

L'invention concerne un procédé de traitement de messages, qui comporte les étapes consistant: lorsqu'un nœud doit calculer un trajet, à détecter s'il existe un message RSVP-TE reçu et si le message transporte un numéro d'instance de routage (301); lorsque ledit message existe et transporte le numéro d'instance de routage, à détecter si un trajet du nœud à un nœud suivant comporte un trajet se rapportant au numéro transporté d'instance de routage, et si oui, à calculer un trajet selon le numéro transporté d'instance de routage (302); si non, à parcourir le numéro d'instance de routage du nœud pour calculer un trajet (303); et à envoyer au nœud suivant le message de RSVP-TE transportant le trajet calculé et le numéro d'instance de routage auquel se rapporte le trajet (304).
PCT/CN2018/112084 2017-10-27 2018-10-26 Procédé et dispositif de traitement de messages, et support de stockage lisible par ordinateur WO2019080927A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201711025412.0A CN109729006B (zh) 2017-10-27 2017-10-27 一种报文处理方法和装置、计算机可读存储介质
CN201711025412.0 2017-10-27

Publications (1)

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

Family

ID=66246223

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/112084 WO2019080927A1 (fr) 2017-10-27 2018-10-26 Procédé et dispositif de traitement de messages, et support de stockage lisible par ordinateur

Country Status (2)

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

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 (ko) * 2004-02-10 2005-08-17 삼성전자주식회사 자동 경로 재설정 장치 및 방법
CN1705292A (zh) * 2004-05-31 2005-12-07 华为技术有限公司 一种实现跨域约束路由的选路方法
CN102904808A (zh) * 2011-07-25 2013-01-30 中兴通讯股份有限公司 跨资源预留协议流量工程标签交换路径的建立方法及系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100514912C (zh) * 2005-08-19 2009-07-15 华为技术有限公司 一种基于区分服务的Pipe模型实现方法
CN105681190A (zh) * 2014-11-21 2016-06-15 中兴通讯股份有限公司 一种隧道约束信息的发送、接收方法及装置
US9843508B2 (en) * 2015-03-06 2017-12-12 Juniper Networks, Inc. RSVP make-before-break label reuse
CN105450520B (zh) * 2015-12-31 2019-02-19 北京华为数字技术有限公司 报文处理方法和装置、建立聚合隧道的方法和装置

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 (ko) * 2004-02-10 2005-08-17 삼성전자주식회사 자동 경로 재설정 장치 및 방법
CN1705292A (zh) * 2004-05-31 2005-12-07 华为技术有限公司 一种实现跨域约束路由的选路方法
CN102904808A (zh) * 2011-07-25 2013-01-30 中兴通讯股份有限公司 跨资源预留协议流量工程标签交换路径的建立方法及系统

Also Published As

Publication number Publication date
CN109729006B (zh) 2021-08-31
CN109729006A (zh) 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
US9838246B1 (en) Micro-loop prevention using source packet routing
US7848224B2 (en) Method and apparatus for constructing a repair path for multicast data
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
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 (zh) 针对标签交换路径的先通后断机制
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 (fr) Procédé et dispositif pour protéger un nœud de tunnel principal p2mp
US20190379596A1 (en) Methods and Systems preventing Make Before Break failures during soft preemption in MPLS
CN107347034B (zh) 链路信息的处理方法及装置、系统
CN111224870B (zh) 一种SR-MPLS Anycast场景下的故障修复方法、设备和存储介质
WO2017162202A1 (fr) Traitement d'informations d'état de liaison
WO2019080927A1 (fr) Procédé et dispositif de traitement de messages, et support de stockage lisible par ordinateur
WO2018113460A1 (fr) Procédé et appareil de commande lsp multicouche
WO2024152527A1 (fr) Procédé de routage et appareil associé, support d'enregistrement et produit programme d'ordinateur

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