WO2018054197A1 - Appareil et procédé destinés à la sélection de trajet - Google Patents

Appareil et procédé destinés à la sélection de trajet Download PDF

Info

Publication number
WO2018054197A1
WO2018054197A1 PCT/CN2017/099450 CN2017099450W WO2018054197A1 WO 2018054197 A1 WO2018054197 A1 WO 2018054197A1 CN 2017099450 W CN2017099450 W CN 2017099450W WO 2018054197 A1 WO2018054197 A1 WO 2018054197A1
Authority
WO
WIPO (PCT)
Prior art keywords
field
path
selection criteria
tie breaking
pce
Prior art date
Application number
PCT/CN2017/099450
Other languages
English (en)
Inventor
Ramanjaneya Reddy PALLETI
Hari Krushna KOTNI
Original Assignee
Huawei Technologies Co., Ltd.
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 Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to CN201780057174.3A priority Critical patent/CN109716718A/zh
Publication of WO2018054197A1 publication Critical patent/WO2018054197A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/14—Multichannel or multilink protocols

Definitions

  • This application relates to telecommunications, in particular, to a method and apparatus for path selecting in a network.
  • LSPs Label-Switched Paths
  • LDP Label Distribution Protocol
  • RSVP-TE Resource Reservation Protocol-Traffic Engineering
  • a Path Computation Element is an entity that is capable of determining and computing a suitable route for conveying data between a source and a destination, and of applying computational constraints during the computation.
  • the PCE entity is an application that can be located within a network node or component, on an out-of-network server, etc.
  • a PCE would be able to compute the path of a traffic engineering label switched paths (TE LSPs) , by operating on the Traffic Engineering database (TED) storing the traffic engineering information, and considering the bandwidth and other constraints applicable to the TE LSP service request.
  • TE LSPs traffic engineering label switched paths
  • TED Traffic Engineering database
  • the PCE uses the path computation element communication protocol (PCEP) for communications between a Path Computation Client (PCC) and a PCE, or between two PCEs.
  • PCEP path computation element communication protocol
  • the PCEP is a special set of rules that allows the PCC to request path computations from the PCEs.
  • the protocol also lets the PCEs return responses.
  • the PCE may choose same path for multiple LSPs which results in inefficient utilization of network resources.
  • the object of the present application is to provide a method, apparatus and system for path selecting, so that the PCE can select a path in case of multiple equal-cost paths available.
  • the PCE in case of tie breaking, can select a path effectively based on the tie breaking selection criteria, which ensures efficient utilization of end-to-end network resources.
  • the PCEP message includes a Label Switch Path Attributes (LSPA) object field and the LSPA object field includes the tie breaking selection criteria field.
  • the tie breaking selection criteria field includes a Type Length Value (TLV) field, wherein the V field of the TLV field includes an array of units of flags numbered from the least significant bit as bit zero, where each bit represents one tie breaking criteria.
  • TLV Type Length Value
  • the tie breaking selection criteria to select the path for the communication is based on one or more of: a bandwidth, a delay, a jitter, a packet loss, a throughput, a latency and an error rate.
  • the PCEP message is a path computation request (PCReq) message or a path computation reply (PCRep) message or a path computation report (PCRpt) message.
  • a method for selecting a path for a communication in a network is provided.
  • a Path Computation Client generates a PCEP message, wherein the PCEP message includes a tie breaking selection criteria field, the tie breaking selection criteria field includes at least one tie breaking selection criteria, the at least one tie breaking selection criteria is used to instruct the PCE to select a path from at least two equal cost paths and the PCC transmits the PCEP message to the PCE.
  • the PCEP message includes a tie breaking selection criteria field
  • the tie breaking selection criteria field includes at least one tie breaking selection criteria
  • the at least one tie breaking selection criteria is used to instruct the PCE to select a path from at least two equal cost paths and the PCC transmits the PCEP message to the PCE.
  • the PCE in case of tie breaking, can select a path effectively based on the tie breaking selection criteria, which ensures efficient utilization of end-to-end network resources.
  • the PCEP message includes a Label Switch Path Attributes (LSPA) object field and the LSPA object field includes the tie breaking selection criteria field.
  • LSPA Label Switch Path Attributes
  • the tie breaking selection criteria field includes a Type Length Value (TLV) field
  • the TLV field includes a Type (T) field, a Length (L) field and a Value (V) field, wherein the V field is used to carry the tie breaking selection criteria.
  • the V field includes a set of bits, where each bit represents one tie breaking criteria.
  • the tie breaking selection criteria to select the path for the communication is based on one or more of: a bandwidth, a delay, a jitter, a packet loss, a throughput, latency and an error rate.
  • the path is the path of the traffic engineering label switch path (TE LSP) .
  • TE LSP traffic engineering label switch path
  • the PCEP message is a path computation request (PCReq) message or a path computation reply (PCRep) message or a path computation report (PCRpt) message.
  • a path Computation Client for selecting a path in a network.
  • the PCC includes the modules to perform the method of the second aspect or any one of the possible implementation manners of the second aspect.
  • a PCC for selecting a path in a network includes a memory, an I/O interface and a processor coupled with the memory and the I/O interface.
  • the memory is configured to store instructions.
  • the processor is configured to execute the instructions. The instructions, when executed by the processor, cause the processor to perform the method of the second aspect or any one of the possible implementation manners of the second aspect.
  • a computer readable storage medium stores program codes.
  • the program codes comprise instructions for performing the method of the first aspect or any one of the possible implementation manners of the first aspect.
  • a computer readable storage medium stores program codes.
  • the program codes comprise instructions for performing the method of the second aspect or any one of the possible implementation manners of the second aspect.
  • the present application enables the PCE to select a path effectively in case of tie breaking, which ensures efficient utilization of end-to-end network resources.
  • Figure 1 illustrates a schematic diagram of application scenario of the method according to the embodiment of the present application.
  • Figure 3 illustrates a schematic diagram of a tie breaking TLV field according to an embodiment of the present application.
  • Figure 4 illustrates a schematic structural diagram of a Path Computation Element (PCE) for selecting a path according to an embodiment of the present application.
  • PCE Path Computation Element
  • FIG. 5 illustrates a schematic structural diagram of a Path Computation Client (PCC) for selecting a path according to an embodiment of the present application.
  • PCC Path Computation Client
  • Figure 6 illustrates a schematic structural diagram of another Path Computation Element (PCE) for selecting a path according to an embodiment of the present application.
  • PCE Path Computation Element
  • Figure 7 illustrates a schematic structural diagram of another Path Computation Client (PCC) for selecting a path according to an embodiment of the present application.
  • PCC Path Computation Client
  • the application can be implemented in numerous ways, as a process, an apparatus, a system, a composition of matter, a computer readable medium such as a computer readable storage medium or a computer network wherein program instructions are sent over optical or electronic communication links.
  • these implementations, or any other form that the application may take, may be referred to as techniques.
  • the order of the steps of disclosed processes may be altered within the scope of the application.
  • the terms “plurality” and “a plurality” as used herein may include, for example, “multiple” or “two or more” .
  • the terms “plurality” or “aplurality” may be used throughout the specification to describe two or more components, devices, elements, units, parameters, or the like. Unless explicitly stated, the method embodiments described herein are not constrained to a particular order or sequence. Additionally, some of the described method embodiments or elements thereof can occur or be performed simultaneously, at the same point in time, or concurrently.
  • Figure 1 illustrates a schematic diagram of application scenario of the method according to the embodiment of the present application.
  • the network 100 includes a PCE 101, a PCC 102 and network devices A1-A4.
  • the PCC 102 is ingress of the path from the PCC 102 toA4, and A4 is an egress of the path from the PCC 102 to A4.
  • Figure 1 shows multiple paths identified by the PCE 101 for communication from the PCC 102 to A4.
  • the paths i.e., path 1, path 2 and path 3 as shown in figure 1 have same interior gateway protocol (IGP) metrics. Further, the percentage reflects the total bandwidth reserved for the path for communication, for example, 70%for path 1, 45%for path 2, 10%for path 3.
  • IGP interior gateway protocol
  • the PCE101 may choose same path (i.e. Path1 shown in figure 1) for multiple LSPs which results in inefficient utilization of network resources.
  • the Internet Engineering Task Force (IETF) Request for Comments (RFC) 5440 does not specify any tie-breaking policy for PCE 101 to select one among them when multiple equal cost paths exist.
  • the PCC 102 cannot specify the tie breaking policy to the PCE 101.
  • the PCE 101 chooses one path based on vendor specific policy or randomly (in case of multi equal-cost paths) during path computation.
  • embodiments of the application are described primarily in the context of PCC and PCE in a network. However, it shall be appreciated that the application is not limited to the context of PCC and PCE, and may relate to any type of appropriate electronic apparatus having the function of path computation.
  • the present application provides a method to enable the PCE to select a path in case of multiple equal-cost paths available.
  • the following describes the method 200 in combination with figure 3, a method 400 may be applied to the network as shown in figure 1, however the embodiments of the present invent are not limited to this.
  • the method for selecting a path for a communication in the network includes the below steps:
  • PCC generates a path computation element communication protocol (PCEP) message.
  • PCEP path computation element communication protocol
  • the PCC is adapted to generate the PCEP message
  • the PCEP message includes a tie breaking selection criteria field
  • the tie breaking selection criteria field includes at least a tie breaking selection criteria
  • the tie breaking selection criteria is used to instruct the PCE to select a path from at least two equal cost paths.
  • the PCEP message may be, but not limited to, the path computation request (PCReq) messages or the path computation reply (PCRep) messages or the path computation report (PCRpt) message.
  • the PCEP message carries a tie breaking TLV, and the tie breaking TLV specifies tie breaking selection criteria.
  • the PCE received the PCEP message selects a path according to the tie breaking selection criteria in the tie breaking TLV, in case multiple equal-cost paths exist.
  • the PCC may specify tie breaking selection criteria to PCE for selecting a path in case multiple equal-cost paths exist based on network performance parameters.
  • the network performance parameter may include a set of parameters comprising: a bandwidth or a delay or a jitter or a packet loss or a throughput or latency or an error rate or any combination thereof.
  • the PCEP message may carry a new optional TLV (named as tie breaking TLV)
  • the new optional TLV may be in Label Switch Path Attributes (LSPA) Object and used to specify tie breaking selection criteria to PCE for selecting a path in case multiple equal-cost paths exist.
  • LSPA Label Switch Path Attributes
  • the LSPA object is optional and specifies various tunnel engineering (TE) LSP attributes to be taken into account by the PCE during path computation.
  • the LSPA object may be carried within a PCReq message, or a PCRep message in case of unsuccessful path computation. Further, the LSPA object can also be carried within the attribute-list of a PCRpt message (as defined in section 6.1 of [ID. draft-ietf-pce-stateful-pce-14] ) .
  • the detailed description of the LSPA object can be seen in Section7.11 of RFC 5440.
  • the tie breaking TLV field may include a Type filed, a Length filed and a Value field.
  • the V field of the TLV field includes a set of bits, i.e. an array of units of flags numbered from the least significant bit as bit zero. Each bit may represent one tie breaking criteria.
  • the tie breaking selection criteria is based on one or more of : a bandwidth, a delay, a jitter, a packet loss, a throughput, a latency and an error rate.
  • figure 3 shows a tie breaking TLV utilized for selecting a path in a network for communication.
  • the tie breaking TLV may be inserted in the optional field of the LSPA object.
  • the tie breaking TLV is used by the PCC to specify policy to PCE for selecting a path in case of tie breaking during path computation.
  • the TLV may specify various tie breaking conditions based on available bandwidth, delay, jitter, packet loss or other parameters.
  • tie breaking TLV as shown in figure 5 may be used to encode in LSPA object. Tie breaking TLV is optionally carried in LSPA object.
  • the TLV as shown in figure 3 may include three fields such as type, length, and value.
  • the type field specifies a tie breaking TLV type (To be assigned by Internet Assigned Numbers Authority (IANA) ) .
  • the type field specifies multiple of 4 octets.
  • the value field is used to carry the tie breaking selection criteria.
  • the V field may contain a set of bits, where each bit may represent one tie breaking policy. A bit may be set as 1, to enable a specific tie breaking policy corresponding to the bit. It may be understood that the multiple policies may also be set.
  • the table below shows the exemplary tie breaking policies assigned to the respective bits.
  • Table 1 Tie breaking policies assigned to the respective bits.
  • V field For Table 1, unassigned bits are considered reserved. They may be set to 0 on transmission and may be ignored on receipt. If none of the bit is set, the PCE chooses path randomly. Table 1 is just an exemplary description of the V field, the persons skilled in the art can define the V field according to the requirements of the network or system or administrator.
  • the object body may include a tie-breaking TLV and the tie-breaking TLV is used to specify one or more tie breaking selection criterion.
  • the tie breaking TLV includes a set of sub-TLV; each sub-TLV includes T filed, L filed and V filed.
  • the T filed specifies a type of a tie breaking selection criteria.
  • the V filed specifies the content according to the type defined by the T filed.
  • the tie breaking TLV can be the same as the TLV shown in figure 3, see the description of the figure 3 and the table1.
  • policies or rules or criteria or conditions are configurable or re-configurable and may be based on the requirement of the network or system or administrator.
  • the policies or rules or criteria or conditions may be pre-determined, pre-defined and may be different or same on same or different network.
  • S203 The PCE receives the PCEP message transmitted by the PCC.
  • the PCE selects a first path based at least on the tie breaking selection criteria in the PCEP message, the first path is selected from the multiple equal cost paths.
  • the first path is a traffic engineering label switched path (TE LSP) .
  • the tie breaking selection criteria to select the first path for the communication may be based on the network performance parameters.
  • the network performance parameters may be selected from, but not limited to, a set of parameters comprising: a bandwidth or a delay or a jitter or a packet loss or a throughput or latency or an error rate or any combination thereof.
  • Path1 Choose the path with the most-utilized, i.e., Path1
  • the tie breaking condition may be to choose the path with the most utilized links, and for the second LSP, the tie breaking condition may be to choose the path with the least-utilized links. Therefore, the PCE may choose different paths for multiple LSPS when multiple equal cost paths exist. It results in efficient utilization of network resources.
  • An embodiment of the present application further provides a PCE400 for selecting path in a network, as stated below.
  • a PCE400 for selecting path in a network, as stated below.
  • the implementation of the PCE may be referred to for the implementation of the method 200 and the repeated parts shall not be described herein any further.
  • FIG. 4 is a schematic diagram of the PCE according to an embodiment of the present application.
  • the PCE 400 in this embodiment of the present application may execute the method 200 executed by the PCE in the embodiment shown in figure 2 to achieve a same beneficial effect, and details are not described herein again.
  • the PCE 400 includes a processor 402, an I/O (Input /Output) interface 404 and a memory 406 coupled with the processor 402 and the I/O interface 404.
  • the memory 406 is configured to store instructions.
  • the processor 402 is configured to execute the instructions. The instructions, when executed by the processor402, causes the processor 402 to perform the above step 203 and 204, and cause the processor 402 to control the I/O interface 404 to receive a signal.
  • the PCC 500 includes a processor 502, an I/O interface504 and a memory 506, the processor 502coupled with the memory 506 and the I/O interface 504.
  • the memory 506 is configured to store instructions.
  • the processor 502 is configured to execute the instructions. The instructions, when executed by the processor 502, cause the processor 502 to perform the above step 201and step 202, and cause the processor 502 to control the I/O interface 504 to transmit the a signal.
  • the processor may be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, state machines, logic circuitries, and/or any devices that manipulate signals based on operational instructions.
  • at least one processor is configured to fetch and execute computer-readable instructions stored in the memory.
  • the I/O interface may include a variety of software and hardware interfaces, for example, a web interface, a graphical user interface, and the like.
  • the I/O interface can facilitate multiple communications within a wide variety of networks and protocol types, including wired networks, for example, Local Area Network (LAN) , cable, etc., and wireless networks, such as Wireless LAN (WLAN) , cellular, or satellite.
  • the I/O interface may include one or more ports for connecting a number of devices to one another or to another server.
  • the memory may include any computer-readable medium known in the art including, for example, volatile memory, such as static random access memory (SRAM) and dynamic random access memory (DRAM) , and/or non-volatile memory, such as read only memory (ROM) , erasable programmable ROM, flash memories, hard disks, optical disks, and magnetic tapes.
  • volatile memory such as static random access memory (SRAM) and dynamic random access memory (DRAM)
  • non-volatile memory such as read only memory (ROM) , erasable programmable ROM, flash memories, hard disks, optical disks, and magnetic tapes.
  • ROM read only memory
  • erasable programmable ROM erasable programmable ROM
  • flash memories hard disks
  • optical disks optical disks
  • magnetic tapes magnetic tapes.
  • the embodiment of the present application may include another PCE in a network.
  • Figure 6 is a schematic diagram of the PCE according to an embodiment of the present application. Other parts can refer to the existing technology
  • the PCE 600 includes a receiving module 602 and a processing module 604.
  • the receiving module 602 is configured to receive a path computation element communication protocol (PCEP) message transmitted by a Path Computation Client (PCC) .
  • PCEP path computation element communication protocol
  • the PCEP message includes a tie breaking selection criteria field having at least a tie breaking selection criteria indicating the PCE to select a path from at least two equal cost paths.
  • the processing module 604 is configured to select a path according to the tie breaking selection criteria in the PCEP message.
  • the embodiment of the present application may include another PCE in a network.
  • Figure 7 is a schematic diagram of the PCC 700according to an embodiment of the present application. Other parts can refer to the existing technology of PCC and not be described in the present application.
  • the PCC 700 includes a processing module702and a transmitting module 704.
  • the processing module 702 is configured to generate a path computation element communication protocol (PCEP) message, wherein the PCEP message includes a tie breaking selection criteria field having at least a tie breaking selection criteria indicating the PCE to select a path from two or more equal cost paths.
  • PCEP path computation element communication protocol
  • the transmitting module 704 is configured to transmit the PCEP message to the PCE.
  • the PCEP message may be a path computation request (PCReq) message or a path computation reply (PCRep) message or a path computation report (PCRpt) message.
  • PCeq path computation request
  • PCep path computation reply
  • PCpt path computation report
  • the PCEP message comprises a Label Switch Path Attributes (LSPA) object field including the tie breaking selection criteria field.
  • LSPA Label Switch Path Attributes
  • the tie breaking selection criteria field includes a Type Length Value (TLV) field, wherein the V field of the TLV field includes an array of units of flags numbered from the least significant bit as bit zero, where each bit represents one tie breaking criteria.
  • TLV Type Length Value
  • the tie breaking selection criteria to select the path for the communication is based at least on one of network performance parameters, the network performance parameters are selected from a set of parameters comprising: a bandwidth or a delay or a jitter or a packet loss or a throughput or a latency or an error rate or any combination thereof.
  • the disclosed system, apparatus, and method may be implemented in other manners.
  • the described apparatus embodiment is merely exemplary.
  • the unit division is merely logical function division and may be other division in actual implementation.
  • a plurality of units or components may be combined or integrated into another system, or some features may be ignored or not performed.
  • the displayed or discussed mutual couplings or direct couplings or communication connections may be implemented through some interfaces.
  • the indirect couplings or communication connections between the apparatuses or units may be implemented in electronic, mechanical, or other forms.
  • the functions When the functions are implemented in a form of a software functional unit and sold or used as an independent product, the functions may be stored in a computer-readable storage medium. Based on such an understanding, the technical solutions of the present application essentially, or the part contributing to the prior art, or a part of the technical solutions may be implemented in a form of a software product.
  • the computer software product is stored in a storage medium, and includes several instructions for instructing a computer node (which may be a personal computer, a server, or a network node) to perform all or a part of the steps of the methods described in the embodiment of the present application.
  • the foregoing storage medium includes: any medium that can store program code, such as a USB flash drive, a removable hard disk, a read-only memory (Read-Only Memory, ROM) , a random access memory (Random Access Memory, RAM) , a magnetic disk, or an optical disc.
  • program code such as a USB flash drive, a removable hard disk, a read-only memory (Read-Only Memory, ROM) , a random access memory (Random Access Memory, RAM) , a magnetic disk, or an optical disc.
  • Devices that are in communication with each other need not be in continuous communication with each other, unless expressly specified otherwise.
  • devices that are in communication with each other may communicate directly or indirectly through one or more intermediaries.

Landscapes

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

Abstract

Les modes de réalisation de la présente invention concernent un procédé et un appareil destinés à sélectionner un trajet dans un réseau, le procédé consistant : à recevoir, au moyen d'un PCE, un message de protocole de communication d'élément de calcul de trajet (PCEP) demandant un trajet transmis par un client de calcul de trajet (PCC), le message PCEP comprenant un champ de critères de sélection de rupture de lien comprenant des critères de sélection de rupture de lien ordonnant au PCE de sélectionner un trajet à partir d'au moins deux trajets de coût égaux ; et à sélectionner, au moyen du PCE, le trajet conformément aux critères de sélection de rupture de lien dans le message PCEP. Le procédé du mode de réalisation de la présente invention assure une utilisation efficace de la ressource de réseau.
PCT/CN2017/099450 2016-09-21 2017-08-29 Appareil et procédé destinés à la sélection de trajet WO2018054197A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201780057174.3A CN109716718A (zh) 2016-09-21 2017-08-29 路径选择的方法和装置

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
IN201641032256 2016-09-21
IN201641032256 2016-09-21

Publications (1)

Publication Number Publication Date
WO2018054197A1 true WO2018054197A1 (fr) 2018-03-29

Family

ID=61690166

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/099450 WO2018054197A1 (fr) 2016-09-21 2017-08-29 Appareil et procédé destinés à la sélection de trajet

Country Status (2)

Country Link
CN (1) CN109716718A (fr)
WO (1) WO2018054197A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111245644A (zh) * 2019-12-31 2020-06-05 网络通信与安全紫金山实验室 一种sdn场景下扩展pcep协议自动创建隧道的方法及系统

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110838965B (zh) * 2019-09-25 2022-02-11 北京华为数字技术有限公司 一种隧道建立方法以及接收节点

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101237399A (zh) * 2007-09-28 2008-08-06 华为技术有限公司 获取标签交换路径的方法、系统和设备
US20080267088A1 (en) * 2007-04-30 2008-10-30 Future Wei Technologies Inc. Optimal Path Selection for Accessing Networked Applications
CN101645847A (zh) * 2009-08-25 2010-02-10 中兴通讯股份有限公司 一种在传送网络中提高业务恢复速度的方法及系统
CN105515981A (zh) * 2014-10-17 2016-04-20 中兴通讯股份有限公司 算路方法、隧道建立方法、pcc、pce及算路系统

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8320255B2 (en) * 2005-02-02 2012-11-27 Cisco Technology, Inc. Inter-domain path computation technique
CN101778041B (zh) * 2009-12-31 2012-07-18 福建星网锐捷网络有限公司 路径选择方法、装置和网络设备
US9124506B2 (en) * 2013-06-07 2015-09-01 Brocade Communications Systems, Inc. Techniques for end-to-end network bandwidth optimization using software defined networking
CN104168191B (zh) * 2014-08-31 2017-04-19 西安电子科技大学 大规模软件定义网络中满足多约束参数的路由方法
CN104283807B (zh) * 2014-09-17 2018-07-24 新华三技术有限公司 一种te隧道建立方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080267088A1 (en) * 2007-04-30 2008-10-30 Future Wei Technologies Inc. Optimal Path Selection for Accessing Networked Applications
CN101237399A (zh) * 2007-09-28 2008-08-06 华为技术有限公司 获取标签交换路径的方法、系统和设备
CN101645847A (zh) * 2009-08-25 2010-02-10 中兴通讯股份有限公司 一种在传送网络中提高业务恢复速度的方法及系统
CN105515981A (zh) * 2014-10-17 2016-04-20 中兴通讯股份有限公司 算路方法、隧道建立方法、pcc、pce及算路系统

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111245644A (zh) * 2019-12-31 2020-06-05 网络通信与安全紫金山实验室 一种sdn场景下扩展pcep协议自动创建隧道的方法及系统
CN111245644B (zh) * 2019-12-31 2022-12-16 网络通信与安全紫金山实验室 一种sdn场景下扩展pcep协议自动创建隧道的方法及系统

Also Published As

Publication number Publication date
CN109716718A (zh) 2019-05-03

Similar Documents

Publication Publication Date Title
US11909645B2 (en) Segment routing traffic engineering based on link utilization
US8077713B2 (en) Dynamic update of a multicast tree
US9860161B2 (en) System and method for computing a backup ingress of a point-to-multipoint label switched path
US10250459B2 (en) Bandwidth on-demand services in multiple layer networks
US8830826B2 (en) System and method for computing a backup egress of a point-to-multi-point label switched path
EP3131243B1 (fr) Procédés de négociation d'étiquette de flux et dispositives associés
US20160006614A1 (en) Source Routing Using Path Computation Elements
CN110870261B (zh) Pecp分段路由路径分段标签绑定扩展
US11588725B2 (en) Method and apparatus for path computation
CN113709034B (zh) 一种用于网络路由的方法、路由器及网络控制设备
CN108881017B (zh) 改变多路径标签交换路径中每跳带宽约束的方法及路由器
CN112187649A (zh) 一种报文转发方法、报文处理方法及装置
WO2013013642A1 (fr) Procédé de traitement de service inter-anneaux et nœud de croisement
US20210336810A1 (en) Multicast (p2mp) support for path computation element central controller (pcecc)
WO2018054197A1 (fr) Appareil et procédé destinés à la sélection de trajet
WO2020021558A1 (fr) Procédés, appareil et supports lisibles par machine se rapportant à un calcul de chemin dans un réseau de communication
WO2022237562A1 (fr) Procédé et appareil de calcul de chemin, support de stockage et dispositif électronique
US20140269737A1 (en) System, method and apparatus for lsp setup using inter-domain abr indication
CN116530065A (zh) 使用路径计算单元协议创建sr策略的方法、装置及系统

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

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

Country of ref document: EP

Kind code of ref document: A1