WO2018205887A1 - Procédé et appareil de collecte de retard - Google Patents

Procédé et appareil de collecte de retard Download PDF

Info

Publication number
WO2018205887A1
WO2018205887A1 PCT/CN2018/085602 CN2018085602W WO2018205887A1 WO 2018205887 A1 WO2018205887 A1 WO 2018205887A1 CN 2018085602 W CN2018085602 W CN 2018085602W WO 2018205887 A1 WO2018205887 A1 WO 2018205887A1
Authority
WO
WIPO (PCT)
Prior art keywords
delay
node
collection
request
current node
Prior art date
Application number
PCT/CN2018/085602
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 WO2018205887A1 publication Critical patent/WO2018205887A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/63—Routing a service request depending on the request content or context
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0852—Delays

Definitions

  • the present disclosure relates to the field of data network communications, and in particular, to a method and apparatus for time delay collection.
  • RSVP-TE Resource Reservation Protocol-Traffic Engineer
  • MPLS Multi-Protocol Label Switching
  • the RSVP-TE tunnel is used to carry the L2 virtual private network (L2VPN) and the L3 virtual private network (L3VPN). It also participates in route calculation through static routes and policy routing.
  • RSVP-TE has increasingly served various services and provided basic tunnel services. As a result, there are more and more constraints on the tunnel path, such as the basic bandwidth constraint, hop limit constraint, link cost constraint, affinity constraint, and delay constraint.
  • RSVP-TE tunnels in terms of delay constraints, with the widespread use of RSVP-TE tunnels, various requirements are imposed on the delay of RSVP-TE tunnels to refine the ability of tunnels to provide services. For example, an RSVP-TE tunnel with a low delay may be provided to a service that is sensitive to delay, and an RSVP-TE tunnel with a high delay may be provided to a service that is not sensitive to delay.
  • IP Internet Protocol
  • UNI User Network Interface
  • An aspect of the present disclosure provides a method for collecting a delay, comprising the steps of: a current node receiving a delay collection request sent by an upstream node, where the type of the delay collection request includes a mandatory request and an unforced request; a local policy of the node, determining whether the current node supports the collection of the delay, and obtaining a judgment result, where the judgment result includes the collection of the current node support delay or the collection of the current node does not support the delay; Describe the type of the delay collection request and the judgment result, and send corresponding information to the upstream node of the current node or the downstream node of the current node.
  • a delay collection apparatus including: a receiving module, configured to receive a delay collection request sent by an upstream node of a current node, where the type of the delay collection request includes a mandatory request and an unforced
  • the requesting module is configured to determine, according to the local policy of the current node, whether the current node supports the collection of the delay, and obtains a determination result, where the determination result includes the collection of the current node support delay or the current The node does not support the collection of the delay; and the sending module is configured to send corresponding information to the upstream node of the current node or the downstream node of the current node according to the type of the delay collection request and the determination result.
  • a storage medium storing a computer executable program, the computer executing the computer executable program to implement the delay collection method and/or the delay collection device of the present disclosure is provided.
  • FIG. 1 is a flowchart of a method for collecting a delay according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of an implementation manner of a delay collection method according to an embodiment of the present disclosure
  • FIG. 3 is a schematic structural diagram of extended TLV information according to an embodiment of the present disclosure.
  • FIG. 4 is a schematic diagram of an application example of a delay collection method according to an embodiment of the present disclosure
  • FIG. 5 is a schematic diagram of another application example of a delay collection method according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of a time delay collecting device according to an embodiment of the present disclosure.
  • FIG. 1 is a flowchart of a method for collecting a delay according to an embodiment of the present disclosure. As shown in FIG. 1 , the method for collecting a delay includes the following steps S101 to S103.
  • the current node receives a delay collection request sent by the upstream node, where the type of the delay collection request includes a mandatory request and an unforced request (or a request for recommendation).
  • the type of the delay collection request carried may be determined according to the policy requirements of the tunnel, where the policy of the tunnel is determined based on the configuration of the local user.
  • the type of the delay collection request may be represented by extended RSVP-TE signaling.
  • extension bit of the label switching path requirement attribute object LSP_REQUIRED_ATTRIBUTES in Request For Comments (RFC) 5420 may be used to indicate the mandatory request
  • extension bit of the label switching path attribute object LSP_ATTRIBUTES in RFC5420 may be used to indicate that the request is not mandatory. request.
  • S102 Determine, according to the local policy of the current node, whether the current node supports the collection of the delay, and obtain a determination result, where the determination result includes the collection of the current node support delay or the current node does not support the delay. Collection.
  • Each node determines, according to the local policy of the current node, whether the current node supports the collection of the delay, and obtains the judgment result, and then according to the type of the delay collection request and the judgment result to the upstream node or the current node.
  • the downstream node of the current node sends corresponding information, and finally completes the collection of the path delay.
  • the tunnel exists as a virtual link or a virtual path. Therefore, the virtual link or the virtual path generated by the tunnel can be identified by the collected delay, so that the subsequent service selects the virtual link or the virtual path and superimposes the Virtual link or virtual path.
  • FIG. 2 is a flowchart of another method for collecting a delay according to an embodiment of the present disclosure. As shown in FIG. 2, the method for collecting a delay includes the following steps S201 to S206.
  • the current node receives a delay collection request sent by the upstream node, where the type of the delay collection request includes a mandatory request and an unforced request (or a request for recommendation).
  • the type of the delay collection request carried may be determined according to the policy requirements of the tunnel, where the policy of the tunnel is determined based on the configuration of the local user.
  • the type of the delay collection request is represented by extended RSVP-TE signaling.
  • the head node of the tunnel carries the type of the delay collection request in a path (PATH) message, and the extension bit of LSP_REQUIRED_ATTRIBUTES in RFC5420 may be used to indicate a mandatory request, which may be represented by an extension bit of LSP_ATTRIBUTES in RFC5420.
  • PATH path
  • Non-mandatory request of course, the present disclosure is not limited to this.
  • S202 Determine, according to a local policy of the current node, whether the current node supports the collection of the delay, and obtain a determination result, where the determination result includes the collection of the current node support delay or the collection of the current node does not support the delay.
  • the delay of the current node and the delay collection request are sent to the current node.
  • the downstream node If the type of the delay collection request is a mandatory request, and the result of the determination is that the current node supports the collection of the delay, the delay of the current node and the delay collection request are sent to the current node. The downstream node.
  • the delay of the current node and the delay collection request are sent to the The downstream node of the current node.
  • the delay collection request is sent only to the downstream node of the current node.
  • the delay is carried to the downstream node of the current node by adding the delay to the TLV (Type-Length-Value) information of the RSVP-TE.
  • TLV Type-Length-Value
  • the TLV information includes three parts: type, length, and value.
  • the TLV information may also include a reserved portion.
  • the TLV information may be a sub-object of a Record-route object (RRO).
  • RRO Record-route object
  • Embodiments of the present disclosure are exemplified below.
  • the delay of the outbound interface of the current node is added to the extended TLV information as a sub-object of the RRO.
  • the downstream node that is carried to the current node, and sends the delay collection request to the downstream node of the current node.
  • the current node If the current node does not support the collection of the delay, and the type of the delay collection request is a mandatory request, the current node sends a Path Error (PATH-ERR) message to the upstream node.
  • PATH-ERR Path Error
  • the current node If the current node does not support the collection of the delay, and the type of the delay collection request is a recommendation request (non-mandatory request), the current node sends the delay collection request to the downstream of the current node. Node, at the same time, does not add sub-objects about extended TLV information in RRO.
  • the RESV message When the tail node of the tunnel receives the PATH message and responds to the reservation (Reserve, RESV) message, according to the type of the delay collection request, the RESV message carries the outbound interface delay including the tail node as a sub-object of the RRO. Extended TLV information.
  • the tunnel 1 passes from the node R1 to the node R4 through the node R2 and the node R3.
  • the local policy of the node R2 does not support the collection of the delay, and the local policies of the remaining nodes support the collection of the delay, the tunnel.
  • the calculated path is link L1, link L4, and link L6.
  • the type of the delay collection request is mandatory.
  • the PATH message carries the extension bit of LSP_REQUIRED_ATTRIBUTES and will carry the link L1.
  • the extended extended TLV information is a sub-object of the RRO, and the delay value of the link L1 is 10.
  • the PATH-ERR message is returned to the node R1, and The PATH message is sent to node R3.
  • node R1 After receiving the PATH-ERR message, node R1 calculates the path again to bypass node R2.
  • tunnel 1 passes from node R1 through node R2 and node R3 to node R4.
  • the local policy of node R2 does not support the collection of delays, and the local policies of the remaining nodes support the collection of delays.
  • the path calculated by the tunnel 1 is the link L1, the link L4, and the link L6.
  • the type of the delay collection request is a request request (non-mandatory request), and the PATH message carries the extension bit of the LSP_ATTRIBUTES and is carried at the same time.
  • the extended TLV information with the delay of the link L1 is a sub-object of the RRO, and the value of the delay of the link L1 is 10.
  • the node R2 needs to continue to send the PATH message to the downstream node, and the reservation is retained. It is recommended that the extended bit of the requested LSP_ATTRIBUTES, but does not carry the extended TLV information including the delay of the node R2.
  • the node R3 supports the collection of the delay. Therefore, after receiving the PATH message, the node R3 adds the extended TLV information including the outbound interface delay of the node R3 to the RRO as a sub-object of the RRO, and the extended TLV information includes the chain. For the delay of the path L1 and the link L6, the values of the delays of the link L1 and the link L6 are all 10.
  • the node R4 After receiving the PATH message, the node R4 can obtain the delay of the link L1 and the link L6 through the RRO. At the same time, the node R4 also supports the collection of the delay. Therefore, when the node R4 responds to the RESV message to the node R3, the extended TLV information including the delay of the link L6 is added as a sub-object of the RRO.
  • the node R3 After receiving the RESV message, the node R3 carries the delay of the link L4 in the RESV message that is sent to the node R2 according to the local policy of the node R3.
  • the RESV message sent to the node R1 does not carry the delay of the outbound interface of the node R2.
  • the node R1 After receiving the RESV message, the node R1 can obtain the delay of the link L4 and the link L6. Since node R2 does not support the collection of delays, neither the head node (node R1) nor the tail node (node R4) can obtain complete delay information.
  • tunnel 1 passes from node R1 through node R2 and node R3 to node R4.
  • the local policies of all nodes support the collection of delay, and the path calculated by tunnel 1 is link L1.
  • the local policy of each node supports the collection of the delay, and the type of the delay collection request is a mandatory request or a proposal. The difference is not large.
  • the request is collected by the delay.
  • the type is a mandatory request.
  • the PATH message carries the extension bit of LSP_REQUIRED_ATTRIBUTES, and the extended TLV information carrying the delay of the link L1 is used as a sub-object of the RRO, and the value of the delay of the link L1 is 10.
  • the node R2 needs to continue to send the PATH message to the downstream node, retain the extension bit of the LSP_REQUIRED_ATTRIBUTES indicating the mandatory request, and carry the outbound node R2 in the RRO.
  • the delay of the interface that is, the delay of the link L4, and the value of the delay of the link L4 is 10.
  • the node R3 supports the collection of the delay. Therefore, after receiving the PATH message, the node R3 adds the outbound interface delay including the node R3 in the RRO, that is, the delay of the link L6, and the delay carried in the RRO includes the chain.
  • the delay of the link L1, the link L4, and the link L6, and the delay values of the link L1, the link L4, and the link L6 are all 10.
  • the node R4 After receiving the PATH message, the node R4 can obtain the delay of the link L1, the link L4, and the link L6 through the RRO. That is, the tail node R4 can obtain the delay of the entire path. At the same time, since the local policy of the node R4 also supports the collection of the delay, in the RESV message that the node R4 responds to the node R3, the extended TLV information including the delay of the link L6 is added as a sub-object of the RRO.
  • the node R3 After receiving the RESV message, the node R3 adds the delay of the link L4 to the RRO when responding to the RESV message to the node R2 according to the local policy of the node R3.
  • the node R2 After receiving the RESV message, the node R2 carries the outbound interface delay of the node R2, that is, the delay of the link L1, in the RESV message sent to the node R1 according to the local policy of the node R2.
  • the node R1 After receiving the RESV message, the node R1 can obtain the delay of the link L1, the link L4, and the link L6. That is, the head node R1 can also acquire the delay of the entire path of the tunnel 1.
  • the path calculated by the tunnel 1 is the link L1, the link L4, and the link L6.
  • the path calculated by the tunnel 1 may also include different links, for example, The values of the delays including link L2, link L3, and/or link L5, link L2, link L3, and link L5 are all 50.
  • the unit of the value of the delay of the present disclosure may be milliseconds, microseconds, or nanoseconds, etc., which is not limited by the disclosure.
  • FIG. 5 is a schematic diagram showing a time delay collection method applied to a networking environment in which an IP network and an optical network are fused, in accordance with an embodiment of the present disclosure.
  • the networking in which the IP network and the optical network are integrated includes an IP layer and an optical layer. With the convergence of the IP network and the optical network, the IP layer needs to establish a path through the TE layer through the TE tunnel to serve the IP layer service.
  • a tunnel is established between node C1 and node C2 shown in FIG. 5 to traverse the optical network. Since the IP layer and the optical layer are isolated, the path calculation module needs to calculate the path of the node C1 to the node N1 at the node C1, the path of the node N1 to the node N2 at the node N1, and the calculation node at the node N2. N2 to the path of node C2.
  • the extended TLV information can also be used to carry the TLV information including the path delay of the tunnel to the head node and the tail node of the tunnel by the method carried by the RRO, and the delay collection process and the above description are described with reference to FIG. 4 .
  • the process of collecting the delay 1 from the node R1 through the node R2 and the node R3 to the node R4 and the local policies of all the nodes support the collection of the delay is similar, and will not be described here.
  • the corresponding information may be sent to the upstream node of the current node or the downstream node of the current node according to the type of the delay collection request and the local policy of the current node.
  • the collected delay is added to the TLV information of the signaling extension based on the Traffic Engineering Resource Reservation Protocol (RSVP-TE), and the delay of each path can be gradually collected.
  • RSVP-TE Traffic Engineering Resource Reservation Protocol
  • the head node and the tail node can obtain the path delay of the entire tunnel.
  • the virtual link or the virtual path generated by the tunnel is identified by the delay collected by each node, so that the subsequent service selects the virtual link or the virtual path and superimposes on the virtual link or the virtual path.
  • An embodiment of the present disclosure further provides a delay collection device.
  • the delay collection device includes a receiving module 601, a determining module 602, and a sending module 603.
  • the receiving module 601 is configured to receive a delay collection request sent by an upstream node of the current node, where the type of the delay collection request includes a mandatory request and an unforced request.
  • the type of the delay collection request is represented by extended RSVP-TE signaling.
  • the head node of the tunnel carries the type of the delay collection request in a path (PATH) message, and the extension bit of LSP_REQUIRED_ATTRIBUTES in RFC5420 may be used to indicate a mandatory request, which may be represented by an extension bit of LSP_ATTRIBUTES in RFC5420.
  • PATH path
  • Non-mandatory request of course, the present disclosure is not limited to this.
  • the determining module 602 is configured to determine, according to the local policy of the current node, whether the current node supports the collection of the delay, and obtains a determination result, where the determination result includes the collection of the current node support delay or the current The node does not support the collection of delays.
  • the sending module 603 is configured to send corresponding information to an upstream node of the current node or a downstream node of the current node according to the type of the delay collection request and the determination result.
  • the sending module 603 includes a first sending unit, a second sending unit, a third sending unit, and a fourth sending unit.
  • the first sending unit is configured to: when the type of the delay collection request is a mandatory request, and the current node supports the collection of the delay, the delay of the current node and the delay collection request Sended to the downstream node of the current node.
  • the delay is carried to the downstream node of the current node by adding the delay to the TLV information of the signaling extension based on Traffic Engineering Resource Reservation Protocol (RSVP-TE).
  • RSVP-TE Traffic Engineering Resource Reservation Protocol
  • the second sending unit is configured to send a path error message to an upstream node of the current node if the type of the delay collection request is a mandatory request and the current node does not support the collection of the delay.
  • the third sending unit is configured to collect the current node delay and the delay collection if the type of the delay collection request is an unforced request and the current node supports the collection of the delay The request is sent to the downstream node of the current node.
  • the fourth sending unit is configured to send only the delay collection request to the current if the type of the delay collection request is an unforced request and the current node does not support the collection of the delay The downstream node of the node.
  • the sending module 603 determines, according to the local policy of the current node, whether the current node supports the collection of the delay, obtains a determination result, and further according to the type of the delay collection request.
  • the result of the determination is that the corresponding information is sent to the upstream node of the current node or the downstream node of the current node, and the cooperation between the receiving module 601, the determining module 602, and the sending module 603 is completed, and finally the path delay is completed. collect.
  • the tunnel exists as a virtual link or a virtual path. Therefore, the virtual link or the virtual path generated by the tunnel can be identified by the collected delay, so that the subsequent service selects the virtual link or the virtual path and superimposes the Virtual link or virtual path.
  • the time delay collecting device of the embodiment of the present disclosure can implement the time delay collecting method of the embodiment of the present disclosure. To avoid repetition, details are not described herein again.
  • Embodiments of the present disclosure also provide a storage medium storing a computer executable program that executes the computer executable program to implement a time delay collection method and/or apparatus of an embodiment of the present disclosure.
  • the embodiments of the present disclosure have been described as merely exemplary embodiments of the methods and apparatus disclosed in the present disclosure, and the methods and apparatus disclosed in the present disclosure may be implemented in other manners.
  • the apparatus of the embodiments of the present disclosure described above is merely illustrative, and the division of the modules and/or the units is only a division based on logic functions, and may be further divided in actual implementation. As an example, some modules and/or units may be combined or integrated together, or may be omitted.
  • the coupling or connection between the modules and/or units may be indirect coupling or connection through some interfaces, devices, or units, etc., or may be directly coupled or connected, and may be electrical, mechanical, or other forms of coupling. Or connect.
  • Modules and units of embodiments of the present disclosure may be implemented in the form of hardware, software, or a combination thereof, such as a processor or the like.
  • Modules and/or units implemented in the form of software may be stored in a computer readable storage medium, including instructions for causing a computer device (which may be a personal computer, server, or network side device, etc.) to perform embodiments of the present disclosure
  • a computer device which may be a personal computer, server, or network side device, etc.
  • the storage medium includes a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. medium.

Landscapes

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

Abstract

La présente invention concerne un procédé de collecte de retard et un appareil de collecte de retard. Le procédé de collecte de retard comprend les étapes consistant à : recevoir, par un nœud actuel, une requête de collecte de retard envoyée par un nœud en amont, les types de la requête de collecte de retard comprenant une requête forcée et une requête non forcée; déterminer, en fonction d'une politique locale du nœud actuel, si le nœud actuel prend en charge la collecte de retard, de façon à obtenir un résultat de détermination, le résultat de détermination comprenant la prise en charge par le nœud actuel de la collecte de retard ou la non-prise en charge par le nœud actuel de la collecte de retard; et envoyer des informations correspondantes au nœud en amont du nœud actuel ou à un nœud en aval du nœud actuel en fonction des types de la requête de collecte de retard et du résultat de détermination.
PCT/CN2018/085602 2017-05-11 2018-05-04 Procédé et appareil de collecte de retard WO2018205887A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710329444.3 2017-05-11
CN201710329444.3A CN108881340A (zh) 2017-05-11 2017-05-11 一种时延收集的方法及装置

Publications (1)

Publication Number Publication Date
WO2018205887A1 true WO2018205887A1 (fr) 2018-11-15

Family

ID=64105022

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/085602 WO2018205887A1 (fr) 2017-05-11 2018-05-04 Procédé et appareil de collecte de retard

Country Status (2)

Country Link
CN (1) CN108881340A (fr)
WO (1) WO2018205887A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113114499B (zh) * 2021-04-08 2022-06-28 北京京航计算通讯研究所 一种基于Flink流式计算网络的数据处理方法及系统

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160119392A1 (en) * 2014-10-27 2016-04-28 Juniper Networks, Inc. Merge point determination in refresh interval independent fast reroute facility protection
CN105681195A (zh) * 2014-11-21 2016-06-15 中兴通讯股份有限公司 一种收集lsp路径亲和力属性的方法及装置
CN105991480A (zh) * 2015-02-27 2016-10-05 中兴通讯股份有限公司 一种实现rsvp-te协议报文处理的方法及装置

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101193058B (zh) * 2006-11-21 2010-07-07 中兴通讯股份有限公司 松散节点本地重优化的方法
KR101400753B1 (ko) * 2008-01-02 2014-05-29 연세대학교 산학협력단 서비스 패킷의 서비스 품질 레벨에 따라 동작하는 중계기및 중계기의 동작 방법
US20130232193A1 (en) * 2012-03-04 2013-09-05 Zafar Ali Control-Plane Interface Between Layers in a Multilayer Network
US10075258B2 (en) * 2012-08-22 2018-09-11 Telefonaktiebolaget Lm Ericsson (Publ) Distributing path delay data in a connection-oriented communications network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160119392A1 (en) * 2014-10-27 2016-04-28 Juniper Networks, Inc. Merge point determination in refresh interval independent fast reroute facility protection
CN105681195A (zh) * 2014-11-21 2016-06-15 中兴通讯股份有限公司 一种收集lsp路径亲和力属性的方法及装置
CN105991480A (zh) * 2015-02-27 2016-10-05 中兴通讯股份有限公司 一种实现rsvp-te协议报文处理的方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZHANG F.: "RSVP-TE Extensions for Collecting Shared Risk Link Group (SR- LG) Information", RFC 8001, 12 January 2017 (2017-01-12), pages 1 - 16, XP015117613 *

Also Published As

Publication number Publication date
CN108881340A (zh) 2018-11-23

Similar Documents

Publication Publication Date Title
US11431611B2 (en) Computing forwarding paths based on notification packet delays
US20230006924A1 (en) Method for Establishing Segment Routing for IPv6 Tunnel
US9491046B2 (en) System and method for switching traffic from sub-optimal primary P2MP to standby P2MP
CN100372337C (zh) 一种实现跨域约束路由的选路方法
US9571381B2 (en) System and method for inter-domain RSVP-TE LSP load balancing
US9210075B2 (en) Method and apparatus for managing end-to-end consistency of bi-directional MPLS-TP tunnels via in-band communication channel (G-ACH) protocol
JP2013541290A (ja) 複数の領域及び複数の自律システムのためのリレーされるｃｓｐｆ
US9246838B1 (en) Label switched path setup using fast reroute bypass tunnel
WO2011017945A1 (fr) Procédé d'héritage d'attribut de contiguïté de transfert dans un réseau multicouche et réseau multicouche correspondant
EP4102807A1 (fr) Procédé, appareil et système d'établissement de tunnel
WO2021004277A1 (fr) Procédé et appareil de gestion de routage, dispositif de réseau et support d'enregistrement lisible
US11962491B2 (en) Source routing tunnel ingress protection
WO2022016682A1 (fr) Procédé d'interconnexion de sites, contrôleur central et réflecteur de routages
WO2009140873A1 (fr) Procédé de configuration d’information d’attributs de liens, dispositif de communication et système de communication
US20160315855A1 (en) Open Shortest Path First for Temporal Tunnel Services
CN102647340A (zh) Rsvp-te隧道中的松散节点及其路径计算方法
WO2006102851A1 (fr) Procede d'information et de negociation de l'aptitude a surveiller propre a la commutation de label
KR102187292B1 (ko) Sfc 네트워크에서 토폴로지 정보를 동기화하기 위한 방법, 및 라우팅 네트워크 엘리먼트
US20210281507A1 (en) Parameter notification and obtaining methods and devices, and storage medium
WO2018177256A1 (fr) Procédé et dispositif d'annonce d'informations de retard
WO2018205887A1 (fr) Procédé et appareil de collecte de retard
WO2017190675A1 (fr) Procédé, appareil et système de traitement d'informations de liaison
WO2022257773A1 (fr) Procédé de détection de routage, dispositif, système, et support de stockage
JP4128944B2 (ja) マルチキャスト転送経路設定方法、マルチキャスト転送経路計算装置、プログラムおよび記録媒体
WO2017152595A1 (fr) Procédé et dispositif pour répondre à un changement de topologie de réseau

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18798314

Country of ref document: EP

Kind code of ref document: A1