WO2009043256A1 - Procédé, système et dispositif d'obtention de trajets à commutation par étiquette - Google Patents

Procédé, système et dispositif d'obtention de trajets à commutation par étiquette Download PDF

Info

Publication number
WO2009043256A1
WO2009043256A1 PCT/CN2008/072260 CN2008072260W WO2009043256A1 WO 2009043256 A1 WO2009043256 A1 WO 2009043256A1 CN 2008072260 W CN2008072260 W CN 2008072260W WO 2009043256 A1 WO2009043256 A1 WO 2009043256A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
request
module
path calculation
constraint condition
Prior art date
Application number
PCT/CN2008/072260
Other languages
English (en)
Chinese (zh)
Inventor
Hongmiao Xia
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.
Publication of WO2009043256A1 publication Critical patent/WO2009043256A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/42—Centralised routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/645—Splitting route computation layer and forwarding layer, e.g. routing according to path computational element [PCE] or based on OpenFlow functionality

Definitions

  • the present invention relates to the field of communications, and in particular, to a method, system, and device for acquiring a label switching path.
  • Traffic Engineering focuses on the optimization of overall network performance. Its main goal is to provide efficient and reliable network services, optimize the use of network resources, and optimize network traffic. Traffic engineering is divided into two levels: First, it is traffic-oriented, that is, how to improve the service quality of the network; Second, it is resource-oriented, that is, how to optimize the use of network resources, the most important thing is how to effectively use bandwidth resources.
  • traffic-oriented that is, how to improve the service quality of the network
  • resource-oriented that is, how to optimize the use of network resources, the most important thing is how to effectively use bandwidth resources.
  • GMPLS Geneneral Multiple Protocol Label Switch
  • MPLS Multiple Protocol Label Switch
  • GMPLS traffic engineering are important components.
  • the path calculation between multiple ASs is very complex. It may require the computing entities of different ASs to cooperate and work together.
  • the constrained path calculation method based on the PCE (Path Computation Element) model can also be applied to inter-domain traffic engineering. This calculation method does not affect the use of calculated paths, such as LSP (Label Swithing Path). Path) establishment, maintenance and removal.
  • the inbound label switching router PCC
  • the PCE When the LSP path is established by the ingress label switch (PC), the inbound label switching router (PCC) sends a request to the PCE through the PCEP protocol packet.
  • the destination information is included in the request information.
  • Basic information such as address and various constraints.
  • the PCE Based on the network topology information in the TED (Traffic Engineering Database), the PCE calculates the path that satisfies the condition of the request, and returns the response packet to the PCC as the ER0 (Explicit Route Object).
  • Path object the calculation results can contain precise nodes (a router) and loose nodes (a network segment, a region or an AS).
  • the calculation range that a PCE is responsible for is generally an AS. This is because the range of the TED information spread by the IGP (Interior Gateway Protocol) is an AS. When the destination of the calculation request is another AS, PCE collaboration between different ASs is required to complete the calculation of a path.
  • the PCE is not limited to a specific implementation, and may be implemented in a router or in a designated server.
  • the PCE (Path Computation Element Discovery Protocol) is responsible for PCC's discovery of the existence and computing power of the PCE.
  • the PCE is selected to send a calculation request for calculation;
  • PCEP Path Computation Element Communication Protocol
  • PCC contains various constraints.
  • PCE calculation requires other PCEs for assistance, Communication between PCEs also requires this communication protocol support.
  • the PCEP protocol carries various information in the form of TLV (Type, Length, Value, Type, Length, and Value).
  • TLV Type, Length, Value, Type, Length, and Value.
  • the encapsulation format is as follows:
  • Object-Class object type
  • Object-Type object type
  • processing rule field when set, indicates that the constraint described by the object must be processed
  • I Ignore the field, when set, indicates whether the constraint described by the object is ignored during the calculation
  • Object Length the length of the entire object
  • Object body The content of the object.
  • Object-Class and Object-Type only represent 'objects, and when 0b ject-Class and 0b ject-Type are determined, the contents of the Object body are determined.
  • R1_R3-R5. Assuming that each node and each link have the same probability of failure, it can be known from the perspective of probability that R1-R2-R4-R5 should have a higher probability of failure than R1-R3-R5. In other words, the fewer links and nodes that pass, the more reliable the path is.
  • an embodiment of the present invention provides a method, system, and device for acquiring a label switching path.
  • the technical solution is as follows:
  • An embodiment of the present invention provides a method for obtaining a label switching path, where the method includes:
  • a path calculation request carrying a destination address, a basic constraint condition, and a hop count constraint condition; calculating a path that satisfies the basic constraint condition according to a network topology structure and a destination address in the request; Selecting a path in which the number of hops satisfies the hop limit constraint;
  • An embodiment of the present invention provides a system for acquiring a label switching path, where the system includes:
  • a path calculation requesting device configured to send a path calculation request, where the request carries a destination address, a basic constraint, and a hop limit constraint;
  • a path calculation device configured to receive a path calculation request sent by the path calculation requesting device, calculate a path that satisfies the basic constraint condition according to a network topology structure and a destination address in the request, and select a path selected from the calculated path The hop counts the path satisfying the hop limit constraint, and returns the selected path to the path calculation requesting device.
  • the embodiment of the invention provides a device, and the device includes:
  • a packet extension module configured to extend a path calculation node communication protocol packet, and carry the hop limit constraint condition in the packet
  • a path calculation request sending module configured to use the path calculation node communication protocol packet sending path calculation request extended by the packet extension module, where the packet carries a destination address, a basic constraint condition, and a hop limit constraint condition;
  • the receiving module is configured to receive a path calculated by the path computing device. Further, the embodiment of the present invention further provides a device, where the device includes:
  • a path calculation request receiving module configured to receive a path calculation request, where the request carries a destination address, a basic constraint condition, and a hop limit constraint condition;
  • a path calculation module configured to calculate a destination address in the request received by the request receiving module according to the network topology and the path, and calculate a path that satisfies the basic constraint condition
  • a path selection module configured to select, from the path calculated by the path calculation module, a path whose hop count satisfies the hop limit condition
  • a sending module configured to return the path selected by the path selection module to the path calculation requesting device.
  • the hop count is increased as a new constraint. If other constraints are met, the path with the smallest hop count is selected, and the path passes through the node. The less the path, the higher the reliability of the path. Therefore, after the hop count is used as the constraint, a better LSP path can be obtained.
  • FIG. 1 is a schematic diagram of a ⁇ path node in the prior art
  • FIG. 2 is a flowchart of a method for acquiring a label switching path according to Embodiment 1 of the present invention
  • FIG. 3 is a structural diagram of a system for acquiring a label switching path according to Embodiment 2 of the present invention.
  • FIG. 4 is a structural diagram of an apparatus according to Embodiment 3 of the present invention.
  • FIG. 5 is a structural diagram of an apparatus according to Embodiment 4 of the present invention. detailed description
  • the hop count object is introduced into the PCEP protocol packet, and the hop count is used as the constraint condition of the CSPF calculation. When other constraints are met, the path with the least hop count is selected.
  • An embodiment of the present invention provides a method for obtaining a label switching path, which is implemented by a PCE, and includes: receiving a path calculation request, where the request carries a destination address, a basic constraint, and a hop limit constraint; according to the network topology and the request Destination address, calculate the path that satisfies the basic constraints;
  • the PCE in this embodiment may be a router or a designated server, configured to receive path calculation request information of the PCC, and calculate an LSP path that satisfies the constraint condition.
  • the foregoing method for obtaining a label switching path specifically includes the following steps:
  • Step 101 Extend the PCEP protocol packet, and introduce a new hop count object, that is, a MAX-H0P Object, into the PCEP protocol packet, and use the hop count as a constraint condition for obtaining the LSP path.
  • a new hop count object that is, a MAX-H0P Object
  • the Object-Class and Object-Type of the newly introduced hop object need to be additionally applied to distinguish them from some existing Objects.
  • the Object body format of the hop object is as follows:
  • S (Scope): Indicates the meaning of the hop count, whether it is a Node Hop or an Area Hop, or an AS Hop (AS hops) field that occupies 3 bits.
  • R Flag bit, which can be set to 1 or 0. It can be set to 1, indicating that the PCC needs to know the actual hop count of the path; by setting it to 0, the PCC does not need to know the actual hop count of the path, and the PCE does not need to return.
  • Hop-value Indicates the actual hop count of the path calculated by the PCE. For example, the hop-value is 3, which indicates that the hop count of the path calculated by the PCE is 3. You can determine which hop-value is specified based on the set value of the S field. The number of hops.
  • the PCE can return the minimum hop count in the actual path for PCC reference in the response message sent by the PCE to notify the PCC that the packet fails to be calculated.
  • the minimum hop count in the actual path is 7, PCE By setting the bit in the hop count object, the minimum hop count 7 is returned to the PCC in the response message sent by the PCE to notify the PCC that the calculation fails.
  • the PCC does not use the hop count as a constraint when calculating the path for the PCE, but requires the PCE to return the hop count as a result to the PCC after calculating the path.
  • Step 102 When the PCC establishes an LSP path, send a path calculation request to the PCE.
  • PCEs there may be one or more PCEs.
  • the PCC is sending PCEP to the PCE. Before the message, you can select a suitable PCE based on the computing power of each PCE.
  • the path calculation request carries the information of the constraint and the destination address of the path to be established by the PCC.
  • the constraint includes a basic constraint such as a bandwidth, a forbidden node, and a management group.
  • the hop limit is also added to the constraint. The condition, that is, when other constraints are met, the PCE is required to select the path with the smallest number of hops.
  • the path calculation request can be in various forms.
  • the packet is used as an example.
  • the PCC sends the extended PCEP protocol packet to the PCE.
  • the extended PCEP protocol packet can be set.
  • the number of hops of the object is set to set the number of hops required by the PCC. For example, the maximum acceptable number of hops is set to 5.
  • Step 103 After receiving the path calculation request sent by the PCC, the PCE calculates a path that satisfies the basic constraint condition in the request according to the information in the TED.
  • the TED stores the topology information of the same network.
  • the PCE calculates the path that satisfies the basic constraints in the packet according to the destination address and network topology information of the received packet. In the path of the constraint, select the path whose hop count satisfies the hop constraint.
  • Step 104 Determine whether there is a path that satisfies the constraint, and if yes, execute step 105; otherwise, execute step 106.
  • Step 105 The PCE sends a PCEP response message to the PCC, where the response message carries information such as an LSR address of the path node that meets the constraint condition, and then performs step 107.
  • the calculation result of the CSPF algorithm is to output an external path, which includes a set of LSR addresses of the shortest path nodes satisfying the constraint conditions, and the PCE can encode the calculated LSR address information of the path nodes satisfying the constraint condition by ER0.
  • the way to return to the PCC For example, in Figure 2, if two suitable paths are found with the constraints of bandwidth, etc.: R1-R2-R4-R5 and R1_R3_R5, then compare the hop count of the two paths and select the path with the smallest hop count, ie R1 -R3-R5, then PCE returns this result to the PCC via the response message.
  • the PCE When the PCE calculates a number of paths that satisfy the constraint, it will pick the optimal path and return the selected path to the PCC.
  • Step 106 The PCE sends a PCEP response message to the PCC to notify the PCC that the calculation fails, that is, there is no path that satisfies the current constraint condition.
  • the PCE When the calculation of the PCE fails due to the hop count, that is, the PCE does not select a path that satisfies the hop limit constraint in the calculated path that satisfies the basic constraint condition, it is determined according to the flag bit R in the PCEP protocol packet sent by the PCC. Whether to return the calculated number of hops of the path to the PCC. For example, the maximum acceptable hop count required in the request message is 5, and the calculated minimum hop count of the actual path is 7. When the R position is 1, the minimum hop count 7 is returned to the response message. PCC is used as a reference. When the R position is 0, the hop count information is not returned.
  • Step 107 After receiving the response message sent by the PCE, the PCC extracts the path node information in the packet and uses it as a construction. Establish the ELSP parameters of the LSP, initiate signaling to establish an LSP, and establish an LSP path.
  • the response packet received by the PCC is a notification that the calculation fails, it can wait for a period of time to calculate again, or reduce the constraint condition and request to calculate a new path again.
  • the method is the same as above, and will not be described here.
  • the hop count object is introduced in the packet by extending the PCEP protocol packet.
  • the hop count is used as a constraint condition, and if other constraints are satisfied, the path with the smallest hop count is selected. The fewer the nodes passing through the path, the more reliable it is. Therefore, after the hop count is used as the constraint, a better LSP path can be obtained.
  • an embodiment of the present invention provides a system for acquiring a label switching path, which specifically includes:
  • the path calculation requesting device 201 is configured to send a path calculation request, where the request carries a destination address, a basic constraint, and a hop limit constraint;
  • the path calculation device 202 is configured to receive a path calculation request sent by the path calculation requesting device 201, calculate a path that satisfies the basic constraint according to the network topology and the destination address in the request, and select a hop count from the calculated path to satisfy the hop. The path of the number of constraints is returned, and the selected path is returned to the path calculation requesting device 201.
  • the path calculation requesting device 201 may specifically include:
  • a message extension module configured to extend a path calculation node communication protocol packet, and carry a hop count constraint condition in the packet; the path calculation request sending module, and the path calculation node communication protocol packet sent by using the ten-use message extension module
  • the path calculation request carries the destination address, the basic constraint, and the hop limit constraint.
  • the path computing device 202 can specifically include:
  • a path calculation request receiving module configured to receive a path calculation request sent by the path calculation requesting device 201, and a path calculation module, configured to calculate a destination address in the request received by the request receiving module according to the network topology structure and the path, and calculate a basic constraint condition Path
  • a path selection module configured to select, from the path calculated by the path calculation module, a path whose hop count satisfies the hop constraint
  • a sending module configured to return the path selected by the path selection module to the path calculation requesting device 201.
  • an embodiment of the present invention provides an apparatus.
  • the device provided in this embodiment may be used to send a path calculation request when establishing an LSP path, and specifically includes:
  • the message expansion module 301 is configured to: extend the path calculation node communication protocol message, and carry the hop limit constraint condition in the message; the path calculation request sending module 302 is configured to use the path expansion node communication protocol extended by the message expansion module 301.
  • the packet is sent to the path calculation request, and the packet carries the destination address, the basic constraint, and the hop limit constraint.
  • the receiving module 303 is configured to receive a path calculated by the path computing device.
  • an embodiment of the present invention further provides an apparatus.
  • the device provided in this embodiment may be configured to receive a path calculation request, and calculate a path that meets a constraint condition in the request according to the request, and specifically includes:
  • the path calculation request receiving module 401 is configured to receive a path calculation request, where the request carries a destination address, a basic constraint condition, and a hop limit constraint condition;
  • the path calculation module 402 is configured to calculate a destination address in the request received by the request receiving module 401 according to the network topology and the path, and calculate a path that satisfies the basic constraint condition;
  • the path selection module 403 is configured to select, from the path calculated by the path calculation module 402, a path whose hop count satisfies the hop constraint condition;
  • the sending module 404 is configured to return the path selected by the path selecting module 403 to the path calculation requesting device.
  • the embodiments of the present invention can be implemented by software, and the corresponding software can be stored in a readable storage medium, such as a hard disk, a floppy disk or an optical disk of a computer, or a network device such as a router.
  • a hop count object is introduced in a PCEP packet. When the PCC establishes an LSP path, the hop count is used as a constraint condition, and if other constraints are satisfied, the path with the smallest hop count is selected, and the ⁇ path is passed. The fewer the nodes, the more reliable they are.

Landscapes

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

Abstract

L'invention concerne un procédé, un système et un dispositif d'obtention de trajets à commutation par étiquette. Le procédé consiste à: recevoir une demande de calcul de trajets comportant une adresse de destination, un état de contraintes élémentaire et un état de contraintes de saut; calculer des trajets conformes à un état de contraintes élémentaire basé sur une structure de topologie de réseau et sur l'adresse de destination; choisir parmi les trajets calculés un trajet dont le saut est conforme à l'état de contraintes de saut; retourner le trajet choisi à un module d'envoi de demande de calcul de trajets. Le système comprend un dispositif de demande de calcul de trajets et un dispositif de calcul de trajets. Le dispositif comprend un module d'extension de messages, un module d'envoi de demande de calcul de trajets et un module récepteur. On décrit un autre dispositif comprenant un module de réception de demande de calcul de trajets, un module de calcul de trajets; un module de sélection de trajets et un module d'envoi. L'invention améliore la fiabilité du trajet calculé en ajoutant l'état de contraintes de saut au cours du calcul de trajets.
PCT/CN2008/072260 2007-09-28 2008-09-03 Procédé, système et dispositif d'obtention de trajets à commutation par étiquette WO2009043256A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CNA2007101752960A CN101237399A (zh) 2007-09-28 2007-09-28 获取标签交换路径的方法、系统和设备
CN200710175296.0 2007-09-28

Publications (1)

Publication Number Publication Date
WO2009043256A1 true WO2009043256A1 (fr) 2009-04-09

Family

ID=39920765

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/072260 WO2009043256A1 (fr) 2007-09-28 2008-09-03 Procédé, système et dispositif d'obtention de trajets à commutation par étiquette

Country Status (2)

Country Link
CN (1) CN101237399A (fr)
WO (1) WO2009043256A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116208527A (zh) * 2023-02-28 2023-06-02 西安电子科技大学 收发信机受限的移动自组织网络的抗毁性评估方法

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101237399A (zh) * 2007-09-28 2008-08-06 华为技术有限公司 获取标签交换路径的方法、系统和设备
CN101645847A (zh) * 2009-08-25 2010-02-10 中兴通讯股份有限公司 一种在传送网络中提高业务恢复速度的方法及系统
CN102201971A (zh) * 2010-03-23 2011-09-28 中兴通讯股份有限公司 一种实现伪线路由的方法、装置和系统
CN103155498A (zh) * 2010-07-15 2013-06-12 华为技术有限公司 用于实施p2mp路径计算的方法和设备
US8837292B2 (en) * 2010-09-21 2014-09-16 Telefonaktiebolaget L M Ericsson (Publ) Relayed CSPF computation for multiple areas and multiple autonomous systems
CN102523156B (zh) * 2011-12-09 2014-11-26 北京邮电大学 一种基于跳数约束的选路方法
CN103532849B (zh) * 2012-07-06 2018-10-23 中兴通讯股份有限公司 一种计算频谱时序通道的方法、路径计算单元与节点
US9705747B1 (en) 2012-12-04 2017-07-11 Qualcomm Incorporated Distributed path selection in hybrid networks
US9184998B2 (en) 2013-03-14 2015-11-10 Qualcomm Incorporated Distributed path update in hybrid networks
WO2014139356A1 (fr) * 2013-03-15 2014-09-18 Huawei Technologies Co., Ltd. Méthode de communication pour établir un chemin et appareil de réseau
CN104092611B (zh) * 2014-07-17 2018-05-15 新华三技术有限公司 确定跨区域受约束的标签交换路径的方法及装置
CN105306245B (zh) * 2014-07-31 2019-02-22 新华三技术有限公司 流量工程链路信息维护方法及装置
CN105515981A (zh) * 2014-10-17 2016-04-20 中兴通讯股份有限公司 算路方法、隧道建立方法、pcc、pce及算路系统
CN105681190A (zh) * 2014-11-21 2016-06-15 中兴通讯股份有限公司 一种隧道约束信息的发送、接收方法及装置
CN105763447B (zh) * 2014-12-16 2020-04-24 中兴通讯股份有限公司 一种标签交换路径状态的获取方法及装置
CN107154862A (zh) * 2016-03-04 2017-09-12 上海海岸展览服务有限公司 一种中间人推荐方法和系统
CN107800637B (zh) * 2016-08-30 2021-06-22 中国电信股份有限公司 一种用于确定业务传输路径的方法、pce及sdn网络
CN109716718A (zh) * 2016-09-21 2019-05-03 华为技术有限公司 路径选择的方法和装置
CN107864103B (zh) * 2016-09-22 2022-10-11 中兴通讯股份有限公司 一种隧道建立的方法及装置
CN108075939B (zh) * 2016-11-17 2020-06-09 中国电信股份有限公司 网络质量检测系统和方法
CN108123871B (zh) * 2016-11-28 2021-10-26 中兴通讯股份有限公司 等价多路径ecmp处理方法及装置
CN106789656B (zh) * 2016-12-16 2019-10-25 北京格林伟迪科技股份有限公司 一种路由请求处理方法和装置
CN108989065A (zh) * 2017-05-31 2018-12-11 中兴通讯股份有限公司 一种pcc请求算路失败的处理方法及装置
CN111385206B (zh) * 2018-12-29 2022-04-22 北京华为数字技术有限公司 报文转发的方法、网络系统、相关设备及计算机存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1764146A (zh) * 2004-10-21 2006-04-26 华为技术有限公司 一种最优路由的选择方法
JP2007235579A (ja) * 2006-03-01 2007-09-13 Nippon Telegr & Teleph Corp <Ntt> 制御装置、パス設定方法及びプログラム
CN101237399A (zh) * 2007-09-28 2008-08-06 华为技术有限公司 获取标签交换路径的方法、系统和设备

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1764146A (zh) * 2004-10-21 2006-04-26 华为技术有限公司 一种最优路由的选择方法
JP2007235579A (ja) * 2006-03-01 2007-09-13 Nippon Telegr & Teleph Corp <Ntt> 制御装置、パス設定方法及びプログラム
CN101237399A (zh) * 2007-09-28 2008-08-06 华为技术有限公司 获取标签交换路径的方法、系统和设备

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
J. ASH. ED. ET AL.: "Path Computation Element (PCE) Communication Protocol Generic Requirements", RFC 4657, September 2006 (2006-09-01) *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116208527A (zh) * 2023-02-28 2023-06-02 西安电子科技大学 收发信机受限的移动自组织网络的抗毁性评估方法
CN116208527B (zh) * 2023-02-28 2024-03-26 西安电子科技大学 收发信机受限的移动自组织网络的抗毁性评估方法

Also Published As

Publication number Publication date
CN101237399A (zh) 2008-08-06

Similar Documents

Publication Publication Date Title
WO2009043256A1 (fr) Procédé, système et dispositif d&#39;obtention de trajets à commutation par étiquette
JP4960443B2 (ja) 複数ドメインルート計算の方法とシステム
US10250459B2 (en) Bandwidth on-demand services in multiple layer networks
US8588081B2 (en) Monitoring a flow set to detect faults
US7814227B2 (en) Computation of a shortest inter-domain TE-LSP across a set of autonomous systems
CN101228739B (zh) 用于动态实施mpls-te域间策略和qos的方法、设备和系统
US8825898B2 (en) Technique for optimized routing of data streams on an IP backbone in a computer network
CN101483539B (zh) 一种获取路径的方法、路径计算单元和系统
EP2985960A1 (fr) Procédé et système de découverte de topologie réseau
US20050195835A1 (en) Router configured for outputting update messages specifying a detected attribute change of a connected active path according to a prescribed routing protocol
JP2013541290A (ja) 複数の領域及び複数の自律システムのためのリレーされるｃｓｐｆ
JP2010536285A (ja) 経路選択方法及びネットワークシステム、経路計算要素
US11632322B2 (en) Preferred path route graphs in a network
EP2009848B1 (fr) Calcul d&#39;un chemin dans un réseau à commutation d&#39;étiquettes
CN108574628B (zh) 域级拓扑的建立方法及装置、系统
WO2017211164A1 (fr) Procédé, appareil et système de détermination de tunnel de chemin à commutation d&#39;étiquettes entre systèmes autonomes
WO2018010658A1 (fr) Procédé et appareil de transfert d&#39;informations dans la réplication explicite indexée par bit
WO2008031337A1 (fr) Procédé de calcul de chemin en ingénierie de trafic, et système et élément de calcul de chemin
EP3361683B1 (fr) Procédé et dispositif de calcul de trajet
WO2008098452A1 (fr) Procédé, système et dispositif de réseau pour le calcul de trajet entre systèmes autonomes
EP2063585A1 (fr) Procédé et appareil pour le calcul d&#39;un chemin dans un réseau
WO2015024440A1 (fr) Procédé et système d&#39;obtention de la valeur de surdébit de liaison d&#39;une liaison ip
Dhody et al. Extensions to the Path Computation Element Communication Protocol (PCEP) to Compute Service-Aware Label Switched Paths (LSPs)
WO2008000125A1 (fr) Procédé, système et appareil pour découvrir un élément de calcul de chemin
WO2018053747A1 (fr) Procédé de partage de ressources, nœud de réseau et appareil associé

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

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

Country of ref document: EP

Kind code of ref document: A1