WO2007079667A1 - Procédé de calcul des moyens de prévision d'écoulement du trafic entre des zones, système, équipement et support de stockage - Google Patents

Procédé de calcul des moyens de prévision d'écoulement du trafic entre des zones, système, équipement et support de stockage Download PDF

Info

Publication number
WO2007079667A1
WO2007079667A1 PCT/CN2007/000027 CN2007000027W WO2007079667A1 WO 2007079667 A1 WO2007079667 A1 WO 2007079667A1 CN 2007000027 W CN2007000027 W CN 2007000027W WO 2007079667 A1 WO2007079667 A1 WO 2007079667A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
path calculation
request
traffic engineering
calculation
Prior art date
Application number
PCT/CN2007/000027
Other languages
English (en)
Chinese (zh)
Inventor
Renhai Zhang
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 WO2007079667A1 publication Critical patent/WO2007079667A1/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/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical 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/44—Distributed routing

Definitions

  • the present invention relates to the field of network communication technologies, and relates to an inter-area traffic engineering network-wide calculation method, system, device, and storage medium using a path calculation unit.
  • Traffic Engineering focuses on the optimization of overall network performance. Its main goal is to easily provide efficient and reliable network services, optimize the use of network resources, and optimize network traffic. It can be divided into two levels: First, it is oriented to traffic, that is, how to improve the service volume of the network; Second, it is resource-oriented, that is, how to optimize the use of network resources, the most important is the effective use of bandwidth resources.
  • GMPLS General Multiple Protocol Label Switch
  • CSPF Constraint-based Shortest Path First
  • MPLS Multi-Protocol Label Switch
  • PCE Path Computation Element
  • LSP Label Switched Path
  • the path computation client (PCC, Path Computation Client) sends a request to the path calculation unit PCE, where the request information includes the destination of the path and various constraints.
  • Basic information the path calculation unit PCE is based on a topology, traffic engineering database (TED, Traffic) that is synchronized with the network. Engineering Database) and other information, calculate a path that satisfies the constraints in the request; return the calculation result to the computing client PCC through the response message as an explicit path object (ERO, Explicit Route Object) for establishing the label switching path parameter.
  • the calculation result may include an accurate node (a router) and a loose node (a network segment, an area, and an autonomous system).
  • the path calculation unit PCE is not limited to a specific implementation, and may be implemented by using a router, or by using a specified server or other methods.
  • the calculation range of a path calculation unit PCE is generally an autonomous system, when the destination of the calculation request is another In the case of an autonomous system, the path calculation unit PCE collaboration between different autonomous systems is required to complete the calculation of one path.
  • Path calculation unit The PCE model is also suitable for traffic engineering between regions.
  • the path calculation unit PCE of different areas cooperates to complete the calculation of an end-to-end TE path.
  • the path calculation unit PCE in each area is only responsible for the calculation of the path in the area, and the calculation path is completed.
  • the calculation unit PCE sends the calculation task to the path calculation unit PCE in the downstream area, from which the calculation of the next path is performed.
  • the result is returned to the upstream path calculation unit PCE.
  • the upstream path calculation unit PCE completes the splicing of the path and repeats the previous process until it returns to the area where the path source address is located.
  • the path calculation unit PCE obtains a complete inter-area traffic engineering TE path, and returns the calculation result to the requesting calculation client PCC through PCECP (PCE Communication Protocol).
  • the inter-area TE path based on the original resources may not be optimal. For example, some services may use multiple LSPs with smaller bandwidth due to network resource restrictions. Stitched, requires a re-optimization process based on the existing network The network resource status is recalculated and some traffic engineering TE paths are established. In the process of re-optimization, the utilization of network resources is not high enough because there is only one alternative path.
  • the operator wants to plan the traffic engineering TE path used by some services.
  • the TE path may be inconsistent with the result calculated by the path calculation unit PCE.
  • the calculation result can only be limited by manual configuration, which is cumbersome.
  • the existing PCE model-based constrained path calculation method cannot query the current available resources of the network and the available bandwidth on each path, which makes the lack of evidence for network resource status analysis.
  • the invention provides an inter-area traffic engineering whole network computing method, system, device and storage medium, which can flexibly utilize network resources, reasonably allocate network resources, and improve utilization of network resources.
  • an inter-area traffic engineering path network-wide calculation method includes:
  • the path computation client sends a parallel traffic engineering path calculation request to multiple path computation units in its area;
  • the path calculation unit that receives the traffic engineering path calculation request calculates the path and forwards the calculation result step by step according to the network resource status information maintained by it; until the available path is returned to the path calculation client.
  • a path calculation client includes:
  • a parallel request sending module configured to send a parallel request containing a global unified identifier to a path computation unit of a region in which it is located;
  • a calculation result receiving module configured to receive a flow engineering path calculation result returned by the path calculation unit.
  • a path calculation unit includes:
  • a parallel request receiving module configured to receive a parallel request including a global unified identifier
  • a parallel request forwarding module configured to forward the parallel request with a global unified identifier Giving one or more downstream path calculation units
  • a path calculation module configured to calculate a traffic engineering path between two network nodes according to a locally maintained traffic engineering database
  • an inter-area traffic engineering network-wide computing system includes a path calculation client and a path calculation unit connected through a network; the path calculation client is configured to: path to the same area
  • the calculation unit sends a calculation request of the traffic engineering path to the area where the destination is located; the calculation request is a parallel request including a global unified identifier; receiving a calculation result for the parallel request from the path calculation unit; After: forwarding the traffic engineering path calculation request step by step until reaching a path calculation unit in the area where the destination is located; calculating the path and forwarding the calculation result step by step according to the network resource status information maintained by the network, until returning to the path calculation client Available path.
  • a readable storage medium having a program recorded thereon, the program enabling the path computation client to perform the following steps:
  • the calculation request is a parallel request including a global unified identifier; receiving a calculation result for the parallel request from the path calculation unit .
  • a readable storage medium having recorded thereon, the program enables the path calculation unit to perform the following steps:
  • the calculation result obtained by the embodiment of the present invention can allocate resources reasonably and flexibly for various services, avoid excessive occupation of resources in some areas, and some resources may be idle, and improve network resources. Utilization. By selecting multiple paths, the operator can more flexibly and conveniently plan the traffic engineering TE path used by some services.
  • FIG. 1 is a flow chart of an embodiment of an inter-area traffic engineering path method according to the present invention
  • FIG. 2 is a network topology diagram of an embodiment of a system including a path calculation unit according to the present invention
  • FIG. 4 is a structural block diagram of an embodiment of a path computation client according to the present invention.
  • FIG. 5 is a structural block diagram of a path calculation unit according to the present invention.
  • the path calculation unit PCE may be an Area Board Router (ABR) that calculates a network path based on a constraint condition and a traffic engineering database, or calculates a network path based on a constraint and a traffic engineering database.
  • ABR Area Board Router
  • the server can also be other entities that compute network paths based on constraints and traffic engineering databases.
  • an embodiment of the inter-area traffic engineering path calculation method of the present invention includes: Step S110: A PCC sends a parallel path calculation request to multiple PCEs in its area.
  • the parallel request includes a globally uniform identifier.
  • step S120 the parallel request is forwarded to the PCE of the other area until reaching the PCE of the area where the destination is located.
  • the forwarding may be performed step by step.
  • various constraints may be used to perform constraints according to needs and actual situations.
  • Step SBO PCE each performs path calculation according to the network resource status information maintained by it, and returns an available path to the PCC.
  • the above is based on the condition that the resources on each path satisfy the limitation in the calculation request, and the calculation is successful. If sufficient resources cannot be obtained in a certain calculation process, the calculation fails.
  • the calculation failure information is returned by the PCE step by step.
  • the function of the PCE is implemented by using an area border router ABR that calculates a network path based on a constraint condition and a traffic engineering database. That is, in the area border router ABR, the traffic engineering database protected by the defender is used to run the shortest path calculation based on the constraint, thereby realizing the function of calculating the network path.
  • TE-enabled nodes in the network transmit TE-related information through the TE extension of the IGP.
  • OSPF Open Shortest Path First
  • Areas 100, 101, 102 and 103 there are four areas Areas 100, 101, 102 and 103, and the ABRs 110, 120, 130, 140, 150 in each area have PCE functions.
  • the path calculation client PCC 200 when the path calculation client PCC 200 generates a calculation request for the traffic engineering path of the destination node (for example, the router Router) 300 in the Area 103 by a certain trigger condition, the calculation request includes the global Uniform identification of parallel requests.
  • the global unified identifier can be identified in the following ways when it is implemented:
  • the global unified identifier may be 1.1.1.1:00001; the global unified identifier for generating the calculation request for the second time is 1.1.1.1:00002 .
  • the number of calculations exceeds a certain range, for example, 99999, the value overflows and restarts from 00001. Since the router id of each router is unique across the network, and each router generates computational requests, there is little chance of duplicate identification.
  • the PCC 200 learns through the PCE discovery protocol two path computation units present in the Area 101: ABR 110, ABR 120, to which the above parallel request containing the global unified identity is sent.
  • the parallel request is transmitted to multiple ABRs in the area closer to the destination node, and so on, and each ABR is The plurality of ABRs that are closer to the destination node are forwarded to the parallel request until the multiple ABRs in the area where the destination node is located receive the parallel request.
  • embodiments of the present invention may constrain the delivery of such computational requests in combination or separately in the following ways:
  • the calculation request is not passed to the PCE away from the area where the destination node is located. 2) In a certain area, when a PCE responsible for the calculation of the area receives a calculation request from the PCE of the area, the calculation request is no longer transmitted to other PCEs in the area.
  • the specific situation is as shown in FIG. 2.
  • the ABR 110 receives the calculation request and according to the requested content and the locally maintained traffic engineering database information. It is known that the destination node 300 is not in the Area 101 and the Area 100 responsible for the calculation, and the other path calculation units existing in the Area 100 are known by the PCE discovery protocol: ABR 140, ABR 130.
  • the request is then sent to ABR 140 and ABR 130, and similarly, ABR 120 sends the request to ABR 130, AB 150.
  • the ABR 130 After receiving the calculation request sent by the ABR 120, the ABR 130 finds that the destination node 300 is not in the area in which the ABR 130 is responsible for the calculation, but learns that the ABR 140 and the ABR 150 can reach the destination node 300, and the ABR 120 is far away from the destination node 300.
  • the area therefore, according to the constraint of the above transfer mode 1), the ABR 130 does not send the calculation request to the ABR 110, and according to the constraint of the transfer mode 2), the ABR 130 does not send the calculation request to the ABR 150, but only sends Give ABR 140.
  • the ABR 130 After receiving the calculation request sent by the ABR 110, the ABR 130 finds that the destination node 300 is not in the area in which the ABR 130 is responsible for the calculation, but learns that the destination node 300 can be reached through the ABR 140 and the ABR 150, and therefore, according to the above transmission With the constraints of modes 1) and 2), the ABR 130 only sends the calculation request to the ABR 150 without sending it to the ABR 120 and the ABR 140.
  • the parallel request is transmitted to the PCE of the area where the destination node 300 is located according to the following four paths: PCC 200-ABR 110-ABR 140, PCC 200-ABR 120-ABR 150, PCC 200-ABR 120-ABR 130-ABR 140 , PCC 200-ABR 110-ABR 130-ABR 150.
  • the ABR 140 is an area border router that connects the area where the destination node 300 is located. After receiving the calculation request sent by the ABR 110, the ABR 140 can calculate the network content according to the content of the request and the locally maintained traffic data. Out of the ABR 140 to the destination node 300 The TE path is returned to the ABR 110 that sent the request, respectively. However, when the ABR 140 receives the calculation request with the same global unified identifier sent by the ABR 130, the ABR 140 does not calculate the TE path to the destination node 300, but reuses the previous calculation result and the obtained resource, and returns to the calculation. The result is given to ABR 130. Without additional bandwidth resources.
  • the ABR 150 is also an area border router that connects the area where the destination node 300 is located.
  • the ABR 150 can obtain the traffic engineering database information according to the request content and the local maintenance when the network resource satisfies the condition.
  • the TE path of the ABR 150 to the destination node is calculated, and the calculation result is returned to the ABR 120 that sent the request, respectively.
  • the ABR 150 receives the calculation request with the same global unified identifier sent by the ABR 130, the ABR 150 does not calculate the TE path to the destination node 300, but reuses the previous calculation result and the obtained resource, and returns.
  • the result is calculated for the ABR 130. Without additional bandwidth resources.
  • the ABR 110 and ABR 120 will be based on the calculation results returned by the ABR 140 and the ABR 150, respectively, as well as the TED of the locally maintained Bone Thousand Area (Area 100 in Figure 1) and the respective non-backbone areas (Area in Figure 1) 101.
  • the TED of Area l02, ) in FIG. 1 respectively calculates and splices the TE path from the PCC 200 to the destination node 300.
  • the ABR node is used as the loose path identification mode, and the result is PCC 200-ABR 110-ABR 140-destination node 300, PCC 200-ABR 120-ABR 150-destination node 300, respectively.
  • the ABR 130 returns its calculation result to the ABR 120, and the ABR 120 completes the TE path calculation and splicing from the PCC 200 to the destination node 300 again.
  • the previous calculation result and the obtained resource without additionally occupying the bandwidth resource, finally obtain the calculation result PCC 200-ABR 120-ABR 130-ABR 140-destination node 300.
  • the ABR 130 returns its calculation result to the ABR 110, and the ABR 110 completes the TE path calculation and splicing from the PCC 200 to the destination node 300 again.
  • the specific case can also be reused.
  • the calculation result and the obtained resource are not used again, and the calculation result PCC 200-ABR 110-ABR 130-ABR 150-destination node 300 is finally obtained.
  • the PCC 200 calculation request may only return two TE paths, namely, PCC 200-ABR 110-ABR 140-destination node 300, PCC 200-ABR 120-ABR 150-destination node 300. .
  • the above embodiment is described by taking OSPF as an example.
  • the embodiment of the present invention can also adopt the TE extension of the ISIS (Intermediate System to Intermediate System).
  • the inter-area traffic engineering whole network calculation method described in the embodiment of the present invention can also query the current available resources of the network.
  • the bandwidth is not limited by the calculation, but the query information is carried in the calculation request, and the available bandwidth in various paths can be returned in the calculation result as an analysis of the network resource status. Basis.
  • the query can be triggered by a command on a PCC.
  • the destination address can be selected as a zone ID or a network node.
  • the network resource query can be triggered by the configuration command. Specifically, the query is initiated by triggering a parallel request containing a global unified identity, which is sent from the PCC 200 to the ABR 110 and the ABR 120, since the path to the destination node 300 cannot be done independently by the ABR 110 and the ABR 120.
  • the ABR 110 sends a calculation request to the ABR 130, the ABR 140, and the ARB 120 sends a calculation request to the ABR 140, the ABR 150.
  • the calculation request does not contain constraints on the calculation path, but rather contains request information that returns the remaining available bandwidth on the available path.
  • the ABR 140 when calculating the path from the local destination node 300, simultaneously obtains the maximum available bandwidth on the path, and returns to the ABR 110 as a result of the calculation.
  • ABR 110 calculates the full path from PCC 200 to destination node 300, the smallest value will be selected from the maximum bandwidth on each path as the maximum available bandwidth on the path from PCC 200 to the destination node.
  • Another alternative return method is to return the maximum available bandwidth of each path.
  • a network-wide computing system includes a path connected through a network.
  • the client 3 10 and the path calculation units 321, 322, 331, 332 are calculated.
  • the path calculation unit 321, 322 with a path computation client 310 in the same region the path calculation unit 331, calculation unit 332 and path 321 in the same region, the path calculation unit 331, calculation unit 332 and path 322 in the same region.
  • the path calculation client 310 is configured to: generate a calculation request for the traffic engineering path to the destination node 400 according to a trigger condition, where the calculation request is a parallel request including a global unified identifier; The above parallel request containing the global unified identifier is transmitted to the path calculating units 321, 322 located in the same area thereof; the calculation result for the parallel request from the path calculating unit 321, 322 is received.
  • the path calculation unit 321 , 322 in the area where the path calculation client 310 is located is configured to: pass the parallel request to the plurality of path calculation units 331 , 332 that are closer to the downstream area of the destination node; and receive the from the path calculation units 321 , 322 And calculating, according to the calculation result of the parallel request, the traffic engineering path from the path calculation client 310 to the destination node according to the calculation result and the network resource state information maintained by the calculation result, and returning the traffic engineering path calculation result to the path calculation client 310.
  • the path calculation unit 331 and 332 of the area where the destination node 400 is located is configured to: when the network resource meets the condition, calculate the traffic engineering path to the destination node 300 according to the requested content and the locally maintained traffic engineering database information, and calculate The results are returned to the path calculation units 321 and 322 that sent the request, respectively.
  • embodiments of the present invention may constrain the delivery of such computational requests in combination or separately in the following ways:
  • the PCE returns the failure whitening step by step.
  • FIG. 4 is a block diagram of an embodiment of the path calculation client shown in FIG.
  • the path calculation client 310 of this embodiment includes a parallel request sending module 311, configured to send a parallel request including a global unified identifier to the path calculating unit, and a calculation result receiving module 312, configured to receive the traffic engineering returned by the path calculating unit Path calculation result.
  • FIG. 5 is a block diagram of an embodiment of the path calculation unit shown in FIG.
  • the path calculation unit of the embodiment includes a parallel request receiving module 510, configured to receive the parallel request with a global unified identifier from an upstream node, and a parallel request forwarding module 520, configured to forward the parallel request with the global unified identifier to a path calculation unit 530 in the same area; a path calculation module 530, configured to calculate a traffic engineering path between the target node according to the locally maintained traffic engineering database; and a calculation result sending module 540, configured to return the traffic engineering path calculation result to
  • the upstream node, the upstream node may be a path computation unit or a path computation client that is in the same area as the upstream node.
  • the upstream node When a path computation unit is in the forwarding parallel request state, its parallel request receiving module 510 sends the received parallel request information to the parallel request forwarding module 520 and is forwarded by the parallel request forwarding module 520 to the other path computation unit. After receiving the calculation result from the other path calculation unit, the traffic engineering path between the destination node is further calculated according to the calculation result and the locally maintained traffic engineering database; and the calculation result is sent to the calculation result sending module 540. Returned to the upstream node, the upstream node may be a path computation unit or a path computation client that is in the same region as it.
  • the parallel request receiving module 510 sends the received parallel request information to the path calculation module 530, and the path calculation module 530 calculates the destination according to the locally maintained traffic engineering database.
  • the traffic engineering path of the area that is, the inbound node to the destination node of the destination area
  • the calculation result is sent to the other path calculation unit or the path calculation client through the calculation result sending module 540.
  • the path calculation unit of the embodiment of the present invention may further implement the foregoing constraint by using some additional modules on the basis of the method shown in FIG. 5.
  • the path calculation unit may further include: for the manner of limiting the number of times of delivery by the PCE in the calculation request, the path calculation unit may further include:
  • a failure message sending module configured to return a calculation failure message to the upstream node
  • the forwarding number statistics unit is configured to notify the failure message sending module when the number of times of statistics forwarding exceeds a set number of times.
  • the path calculation unit It can also include:
  • an upstream node analyzing unit configured to analyze an area where the upstream node is co-located with the path computing unit; and notify the parallel request forwarding module not to forward the parallel request to another path calculating unit of the area.
  • the path calculation unit may further include:
  • the downstream node analyzing unit is configured to analyze whether other areas where the path calculating unit is located are far away from the destination, and notify the parallel request forwarding module not to forward the parallel request to other path calculating units far away from the destination.
  • an embodiment of the present invention further provides a readable storage medium recorded with a program, and the program enables the path calculation client to perform the following steps:
  • the calculation request is a parallel request including a global unified identifier; receiving a calculation result for the parallel request from the path calculation unit .
  • another embodiment of the present invention further provides a readable storage medium recorded with a program, which enables the path calculation unit to perform the following steps:
  • the readable storage medium for embodying an embodiment of the present invention may be any medium that can be used to store, store, and transfer a program;
  • the client or path computation unit performs or executes in conjunction with its hardware.
  • the storage shield may be, but not limited to, an optical, electrical, magnetic, electromagnetic, infrared or semiconductor storage medium.
  • the network-wide computing system of the inter-area traffic engineering of the present invention can be effectively implemented by using the network-wide computing system according to the embodiment of the present invention, and the network resources are more flexibly and reasonably utilized. Specifically, for calculating the path from the client to the destination from a certain path, since the calculation request is sent in parallel, various calculation results are obtained to the greatest extent, and are provided to the path calculation client that initiates the calculation request, and the path calculation is performed. The client can select one of the paths according to the local policy and flexibly utilize the network resources.
  • the calculation result obtained by the embodiment of the present invention can allocate resources reasonably and flexibly for various services, avoid excessive occupation of resources in some areas, and some resources may be idle, and improve network resources. Utilization.
  • the status of the currently available resources of the network can also be queried by using the embodiment of the present invention.
  • the available bandwidth on various paths can be returned in the calculation result as the basis for analyzing the network resource status.

Landscapes

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

Abstract

L'invention concerne un procédé de calcul des moyens de prévision d'écoulement du trafic entre des zones, un système, un équipement et un support de stockage dans le domaine technique des communications réseau. Selon l'invention et dans le but d'améliorer l'utilisation des ressources réseau et la disponibilité des ressources réseau, le client envoie la demande de calcul de trajectoire concernant la prévision des moyens d'écoulement du trafic parallèle aux éléments de calcul multitrajectoire dans la même zone (S110). La demande de calcul de trajectoire est transmise à l'élément de calcul de trajectoire dans l'autre zone (S120). L'élément de calcul de trajectoire ayant reçu la demande de calcul calcule la trajectoire selon l'information sur l'état des ressources réseau maintenue et renvoie la trajectoire utilisable aux clients (S130)
PCT/CN2007/000027 2006-01-13 2007-01-05 Procédé de calcul des moyens de prévision d'écoulement du trafic entre des zones, système, équipement et support de stockage WO2007079667A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2006100329870A CN101001200B (zh) 2006-01-13 2006-01-13 一种区域间流量工程全网计算方法及系统
CN200610032987.0 2006-01-13

Publications (1)

Publication Number Publication Date
WO2007079667A1 true WO2007079667A1 (fr) 2007-07-19

Family

ID=38255981

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/000027 WO2007079667A1 (fr) 2006-01-13 2007-01-05 Procédé de calcul des moyens de prévision d'écoulement du trafic entre des zones, système, équipement et support de stockage

Country Status (2)

Country Link
CN (1) CN101001200B (fr)
WO (1) WO2007079667A1 (fr)

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101163105B (zh) 2007-11-26 2011-06-01 华为技术有限公司 一种获取路径信息的方法和路径计算节点
CN101621447B (zh) * 2008-06-30 2012-04-04 华为技术有限公司 一种业务路径计算的方法、设备和系统
CN101635673B (zh) * 2008-07-25 2012-01-25 华为技术有限公司 预订路径的方法、系统及路径计算客户、路径计算单元
CN101686197B (zh) * 2008-09-27 2011-12-07 华为技术有限公司 路径信息的获取方法和系统及路径计算装置
CN102065512B (zh) * 2009-11-12 2013-08-07 中兴通讯股份有限公司 多层网络中区域边界控制的方法、建立连接的方法和系统
CN101917343B (zh) * 2010-08-23 2015-06-03 中兴通讯股份有限公司 重优化的触发方法及系统
US8837292B2 (en) * 2010-09-21 2014-09-16 Telefonaktiebolaget L M Ericsson (Publ) Relayed CSPF computation for multiple areas and multiple autonomous systems
CN103370893B (zh) * 2011-02-04 2017-03-08 瑞典爱立信有限公司 配置光路的方法、装置以及光通信网络节点
CN103067271B (zh) * 2011-10-19 2018-02-27 中兴通讯股份有限公司 双向路径的实现方法及装置
CN104038428B (zh) * 2013-03-05 2017-07-14 中兴通讯股份有限公司 路径关键帧相关信息自动更新的方法和系统
CN105515981A (zh) * 2014-10-17 2016-04-20 中兴通讯股份有限公司 算路方法、隧道建立方法、pcc、pce及算路系统
CN105763447B (zh) * 2014-12-16 2020-04-24 中兴通讯股份有限公司 一种标签交换路径状态的获取方法及装置
ES2720277T3 (es) * 2015-07-03 2019-07-19 Huawei Tech Co Ltd Método, dispositivo y sistema para cálculo de ruta en red
CN106549867A (zh) * 2015-09-23 2017-03-29 中兴通讯股份有限公司 异常处理方法及装置
CN106254241B (zh) * 2016-08-23 2019-05-14 烽火通信科技股份有限公司 一种基于igp的跨区域cspf全网计算实现方法
CN108965132B (zh) 2017-05-22 2021-06-22 华为技术有限公司 一种选择路径的方法及装置
CN109150716A (zh) * 2017-06-27 2019-01-04 中兴通讯股份有限公司 拓扑变化响应方法、路径计算客户端及路径计算系统

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005119949A1 (fr) * 2004-05-19 2005-12-15 Cisco Technology, Inc. Amorcage de reoptimisation au moyen d'elements de calcul de trajectoire

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005015938A1 (fr) * 2003-08-01 2005-02-17 Ntt Docomo, Inc. Transfert inter-domaine

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005119949A1 (fr) * 2004-05-19 2005-12-15 Cisco Technology, Inc. Amorcage de reoptimisation au moyen d'elements de calcul de trajectoire

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
AHMAD SUFFIAN MOHAMAD AND SHOICHIRO ASANO: "Deployment Strategies on PCE-based Inter-AS LSP Path Computation", 9TH INTERNATIONAL MULTITOPIC CONFERENCE, IEEE INMIC 2005, December 2005 (2005-12-01), pages 1 - 6, XP003015533 *
TORAB P. ET AL.: "On Cooperative Inter-Domain Path Computation", COMPUTERS AND COMMUNICATIONS, 2006. ISCC '06. PROCEEDINGS. 11TH IEEE SYMPOSIUM, June 2006 (2006-06-01), pages 511 - 518 *

Also Published As

Publication number Publication date
CN101001200A (zh) 2007-07-18
CN101001200B (zh) 2010-12-22

Similar Documents

Publication Publication Date Title
WO2007079667A1 (fr) Procédé de calcul des moyens de prévision d'écoulement du trafic entre des zones, système, équipement et support de stockage
US9819540B1 (en) Software defined network controller
Paolucci et al. A survey on the path computation element (PCE) architecture
CN104426766B (zh) 跨多个网络层的动态端到端网络路径建立
JP3900195B2 (ja) マルチキャスト転送経路設定方法、及びそれを実現するためのマルチキャストラベルスイッチング方法
EP1395003B1 (fr) Procédé de routage selon le plus court chemin à base de contraintes pour des réseaux optiques de transport commutés dynamiquement
EP2747355B1 (fr) Réseau d'agrégation avec commande centralisée
US7808972B2 (en) Method for processing the distributed path information request
US8953500B1 (en) Branch node-initiated point to multi-point label switched path signaling with centralized path computation
WO2007143904A1 (fr) Procédé et système de calcul de routes vers des domaines multiples
WO2006122506A1 (fr) Procede et appareil pour calculer un chemin d'acces dans un domaine de reseau
CN101036134A (zh) 用于域间te－lsp的rsvp－te中的路由信息的传播
CN105634941A (zh) 一种跨域路径的计算方法及装置
US11677659B2 (en) Optimization of segment routing-enabled multipath network
CN110099002B (zh) 一种路径计算方法及装置
Bryskin et al. Policy-enabled path computation framework
US20070140233A1 (en) Resource sharing among network
EP3099010B1 (fr) Procédé, appareil et système de calcul de chemin de réseau
WO2015024440A1 (fr) Procédé et système d'obtention de la valeur de surdébit de liaison d'une liaison ip
WO2008154848A1 (fr) Procédé d'acquisition des informations de capacité d'un nœud de réseau entre des domaines, nœud de réseau et système de communication
US7801048B1 (en) Concurrent path computation using virtual shortest path tree
WO2008000125A1 (fr) Procédé, système et appareil pour découvrir un élément de calcul de chemin
US8798050B1 (en) Re-optimization of loosely routed P2MP-TE sub-trees
JP2004260285A (ja) 通信品質管理システムおよび方法
JP4231074B2 (ja) マルチキャストラベルスイッチング方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 07701959

Country of ref document: EP

Kind code of ref document: A1