WO2010115365A1 - 一种路径计算方法、路径计算单元、节点设备和网络*** - Google Patents
一种路径计算方法、路径计算单元、节点设备和网络*** Download PDFInfo
- Publication number
- WO2010115365A1 WO2010115365A1 PCT/CN2010/071518 CN2010071518W WO2010115365A1 WO 2010115365 A1 WO2010115365 A1 WO 2010115365A1 CN 2010071518 W CN2010071518 W CN 2010071518W WO 2010115365 A1 WO2010115365 A1 WO 2010115365A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- network
- path
- calculated
- type identifier
- path calculation
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 10
- 238000004364 calculation method Methods 0.000 claims description 164
- 230000005540 biological transmission Effects 0.000 claims description 25
- 230000001360 synchronised effect Effects 0.000 claims description 4
- 230000003287 optical effect Effects 0.000 claims 2
- 238000010586 diagram Methods 0.000 description 12
- 238000005516 engineering process Methods 0.000 description 3
- 238000007667 floating Methods 0.000 description 3
- 230000004927 fusion Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000001172 regenerating effect Effects 0.000 description 1
- 230000008054 signal transmission Effects 0.000 description 1
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/125—Shortest path evaluation based on throughput or bandwidth
-
- 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
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
- H04J3/1605—Fixed allocated frame structures
- H04J3/1611—Synchronous digital hierarchy [SDH] or SONET
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
- H04J3/1605—Fixed allocated frame structures
- H04J3/1652—Optical Transport Network [OTN]
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J2203/00—Aspects of optical multiplex systems other than those covered by H04J14/05 and H04J14/07
- H04J2203/0001—Provisions for broadband connections in integrated services digital network using frames of the Optical Transport Network [OTN] or using synchronous transfer mode [STM], e.g. SONET, SDH
- H04J2203/0098—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
Definitions
- a path calculation method, a path calculation unit, a node device, and a network system The application is submitted to the Chinese Patent Office on April 8, 2009, and the application number is 200910133506.9.
- the invention name is "a path calculation method, a path calculation unit, and a node. The priority of the Chinese Patent Application, the entire disclosure of which is incorporated herein by reference.
- the present invention relates to the field of communication technologies, and in particular to the field of path calculation technologies in a network, and in particular to a path calculation method, a path calculation unit, a node device, and a network system.
- TE Traffic Engineering
- CSPF Constraint Shortest Path First
- PCC Path Computation Client
- the PCE is a functional entity responsible for path computation in the network. Based on the known network topology and constraints, the PCE calculates a traffic engineering path that satisfies the constraint according to the request of the path computation client.
- the PCE can be located anywhere in the network, can be integrated inside a network device, or it can be a standalone device.
- the Path Computation Client requests the PCE to calculate the path and receives the path returned by the PCE.
- the PCC and the PCE communicate with each other through the Path Calculation Protocol (PCEP, PCE Protocol), and the PCEP message is used to submit a path calculation request and obtain a path calculation result.
- PCEP Path Calculation Protocol
- PCEP PCE Protocol
- FIG. 1 shows the specific format of the "BANDWIDTH” field, which is a floating point value.
- the path calculation unit calculates the path based on the "BANDWIDTH” field.
- MRN multi-domain network
- Networks the network has a variety of LSPs (Switch Switch Path), such as wavelength LSPs, TDM LSPs, and Ethernet packet-switched LSPs.
- Switch Switch Path such as wavelength LSPs, TDM LSPs, and Ethernet packet-switched LSPs.
- Embodiments of the present invention provide a path calculation method, a path calculation unit, a node device, and a network system to implement traffic engineering path calculation in a multi-domain network.
- An embodiment of the present invention provides a path calculation method, where the method includes: receiving a path calculation request message, where the path calculation request message carries a network type identifier and a traffic parameter constraint condition of the path that is requested to be calculated; Identifying, by the network type identifier, the network, and determining a path in the network according to the traffic parameter constraint;
- the path calculation response message carries the calculated path.
- An embodiment of the present invention provides a path calculation method, where the method includes:
- the path calculation request message carries a network type identifier and a traffic parameter constraint condition of the path to be calculated; the network type identifier indicates a type of the network where the path to be calculated is located; a path calculation response message carrying a path returned by the path calculation unit, where the path calculation response message is determined by the path calculation unit by using the network type identifier, and is calculated in the network according to the traffic parameter constraint condition obtain.
- An embodiment of the present invention provides a path calculation unit, including:
- a request receiving module configured to receive a path calculation request message, where the path calculation request message carries a network type identifier and a traffic parameter constraint condition of the path to be calculated; the network type identifier Indicates the type of network where the path to request calculation is located;
- a calculating module configured to determine the network by using the network type identifier, and calculate a path in the network according to the traffic parameter constraint condition
- the path sending module is configured to send a path calculation response message, where the path calculation response message carries the calculated path.
- An embodiment of the present invention provides a node device, including:
- a request sending module configured to send a path calculation request to the path calculation unit, where the path calculation request message carries a network type identifier and a traffic parameter constraint condition of the path to be calculated; the network type identifier indicates a path where the path to be calculated is located type;
- the response receiving module is configured to receive a path calculation response message of the carrying path returned by the path calculating unit, where the path calculation response message carries the calculated path, where the path is determined by the path calculation unit by using the network type identifier Determining the network, calculated and obtained in the network according to the traffic parameter constraint.
- the embodiment of the present invention further provides a network system, where the network system includes a node and a path calculation unit, where the path calculation unit is configured to: receive a path calculation request message from the node, where the path calculation request message carries a network type identifier and a traffic parameter constraint requesting the calculated path; the network type identifier indicating a type of the network where the path to be calculated is located;
- the beneficial effects of the embodiment of the present invention are: because the method of carrying the network type identifier in the path calculation request message is used, and after the network is determined by the network type identifier, the path is calculated according to the traffic parameter constraint condition in the network, thereby overcoming A technical problem that cannot distinguish path calculation requests from different network domains.
- FIG. Fig. 2 A specific format diagram of the ⁇ B AND WIDTH> object in the format of the prior art path calculation request message shown in FIG. Fig. 2 is a flow chart showing the path calculation method of the embodiment 1 of the present invention.
- Fig. 3 is a flow chart showing the path calculation method of the embodiment 2 of the present invention.
- FIG. 4 is a detailed format diagram of an SDH (Synchronous Digital Hierarchy) transmission traffic standard according to Embodiment 2 of the present invention.
- SDH Serial Digital Hierarchy
- Fig. 5 is a flow chart showing the path calculation method of the embodiment 3 of the present invention.
- Fig. 7 is a flow chart showing the path calculation method of the embodiment 4 of the present invention.
- FIG. 8 is a detailed format diagram of an Ethernet transmission traffic standard according to Embodiment 4 of the present invention.
- Figure 9 is a diagram showing the type length value of the Ethernet transmission traffic standard of Embodiment 4 of the present invention.
- Figure 10 is a block diagram showing the structure of a path calculation unit of Embodiment 5 of the present invention.
- Fig. 11 is a block diagram showing the configuration of a node apparatus according to a sixth embodiment of the present invention.
- Figure 12 is a block diagram showing the structure of a network system according to a seventh embodiment of the present invention. detailed description
- FIG. 2 is a flow chart showing a path calculation method according to Embodiment 1 of the present invention. As shown in Figure 2, this The path calculation method of the embodiment 1 of the invention includes:
- the PCE receives a path calculation request message from the PCC, where the path calculation request message carries a network type identifier and a traffic parameter constraint condition of the path to be calculated.
- the network type identifier indicates a type of the network where the path to be calculated is located.
- the PCE determines the network by using the foregoing network type identifier, and calculates a path in the network according to the traffic parameter constraint condition.
- the PCE sends a path calculation response message to the PCC, where the path calculation response message carries the calculated path.
- the method for carrying the network type identifier in the path calculation request message is used, and after the network is determined by the network type identifier, the path is calculated according to the traffic parameter constraint condition in the network, thereby overcoming the inability to distinguish different domains.
- the path calculation request and the bandwidth of the floating point value cannot clearly define the technical problem of the path traffic parameter constraint, thereby solving the problem of distinguishing and calculating the traffic engineering path of multiple types of services in the multi-domain fusion network.
- Fig. 3 is a flow chart showing the path calculation method of the embodiment 2 of the present invention.
- Fig. 4 is a view showing a specific format of an SDH transmission traffic standard according to Embodiment 2 of the present invention.
- the path calculation method in Embodiment 2 of the present invention includes:
- S301 Receive a path calculation request message, where the path calculation request message carries a network type identifier and a traffic parameter constraint condition of the path that is requested to be calculated; the network type identifier indicates that the path where the path to be calculated is located is a synchronous digital system SDH network, and the foregoing traffic Parameter constraints include signal type, cascading type, and number of cascades;
- the PCC sends a path calculation request message to the PCE, and may carry the network type identifier and the traffic parameter constraint condition of the path to be calculated by using the SDH SENDER_TSPEC (SDH Transmission Traffic Standard) object in the path calculation request.
- the above traffic parameter constraints may include constraints such as signal transmission, cascading type, and cascading number, and may also include constraints such as transparent transmission and monitoring.
- the SDH SENDER - TSPEC can use the format of Figure 4. Class-Num, C-Type, Signal Type, and Multiplier are mandatory. At least one field is required in the NCC and NVC fields.
- Length length, used to indicate the length of the SDH SENDER - TSPEC field
- Class-Num and C-Type These two fields are used together to represent the network type identifier of the SDH network.
- Class-Num represents a large class with a value of 12
- C-Type represents a small class with a value of 4.
- the network type identifier of the large class 12 and the small class 4 is used to represent the SDH network.
- Signal Type used to indicate the signal type, that is, the basic unit of the signal on the path, such as VC-3 or VC-4;
- NCC Number of Contiguous Components: The number of basic units of a signal included in a continuous cascade when the cascading type used for continuous cascading is continuous cascading.
- the basic unit of the signal is VC- 4.
- the NCC value is 4; this field can be used alone or in combination with the following RCC field; when the field does not exist or the value is 0 , indicating that continuous cascading may not be supported;
- RCC Requested Contiguous Concatenation: The format of the above-mentioned continuous concatenation when the concatenation type used is continuous concatenation; when the value is 1, the value specified by the existing standard is specified. Continuous cascading format; this field is optional and can only be used in conjunction with the NCC field;
- NVC Number of Virtual Components: The number of basic units of a signal included in a virtual concatenation when the concatenation type used for virtual concatenation is virtual concatenation.
- the basic unit of the signal is VC- 4.
- the NCC is 4; when the field does not exist or the value is 0, it means that the virtual concatenation may not be supported; 4 VC-4s are represented as VC4x4;
- Multiplier Used to indicate the number of cascades. This value is a natural number. When no virtual concatenation and continuous concatenation are used, for example, if the NCC field and the NVC field do not exist, the value indicates the basic unit of the signal used.
- the value indicates the number of consecutive cascades used; when the virtual concatenation is used instead of continuous concatenation, for example, the NVC field exists and is not 0, and If the NCC field does not exist, the value indicates the number of virtual concatenations used; when both consecutive concatenation and virtual concatenation are used, for example, if both the NCC field and the NVC field exist and are not 0, The value indicates the number of virtual concatenations used;
- Transparency Used to indicate whether the transparent transmission function is supported. Different values of this value can indicate different overheads for transparent transmission. For example, when 1 is used, it indicates the transparent transmission segment overhead; when 0, it indicates the transparent transmission segment overhead; the field is an optional field. When the field does not exist, it indicates that the transparent transmission function is not supported.
- Profile(P) An attribute field that indicates whether a function other than the one represented by the above field is supported, such as the monitoring function, which is an optional field.
- the PCE calculates the path by using an algorithm according to the traffic parameter constraint including the above signal type, the cascading type, and the number of cascading, excluding the link that does not satisfy the traffic parameter constraint. For example, if the value of Multiplier is 2, the value of the Signal Type field is VC-4, and the value of the NCC field is 4, it means that when calculating the path, it is necessary to exclude the continuous cascading link whose bandwidth does not support two VC-4x4. When the value of Transparency(T) is 1, it means that the link that does not support the transparent transmission regenerative overhead function needs to be excluded during the calculation.
- Fig. 5 is a flow chart showing the path calculation method of the embodiment 3 of the present invention.
- Fig. 6 is a view showing a specific format of an OTN transmission traffic standard according to Embodiment 3 of the present invention.
- the path calculation method in Embodiment 3 of the present invention includes:
- S501 Receive a path calculation request message, where the path calculation request message carries a network type Identifying and requesting the calculated traffic parameter constraint of the path; the network type identifier indicates that the network where the path to be calculated is located is an OTN network, and the foregoing traffic parameter constraints include a signal type, a cascading type, and a cascading quantity;
- the PCC sends a path calculation request message to the PCE, which can carry the network type identifier and the flow parameter constraint of the path calculated by the request by using the OTN SENDER_TSPEC (OTN Transmit Traffic Standard) object in the path calculation request.
- OTN SENDER_TSPEC OTN Transmit Traffic Standard
- the OTN SENDER - TSPEC can use the format of Figure 6. Class-Num, C-Type, Signal Type, and Multiplier are mandatory. At least one field is required in the NCC and NVC fields.
- Length length, used to indicate the length of the OTN SENDER_ TSPEC field
- Class-Num and C-Type These two fields are used together to represent the network type identifier of the OTN network.
- Class-Num represents a large class with a value of 12
- C-Type represents a small class with a value of 5.
- the network type identifier of the large class 12 and the small class 5 is used to represent the OTN network.
- Signal Type used to indicate the signal type, that is, the basic unit of the signal on the path, for example, ODU1 or ODU2;
- NMC Number of Multiplexed Components: The number of basic units of a signal included in a multiplexing cascade when the cascading type used for multiplexing is multiplexed.
- the basic unit of the signal is ODU1.
- the NMC takes a value of 4; when the field does not exist or the value is 0, it indicates that the multiplex cascade cannot be supported;
- NVC Number of Virtual Components
- Multiplier used to indicate the number of concatenations. This value is a natural number. When the virtual concatenation and multiplexing concatenation are not used, for example, if the NMC field and the NVC field do not exist, the value indicates the signal used. The number of basic units; when multiplexing cascade is used instead of virtual concatenation, for example, if the NMC field exists and is not 0, and the NVC field does not exist, the value indicates the reused cascade used.
- the number of virtual concatenations used when the virtual concatenation is used instead of the multiplexing concatenation for example, if the NVC field exists and is not 0, and the NMC field does not exist;
- the value indicates the number of virtual concatenations used;
- the PCE calculates the path by using an algorithm according to the traffic parameter constraint including the above signal type, the cascading type, and the number of cascading, excluding the link that does not satisfy the traffic parameter constraint. For example, when the value of the Multiplier is 2, the value of the Signal Type field is ODU1, and the value of the NVC field is 4, it means that when calculating the path, it is necessary to exclude the link of the continuous cascading of the two ODU1 x4 bandwidths.
- Fig. 7 is a flow chart showing the path calculation method of the embodiment 4 of the present invention.
- Figure 8 is a detailed format diagram of the Ethernet transmission traffic standard of Embodiment 4 of the present invention.
- Figure 9 is a diagram showing the type length value of the Ethernet transmission traffic standard of Embodiment 4 of the present invention.
- the path calculation method in Embodiment 4 of the present invention includes:
- S701 Receive a path calculation request message, where the path calculation request message carries a network type identifier and a traffic parameter constraint condition of the path that is requested to be calculated; the network type identifier indicates that the path where the path to be calculated is located is an Ethernet network, and the foregoing traffic parameter constraint condition Including the switching granularity, the MTU; specifically, the PCC sends a path calculation request message to the PCE, which can carry the network type identifier by using the ETH SENDER_TSPEC (Ethernet Send Traffic Standard) object in the path calculation request The traffic parameter constraint of the path requesting the calculation.
- the above traffic parameter constraints may include constraints such as a committed information rate, a committed burst rate, an additional information rate, an additional burst rate, and a link color, in addition to the switching granularity and MTU.
- the ETH SENDER- TSPEC can use the format of Figure 8.
- the TLV (Type-Length-Vaule, type length value) contained in the ETH SENDER- TSPEC is shown in Figure 9. The meanings of the fields are as follows:
- Length length, used to indicate the length of the ETH SENDER_ TSPEC field
- Class-Num and C-Type These two fields are used together to represent the network type identifier of the Ethernet network.
- Class-Num represents a large class with a value of 12
- C-Type represents a small class with a value of 6.
- the network type identifier of the large class 12 and the small class 6 is used to represent the Ethernet network.
- Switching Granularity Indicates the minimum unit of service transmission on the link. A value of 1 indicates that the port on the link is the smallest unit of service transmission. A value of 2 indicates that the Ethernet frame is the best for service transmission. Unit, for example, a VLAN (Virtual Local Area Network) frame as the minimum unit of service transmission;
- VLAN Virtual Local Area Network
- MTU Maximum Transmission Unit: Indicates the maximum number of bytes per packet transmitted in the network
- the link function attribute field for example, when the value is 2, can be used to indicate the requirements for the link color attribute;
- CIR Committed Information Rate
- CBS (Committed Burst Size): The maximum information rate in an emergency situation that is promised to support;
- EIR Excess Information Rate
- EBS Excess Burst Size: The extra maximum that can be supported in an emergency. Large information rate.
- the path calculation unit excludes the link that does not satisfy the flow parameter constraint condition according to the above-mentioned flow parameter constraint condition including the switching granularity and the MTU, and calculates the path by using an algorithm.
- the traffic parameter constraint is as follows: When the value of the Switching Granularity field is 1, it indicates that the link needs to support the port of the node on the link as the minimum unit of service transmission. When the MTU field is 1500 bits, it indicates the link. The maximum transmission unit is 1500 bits. When the value of the Profile field is 2, the link must support the color attribute. When the value of the CIR field is 10 Mbit/s, the information rate of the normal support is not allowed to exceed 10 Mbit. /s.
- S703 Send a path calculation response message, where the path calculation response message carries the calculated path.
- the PCE sends a path calculation response message to the PCC, and the path calculation response message carries the calculated path.
- Example 5 Send a path calculation response message, where the path calculation response message carries the calculated path.
- the PCE sends a path calculation response message to the PCC, and the path calculation response message carries the calculated path.
- Figure 10 is a block diagram showing the structure of a path calculation unit of Embodiment 5 of the present invention.
- the path calculation unit of Embodiment 5 of the present invention includes: a request receiving module 1001, configured to receive a path calculation request message, where the path calculation request message carries a network type identifier and a traffic parameter of a path to be calculated.
- the network type identifier indicates the type of the network in which the path to be calculated is requested;
- the calculation module 1002 is configured to determine the network by using the network type identifier, and calculate the path in the network according to the traffic parameter constraint condition;
- the path sending module 1003 The path calculation response message is sent, and the path calculation response message carries the calculated path.
- a path calculation request message is first received from the PCC by the request receiving module 1001 (for example, PCE), where the path calculation request message carries a network type identifier and a flow parameter constraint of the path to be calculated.
- the request receiving module 1001 for example, PCE
- the path calculation request message carries a network type identifier and a flow parameter constraint of the path to be calculated.
- the above network type identifier indicates the type of network in which the path for which the request is requested is located.
- the computing module 1002 determines the network by using the network type identifier, and calculates a path in the network according to the traffic parameter constraint.
- the last path sending module 1003 sends a path calculation response message to the PCC, and the path calculation response message carries the calculated path.
- the method for carrying the network type identifier in the path calculation request message is used, and after the network is determined by the network type identifier, the path is calculated according to the traffic parameter constraint condition in the network, thereby overcoming the difference
- the path calculation request of the domain and the bandwidth of the floating point value cannot clearly define the technical problem of the path traffic parameter constraint, thereby solving the problem of distinguishing and calculating the traffic engineering path of multiple types of services in the multi-domain fusion network.
- Fig. 11 is a block diagram showing the configuration of a node apparatus according to a sixth embodiment of the present invention.
- the node apparatus of the embodiment 6 of the present invention includes: a request sending module 1101, configured to send a path calculation request to the path calculation unit, where the path calculation request message carries the network type identifier and the traffic of the path requested for calculation.
- the network type identifier indicates a type of the network in which the path to be calculated is requested;
- the response receiving module 1102 is configured to receive a path calculation response message of the carried path returned by the path calculation unit, where the path calculation response message carries the calculated a path, wherein the path is determined by the path calculation unit by using the network type identifier, and is calculated and obtained in the network according to the traffic parameter constraint.
- FIG. 12 is a block diagram showing the structure of a network system according to a seventh embodiment of the present invention.
- Embodiment 7 of the present invention further provides a network system, where the system includes a node 1201 and a path calculation unit 1202, where the path calculation unit 1202 is configured to: receive a path calculation request message from the node 1201, and calculate the path.
- the request message carries the network type identifier and the traffic parameter constraint of the path to be calculated; the network type identifier indicates the type of the network where the path to be calculated is located; the network type identifier is used to determine the network, and the traffic parameter constraint is based on the foregoing Calculating a path in the network; sending a path calculation response message to the node 1201, where the path calculation response message carries the calculated path Trail.
- the beneficial effects of the embodiment of the present invention are: because the method of carrying the network type identifier in the path calculation request message is used, and after the network is determined by the network type identifier, the path is calculated according to the traffic parameter constraint condition in the network, thereby overcoming It is impossible to distinguish path calculation requests in different domains, and the bandwidth of floating-point values cannot clearly define the technical problem of path traffic parameter constraints, thereby solving the problem of distinguishing and calculating traffic engineering paths of multiple types of services in a multi-domain fusion network.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
BRPI1014797-7A BRPI1014797B1 (pt) | 2009-04-08 | 2010-04-02 | método de computação de percurso |
ES10761194T ES2426761T3 (es) | 2009-04-08 | 2010-04-02 | Métodos de cálculo de ruta |
EP10761194.9A EP2418802B1 (en) | 2009-04-08 | 2010-04-02 | Path computation methods |
US13/269,240 US9054944B2 (en) | 2009-04-08 | 2011-10-07 | Path computation method, path computation element, node device, and network system |
US14/732,198 US9825845B2 (en) | 2009-04-08 | 2015-06-05 | Path computation method, path computation element, node device, and network system |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN200910133506.9 | 2009-04-08 | ||
CN2009101335069A CN101860473B (zh) | 2009-04-08 | 2009-04-08 | 一种路径计算方法 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/269,240 Continuation US9054944B2 (en) | 2009-04-08 | 2011-10-07 | Path computation method, path computation element, node device, and network system |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2010115365A1 true WO2010115365A1 (zh) | 2010-10-14 |
Family
ID=42935644
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2010/071518 WO2010115365A1 (zh) | 2009-04-08 | 2010-04-02 | 一种路径计算方法、路径计算单元、节点设备和网络*** |
Country Status (6)
Country | Link |
---|---|
US (2) | US9054944B2 (zh) |
EP (1) | EP2418802B1 (zh) |
CN (1) | CN101860473B (zh) |
BR (1) | BRPI1014797B1 (zh) |
ES (1) | ES2426761T3 (zh) |
WO (1) | WO2010115365A1 (zh) |
Families Citing this family (33)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101860473B (zh) * | 2009-04-08 | 2012-11-07 | 华为技术有限公司 | 一种路径计算方法 |
CN102347893B (zh) * | 2010-07-30 | 2016-05-11 | 中兴通讯股份有限公司 | 一种多层网络及lsp的建立方法 |
CN103067271B (zh) * | 2011-10-19 | 2018-02-27 | 中兴通讯股份有限公司 | 双向路径的实现方法及装置 |
CN103260094B (zh) * | 2012-02-20 | 2018-09-04 | 中兴通讯股份有限公司 | 一种路由方法、路由策略的通知方法及相应的装置 |
CN102687473B (zh) * | 2012-02-22 | 2015-08-19 | 华为技术有限公司 | 端到端标签交换路径的建立方法和*** |
CN103379030B (zh) * | 2012-04-26 | 2018-07-03 | 华为技术有限公司 | 一种路由相关的节能方法、网络设备和*** |
US10411997B1 (en) | 2012-12-27 | 2019-09-10 | Sitting Man, Llc | Routing methods, systems, and computer program products for using a region scoped node identifier |
US10419334B1 (en) | 2012-12-27 | 2019-09-17 | Sitting Man, Llc | Internet protocol routing methods, systems, and computer program products |
US10476787B1 (en) | 2012-12-27 | 2019-11-12 | Sitting Man, Llc | Routing methods, systems, and computer program products |
US10904144B2 (en) | 2012-12-27 | 2021-01-26 | Sitting Man, Llc | Methods, systems, and computer program products for associating a name with a network path |
US10447575B1 (en) | 2012-12-27 | 2019-10-15 | Sitting Man, Llc | Routing methods, systems, and computer program products |
US10397101B1 (en) | 2012-12-27 | 2019-08-27 | Sitting Man, Llc | Routing methods, systems, and computer program products for mapping identifiers |
US10411998B1 (en) | 2012-12-27 | 2019-09-10 | Sitting Man, Llc | Node scope-specific outside-scope identifier-equipped routing methods, systems, and computer program products |
US10404583B1 (en) | 2012-12-27 | 2019-09-03 | Sitting Man, Llc | Routing methods, systems, and computer program products using multiple outside-scope identifiers |
US10419335B1 (en) | 2012-12-27 | 2019-09-17 | Sitting Man, Llc | Region scope-specific outside-scope indentifier-equipped routing methods, systems, and computer program products |
US10587505B1 (en) | 2012-12-27 | 2020-03-10 | Sitting Man, Llc | Routing methods, systems, and computer program products |
US10212076B1 (en) | 2012-12-27 | 2019-02-19 | Sitting Man, Llc | Routing methods, systems, and computer program products for mapping a node-scope specific identifier |
US10397100B1 (en) | 2012-12-27 | 2019-08-27 | Sitting Man, Llc | Routing methods, systems, and computer program products using a region scoped outside-scope identifier |
US10374938B1 (en) | 2012-12-27 | 2019-08-06 | Sitting Man, Llc | Routing methods, systems, and computer program products |
US10404582B1 (en) | 2012-12-27 | 2019-09-03 | Sitting Man, Llc | Routing methods, systems, and computer program products using an outside-scope indentifier |
WO2014176729A1 (zh) * | 2013-04-28 | 2014-11-06 | 华为技术有限公司 | 传送网控制方法、控制器和节点 |
WO2015026809A1 (en) * | 2013-08-19 | 2015-02-26 | Centurylink Intellectual Property Llc | Network management layer - configuration management |
US9882804B2 (en) | 2013-09-26 | 2018-01-30 | Cisco Technology, Inc. | Co-existence of a distributed routing protocol and centralized path computation for deterministic wireless networks |
US10165093B2 (en) * | 2015-08-31 | 2018-12-25 | Cisco Technology, Inc. | Generating segment routing conduit in service provider network for routing packets |
CN108965132B (zh) * | 2017-05-22 | 2021-06-22 | 华为技术有限公司 | 一种选择路径的方法及装置 |
US10200121B2 (en) | 2017-06-14 | 2019-02-05 | At&T Intellectual Property I, L.P. | Reachability determination in wavelength division multiplexing network based upon fiber loss measurements |
CN112054958B (zh) * | 2019-06-06 | 2023-07-14 | 中兴通讯股份有限公司 | 路径计算方法及存储介质、电子装置 |
US10841183B1 (en) * | 2019-10-18 | 2020-11-17 | Huawei Technologies Canada Co., Ltd. | Method and system for reliability-aware embedding of a virtual network onto an elastic optical network |
US11304115B2 (en) * | 2020-03-18 | 2022-04-12 | Equinix, Inc. | Network defined edge routing for an application workload |
US11985534B2 (en) | 2020-03-18 | 2024-05-14 | Equinix, Inc. | Application workload routing and interworking for network defined edge routing |
CN114697262A (zh) * | 2020-12-28 | 2022-07-01 | 中兴通讯股份有限公司 | 路径计算方法、算路服务器及通信*** |
CN114697772A (zh) * | 2020-12-31 | 2022-07-01 | 华为技术有限公司 | 一种业务的配置方法及装置 |
CN114827007A (zh) * | 2021-01-18 | 2022-07-29 | ***通信有限公司研究院 | 算力感知的路由方法、装置、路由节点及客户端设备 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060171320A1 (en) * | 2005-02-02 | 2006-08-03 | Jean-Philippe Vasseur | Inter-domain path computation technique |
CN101296178A (zh) * | 2007-04-29 | 2008-10-29 | 华为技术有限公司 | 域间流量工程路径计算方法和路径计算装置 |
Family Cites Families (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5570084A (en) * | 1994-06-28 | 1996-10-29 | Metricom, Inc. | Method of loose source routing over disparate network types in a packet communication network |
FI20001312A (fi) * | 2000-05-31 | 2001-12-01 | Nokia Networks Oy | Telekommunikaatioverkon muodostaminen |
US20030026268A1 (en) * | 2000-11-28 | 2003-02-06 | Siemens Technology-To-Business Center, Llc | Characteristic routing |
US6934290B2 (en) * | 2002-01-25 | 2005-08-23 | Telcordia Technologies, Inc. | Determining connection information for a network |
US20050071453A1 (en) * | 2003-09-30 | 2005-03-31 | Nortel Networks Limited | Service performance correlation (SPC) and service fault correlation (SFC) for managing services transported over circuit-oriented and connectionless networks |
US20080225723A1 (en) * | 2007-03-16 | 2008-09-18 | Futurewei Technologies, Inc. | Optical Impairment Aware Path Computation Architecture in PCE Based Network |
US8578054B2 (en) * | 2008-03-07 | 2013-11-05 | Cisco Technology, Inc. | Computing disjoint paths for reactive routing mesh networks |
US7725603B1 (en) * | 2008-04-30 | 2010-05-25 | Network Appliance, Inc. | Automatic network cluster path management |
CN101860473B (zh) * | 2009-04-08 | 2012-11-07 | 华为技术有限公司 | 一种路径计算方法 |
-
2009
- 2009-04-08 CN CN2009101335069A patent/CN101860473B/zh active Active
-
2010
- 2010-04-02 EP EP10761194.9A patent/EP2418802B1/en active Active
- 2010-04-02 WO PCT/CN2010/071518 patent/WO2010115365A1/zh active Application Filing
- 2010-04-02 ES ES10761194T patent/ES2426761T3/es active Active
- 2010-04-02 BR BRPI1014797-7A patent/BRPI1014797B1/pt active IP Right Grant
-
2011
- 2011-10-07 US US13/269,240 patent/US9054944B2/en active Active
-
2015
- 2015-06-05 US US14/732,198 patent/US9825845B2/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060171320A1 (en) * | 2005-02-02 | 2006-08-03 | Jean-Philippe Vasseur | Inter-domain path computation technique |
CN101296178A (zh) * | 2007-04-29 | 2008-10-29 | 华为技术有限公司 | 域间流量工程路径计算方法和路径计算装置 |
Non-Patent Citations (1)
Title |
---|
See also references of EP2418802A4 * |
Also Published As
Publication number | Publication date |
---|---|
US20120026886A1 (en) | 2012-02-02 |
US20150271055A1 (en) | 2015-09-24 |
US9054944B2 (en) | 2015-06-09 |
CN101860473B (zh) | 2012-11-07 |
CN101860473A (zh) | 2010-10-13 |
EP2418802A4 (en) | 2012-02-15 |
EP2418802B1 (en) | 2013-06-26 |
BRPI1014797B1 (pt) | 2020-12-01 |
ES2426761T3 (es) | 2013-10-25 |
EP2418802A1 (en) | 2012-02-15 |
BRPI1014797A2 (pt) | 2016-04-05 |
US9825845B2 (en) | 2017-11-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2010115365A1 (zh) | 一种路径计算方法、路径计算单元、节点设备和网络*** | |
EP2624506A1 (en) | Route control method and system, and route computing apparatus | |
US10250459B2 (en) | Bandwidth on-demand services in multiple layer networks | |
WO2017156987A1 (zh) | 一种灵活以太网路径建立的方法和装置 | |
CN107438028B (zh) | 一种客户业务处理的方法和设备 | |
US9143433B2 (en) | Energy efficient and energy-managed traffic engineering services in multiprotocol label switching and generalized multiprotocol label switching networks | |
CN104718732B (zh) | 用于为在通信网络的两个节点之间建立路径而交换信息的方法 | |
WO2007085173A1 (fr) | Procédé de traitement d'une ressource de réseau et unité de réseau d'un réseau optique intelligent associé | |
EP4207633A1 (en) | Service protection method and network node | |
WO2013082773A1 (zh) | 一种在光传送网中实现业务传送的方法及实现该方法的设备和*** | |
CN106803811A (zh) | 一种路由信息的获取方法及装置 | |
Zhang et al. | Framework for GMPLS and PCE Control of G. 709 Optical Transport Networks | |
US9722857B2 (en) | Node marking for control plane operation | |
WO2015024440A1 (zh) | 一种获取ip链路的链路开销值的方法及*** | |
WO2008148315A1 (fr) | Procédé et système servant à établir un chemin de service, et dispositif de nœud | |
US9264212B2 (en) | Method for distributing time within synchronous ethernet and SONET/SDH domains | |
CN102202247B (zh) | 一种基于g.709的多级复用的信令控制方法和*** | |
WO2012003740A1 (zh) | 一种光网络中的路径计算方法及路径计算单元 | |
Ceccarelli et al. | Traffic Engineering Extensions to OSPF for GMPLS Control of Evolving G. 709 Optical Transport Networks | |
JP5027776B2 (ja) | 通信ノード装置及び通信システム及び通信路制御プログラム | |
WO2011116596A1 (zh) | 一种基于g.709的复用路由计算方法和路径计算装置 | |
KR20160106919A (ko) | 네트워크 경로 계산 및 설정 방법 및 장치 | |
Gao et al. | Bod service with VCAT/LCAS and GMPLS signalling | |
CN103004148A (zh) | 用于建立多层路径的方法及其装置和*** | |
Zhang et al. | RFC 7138: Traffic Engineering Extensions to OSPF for GMPLS Control of Evolving G. 709 Optical Transport Networks |
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: 10761194 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 4060/KOLNP/2011 Country of ref document: IN |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2010761194 Country of ref document: EP |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: PI1014797 Country of ref document: BR |
|
ENP | Entry into the national phase |
Ref document number: PI1014797 Country of ref document: BR Kind code of ref document: A2 Effective date: 20111010 |