WO2006122506A1 - Procede et appareil pour calculer un chemin d'acces dans un domaine de reseau - Google Patents

Procede et appareil pour calculer un chemin d'acces dans un domaine de reseau Download PDF

Info

Publication number
WO2006122506A1
WO2006122506A1 PCT/CN2006/001039 CN2006001039W WO2006122506A1 WO 2006122506 A1 WO2006122506 A1 WO 2006122506A1 CN 2006001039 W CN2006001039 W CN 2006001039W WO 2006122506 A1 WO2006122506 A1 WO 2006122506A1
Authority
WO
WIPO (PCT)
Prior art keywords
path calculation
path
information
request
network
Prior art date
Application number
PCT/CN2006/001039
Other languages
English (en)
French (fr)
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.
Priority to EP06741927A priority Critical patent/EP1883181B1/en
Priority to AT06741927T priority patent/ATE437499T1/de
Priority to DE602006007983T priority patent/DE602006007983D1/de
Priority to US11/914,929 priority patent/US7978622B2/en
Publication of WO2006122506A1 publication Critical patent/WO2006122506A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/42Centralised routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/10Routing in connection-oriented networks, e.g. X.25 or ATM
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/50Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

Definitions

  • the present invention relates to the field of network communication technologies, and in particular, to a method and an apparatus for implementing path calculation in a network domain.
  • Traffic engineering focuses on the optimization of overall network performance, and its main goal is to conveniently provide efficient and reliable network services, optimize the use of network resources, and optimize network traffic. It can be divided into two levels: one is traffic-oriented, that is, how to improve the service quality of the network; the second is resource-oriented, that is, how to optimize the use of network resources, the most important is the effective use of 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 is the effective use of bandwidth resources.
  • GMPLS Generalized Multi Protocol Label Switching
  • Constrained path calculation such as CSPF (Constrained Shortest Path First) calculation
  • MPLS Multi Protocol Label Switching
  • GMPLS Global System for Mobile Communications
  • the path calculation between multiple autonomous systems will be very complicated, and the computing entities of different autonomous systems need to cooperate and work together.
  • the path calculation method based on the PCE (Path Computation Element) model can be applied to the inter-domain traffic engineering.
  • the calculation method does not affect the use of the calculated path, such as the establishment of an LSP (Label Switched Path). , maintenance and removal, only for the calculation of such LSP paths.
  • LSP Label Switched Path
  • a PCC Policy Client
  • a client entity that initiates a path calculation request to the PCE such as an ingress label switching router (ingress label switching router)
  • the PCE After receiving the request, the PCE calculates a path that satisfies the constraint condition in the request according to the topology, TED (Traffic Engineering Database) and other information synchronized with the network, and passes the path through the response message. Returned to the PCC as the ERO (Explicit Router Object) parameter of the PCC.
  • the outgoing path can contain precise nodes (one router) and loose nodes (one network segment, one region, one autonomous system).
  • the calculation range that each PCE is responsible for is usually an autonomous system, and the autonomous system specifically extends the range of TED information by the IGP (Internet Gateway Protocol).
  • IGP Internet Gateway Protocol
  • PCE discovery protocol which is responsible for PCC's discovery of PCE existence and computing power.
  • PCE The communication protocol is mainly responsible for transmitting calculation request and response information between the PCC and the PCE.
  • the PCC sends the calculation request, the PCC includes various constraints.
  • a PCE receives the path calculation request, it is processed locally, and then the corresponding Path calculation processing.
  • the present invention provides a method for implementing path calculation in a network domain, including:
  • the path calculation network entity calculates the path according to the saved global path calculation information.
  • the global path calculation information includes:
  • the client entity when the client entity needs to establish a path, the client entity chooses to determine a path.
  • the network node After receiving the path calculation request, the network node performs path calculation according to the saved global path calculation information.
  • step B specifically includes:
  • the client entity When the client entity needs to establish a path, the client entity selects a path to calculate a network node;
  • the client entity sends a path calculation request message to all path calculation network nodes in the autonomous system, where the message carries the path information of the selected network to calculate the identification information of the network node.
  • B13 After each path calculation network node receives the path calculation request, Recording the received path calculation request, and calculating the identification information of the network node according to the path to determine whether to perform the path calculation;
  • the path calculation network node determined by the selection performs calculation of the path according to the saved global path calculation information.
  • the process of recording the received path calculation request in the step B13 includes: performing, on the path calculation network node in the network domain, the priority information according to the path calculation request, and sequentially performing path calculation on the path calculation network node.
  • Each path calculates request information, and at the same time, separately stores path calculation request information for processing on the other path calculation network nodes in the network domain.
  • the process of performing path calculation according to the saved global path calculation information includes:
  • step C Obtain path calculation request information of other nodes saved by the network node, and determine whether the path calculation request information to be processed conflicts with the path calculation request information on the other path calculation network node, and if yes, perform step D, otherwise , performing step E;
  • step D waiting for the path calculation request processing on the other path calculation network node is completed, and the path calculation network node realizes the path information synchronization based on the corresponding calculation result, and performs step E;
  • the process of determining whether the resource conflict occurs in step C includes: Determining whether the path calculation request to be processed in the network domain and the other path calculation request are to be occupied simultaneously for a certain resource, and the resource cannot meet the requirement at the same time; if yes, determining that a resource conflict occurs; otherwise, determining that no resource is generated conflict.
  • step C calculating the path calculation request on the network node in the other path Refers to the path calculation request being processed in the other path calculation network node.
  • the method for implementing path calculation in the network domain further includes:
  • the path calculation network node determines that the calculation of the received path cannot be performed according to its own computing power or busyness, it also includes:
  • the path calculation request information on the network node is determined according to the saved path calculation to determine an available path calculation network node
  • the information of the available path calculation network node is sent to the client entity along with a notification message that cannot be processed.
  • the step F1 includes:
  • the path calculation network node determines the path calculation network node with the least path calculation request according to the saved path calculation request information on each of the saved path calculation network nodes, and uses the path calculation network node as an available path calculation network node.
  • the step F2 further includes:
  • the client entity After receiving the notification message returned by the path calculation network node, the client entity obtains the available path calculation network node identification information, and re-sends the path calculation request message to all the path calculation network nodes, where the message carries the message
  • the available paths describe the identification information of the network node.
  • the method for implementing path calculation in the network domain further includes: G.
  • the path calculation network node returns the path calculation result to the corresponding client entity, and the client entity performs the path establishment according to the returned path calculation result;
  • the client entity issues the established path information to all path calculation network nodes in the network domain, and the path calculation network node updates the path in the saved global path calculation information according to the received path information.
  • Information and path calculation request information are included in the path calculation network nodes in the network domain.
  • the present invention also provides an apparatus for implementing path calculation in a network domain, including:
  • a storage unit which stores global path calculation information in a network domain for path calculation; and a calculation unit, configured to perform path calculation according to the global path calculation information saved by the storage unit when the path needs to be established.
  • the device may further include a determining unit, configured to receive a path calculation request message sent by the client entity to all the path calculation network nodes in the autonomous system, record the path calculation request, and determine whether to perform according to the identifier information carried in the message. Path calculation.
  • the device may further include a resource conflict processing unit, configured to acquire path calculation request information of other nodes saved by the storage unit, and determine whether the path calculation request information to be processed is related to other path calculation network nodes before performing path calculation.
  • the upper path calculation request information generates a resource conflict, and the computing unit is notified to perform the path calculation of the path calculation request on the premise of avoiding the resource conflict.
  • the device may further include an available node notification unit, configured to determine an available path according to the path calculation request information on each path calculation network node saved by the storage unit when the calculation process of the received path calculation request cannot be performed.
  • an available node notification unit configured to determine an available path according to the path calculation request information on each path calculation network node saved by the storage unit when the calculation process of the received path calculation request cannot be performed.
  • the device may further include an information updating unit, configured to: when the path creation is successful, the receiving client entity calculates the established path information issued by the network node to all paths in the network domain, and updates the saved global information according to the received path information. Path information and path calculation request information in the path calculation information.
  • the present invention automatically updates the path information of the entire network domain saved on the PCE by keeping the PCE in synchronization with the network state. Interest, which can greatly improve the efficiency and correctness of PCE processing tasks.
  • the implementation of the invention can effectively prevent resource conflicts, improve the correctness of the PCE processing tasks, and avoid sending the same path calculation request multiple times, thereby reducing the number of protocol interactions and improving the operating efficiency of the protocol.
  • the implementation of the present invention can also perform load sharing processing on the calculation request within the autonomous system according to the path calculation request information stored in the entire network domain in the PCE, so that the overall operation efficiency of the corresponding protocol is improved.
  • FIG. 1 is a schematic structural diagram of a PCE mode networking according to an application of the present invention
  • FIG. 2 is a flowchart of a maintenance process of a global path calculation request list in the present invention
  • FIG. 3 is a schematic structural diagram of a global path calculation request list in the present invention
  • FIG. 5 is a flowchart of a process for implementing path computation task sharing in the present invention.
  • each path calculation network entity responsible for completing the path calculation saves all calculation request information in the current domain, thereby effectively avoiding resource conflict problems that may be encountered in distributed computing, and ensuring When different computing requests do not cause resource conflicts, the computing requests in the domain can still be processed in parallel, and the effective load sharing is performed according to the information.
  • the present invention can be applied to a network domain in which various path resources are independently managed, and a plurality of path calculation network entities exist in the network domain for sharing path calculations in the completed network domain.
  • the implementation of the present invention will be described below by taking the present invention as an example in the traffic engineering network domain, i.e., the autonomous system domain of the PCE.
  • the present invention mainly stores global path calculation information on each PCE, and the global path calculation information is all information for path calculation in the entire autonomous system (for example, current in the autonomous system) All path calculation request information, as well as network resource information currently available for allocation or occupancy information of current resources, etc.). This The sample can ensure that the corresponding path calculation result can be obtained quickly and accurately on each PCE, so that the time required for establishing the LSP is greatly shortened.
  • the PCE described in the present invention may be implemented in a router or implemented in a designated server for implementing path calculation within the autonomous system.
  • the corresponding path calculations can be implemented by one or more PCEs.
  • PCEs When there is only one PCE in the autonomous system, all the calculation requests inside the autonomous system will be sent to this PCE, which is called the centralized path calculation method.
  • the calculation requests of all the autonomous systems can be distributed to different PCEs to implement the load balancing of the path calculation, so as to reduce the possibility that the calculation request fails due to PCE blocking.
  • a distributed path calculation method is
  • the PCC needs to know the computing power of each PCE before issuing the calculation request, such as the QoS (service shield) calculation capability, whether the protection link can be calculated, and the load sharing path can be calculated. , TED synchronization capabilities and speed, etc., so that it can choose a suitable PCE and send its calculation request.
  • QoS service shield
  • TED synchronization capabilities and speed, etc. so that it can choose a suitable PCE and send its calculation request.
  • the main focus of the present invention is how to achieve a more reasonable path calculation on the PCE side and obtain more accurate calculation results under the conditions that satisfy the above requirements.
  • the PCE When the PCE performs path calculation and returns a path to the PCC after calculation, such as an ingress LSR, the PCE is in an asynchronous state before the LSP is actually established. This may be due to the failure of the LSP establishment process. It may also be inconsistent with the calculated path after the establishment of the LSP. That is, the network resources occupied by the LSP may be different from the PCE calculation results. If the PCE performs a new path calculation based on the already calculated path, the result will still be in error.
  • the PCE updates the maintenance network status information, such as TED and LSP, according to the actual LSP establishment status, and re-implements the network synchronization to ensure the correctness of the result of the path calculation request processing next time.
  • multiple PCEs may process different path calculation requests at the same time. For example, after a link fails, it may cause multiple ingress LSRs to simultaneously issue calculation requests to different PCEs, resulting in multiple PCEs.
  • the path is calculated, the resource is used and allocated at the same time, and thus some LSP paths fail to be established, so that the PCE is applied again for calculation, which reduces the efficiency of the PCE communication protocol;
  • Each PCE in the network domain can assist the PCC to accurately select an appropriate PCE for processing the path calculation request sent by it, thereby improving path computation efficiency;
  • the present invention is achieved by solving the above three problems. Therefore, the synchronization state of the path information of the PCE can be quickly maintained, and the PCE needs to maintain the instantaneous state of the network resource state to ensure the correctness and timeliness of the calculated LSP path. At the same time, it can effectively prevent the occurrence of resource conflicts, that is, when multiple PCEs in a region or an autonomous system are performing path calculation at the same time, it may cause repeated calculations of several calculation results on the same resource, resulting in resource conflicts. appear.
  • the implementation of the present invention also needs to perform load balancing of the computing task reasonably.
  • the PCE calculation request is excessive, and the PCC calculation request may be blocked due to the inability to obtain a timely response, the PCE notifies itself by using the technology in the invention.
  • the PCC is returned to the PCC for other suitable PCEs that can process the path calculation request, which improves the efficiency of the PCE communication protocol and can implement reasonable load sharing of the path calculation request.
  • the present invention in order to achieve reliable and accurate path calculation, it is necessary to ensure real-time protection in each PCE.
  • the information about the path established in the network domain, that is, the PCE can be configured to quickly synchronize the network state after establishing the corresponding path according to the calculation result of the PCE, that is, the path information in each PCE can be synchronized with the network state in real time.
  • the present invention employs the following processing methods:
  • the calculation result is first returned to the PCC; then, the PCC calculates the result of the PCE through signaling such as RSVP-TE (Resource Reservation Protocol - Traffic Engineering).
  • RSVP-TE Resource Reservation Protocol - Traffic Engineering
  • the ERO parameter the signaling of establishing the LSP is initiated to the downstream.
  • the PCC advertises the established LSP information to all PCEs by using the RRO (Record Route Object) parameter in the return message.
  • the PCE updates its maintained LSP status information to keep the network status synchronized. In this way, the path state information of the entire network domain that can be updated in real time can be saved on each PCE, thereby effectively ensuring the accuracy of path calculation of each PCE.
  • the present invention also needs to establish and maintain a corresponding global path calculation request list on each PCE, which is used to record all path calculation request information in the network domain.
  • the specific maintenance implementation manner and application of the global path calculation request list involved in the method according to the present invention will be described in detail below.
  • the maintenance process of the global path calculation request list is as shown in FIG. 2, which includes: establishing and maintaining a global path calculation request list in the PCE, and storing path calculation request information that all PCEs in the autonomous system need to process, according to the The path calculation request information, the PCE can accurately complete the corresponding path calculation;
  • the global path calculation request list is specifically a master table for maintaining a path calculation request in the current entire network on each PCE, and a global path calculation request list GCT. And according to the PCE to which the calculation request belongs, the calculation request information currently being processed and to be processed by each PCE is reserved.
  • the process of updating the specific global path calculation request list includes: Step 21: When three routers have path calculation requests, calculate the constraint conditions of the request and the PCE processing calculation capability according to each path, and select One of the identified PCEs;
  • Step 22 The router sends path calculation request information to all PCEs in the autonomous system, where the request information carries the identified PCE identification information.
  • the path calculation request information is also advertised to other PCEs in the autonomous system, for example, when the RT 111 sends a path calculation request to the PCE 121, the path is also required.
  • the calculation request information is sent to the PCE 122; the path calculation request information needs to include the identification information of the PCE that processes the request, for example, the IP address information of the corresponding PCE, and the IP information segment is not the destination address of the packet. , but as the PCE identifier that will process the request; of course, other identification information may also be used as the identification information for distinguishing different PCEs;
  • Step 23 Issue request information to all PCEs through each PCC, and all PCEs will receive all path calculation request information in the autonomous system;
  • Step 24 Each PCE calculates the PCE identifier in the request information according to the path, and adds the path calculation request to the path calculation request queue that the corresponding PCE needs to process in the global path calculation request list.
  • each PCE needs to determine whether it needs to process the path calculation request according to the PCE identifier, and performs corresponding path calculation processing on the path calculation request that needs to be processed by itself, and also calculates each path according to the priority according to the PCE identifier.
  • the information is added to the corresponding queue, so that all PCEs in the autonomous system will have a list of the same global path calculation request;
  • the global path calculation request list is as shown in FIG. 3.
  • local-processing-table records the calculation list currently handled by the current PCE (ie, PCE 110), three of which are processed.
  • the calculation requests are from RT 111, RT 112, RT 113, respectively.
  • the order of arrangement is based on the priority of each request, and does not represent the time sequence of receiving dependencies; PCE will sequentially extract path calculation requests from the list and perform path calculation.
  • the current path calculates the request list such that PCE 110 knows the request being processed by PCE 120 and vice versa;
  • the path calculation request information being processed and the path calculation request information waiting for processing are included in each PCE in the global path calculation request list.
  • the list of calculations for all PCEs in the autonomous system together constitutes a list of global path calculation requests. Since the PCE communication protocol is based on reliable transmission, the global path calculation request list is consistent across all PCEs. If there is currently no path calculation request in the autonomous system, the table record is empty.
  • the present invention can be used to solve the resource conflict problem that may occur in the path calculation process.
  • the specific solution is as shown in FIG. 4, which specifically includes the following steps:
  • Step 41 Extracting path calculation request information that needs to be processed from the PCE path calculation request queue
  • Step 42 traverse the path calculation request queue of other PCEs, calculate the request information according to the path of the other PCE, and determine whether the calculation to be performed this time will generate a resource conflict with the calculation of other PCEs, and specifically calculate the requested resource according to the path.
  • the type information and the possible path information are used to determine whether a resource conflict occurs. If a resource conflict may occur, step 43 is performed. Otherwise, if it is determined that there is no resource conflict, step 44 is directly executed without waiting for completion of other PCE computing tasks.
  • Step 43 The calculation processing of the extracted path calculation request is delayed, that is, after waiting for the calculation of the path calculation request being processed by the other PCE, and the PCE resumes synchronization, so that the possibility of the resource conflict disappears, step 44 is performed;
  • Step 44 Perform path calculation on the path calculation request extracted in step 41.
  • the load balancing processing of the path calculation task can also be implemented by using the global path calculation request list.
  • the specific implementation process is as shown in FIG. 5, and includes:
  • Step 51 The PCE may block due to too many calculation tasks, and cannot process some path calculation requests in time;
  • Step 52 The PCE determines that the path calculation request is the least in the global path calculation request list.
  • PCE which is a relatively idle PCE;
  • Step 53 Send the identification information of the idle PCE to the corresponding PCC along with the notification that the PCC returns the calculation process that cannot be performed;
  • Step 54 After receiving the information, the PCC may select the idle PCE to initiate a path calculation request processing process, thereby speeding up the path calculation processing.
  • the PCE can feed back information of its own task overload to the PCC, telling the PCC that the request cannot be processed temporarily, but since the PCC cannot know the PCE state, the computing task cannot be reasonably redistributed to other PCEs. If the PCC chooses another PCE to resend the request, it may still be rejected by other PCEs, so that a path calculation request may need to resend the message heuristics multiple times until a PCE can process the request, reducing the PCE.
  • the efficiency of the communication protocol
  • each PCE not only knows the amount of the task itself, but also the current task amount information of other PCEs, thereby
  • the PCE is selected according to the global path calculation request list, and the PCE with the corresponding processing capability is provided, and the PCE with the corresponding processing capability is fed back to the PCC and is unable to process the calculation request information.
  • Other PCE identifiers that can handle the calculated debt request are fed back to the PCC, so that the PCC avoids the blind selection of the PCE, improves the efficiency of the PCE communication protocol, and can reasonably share the path computation tasks in the autonomous system to each PCE.
  • the present invention can also effectively prevent resource conflicts in the path computation process. Occurs; In addition, it can also reasonably and effectively load-compute the path calculation request within the network domain, so that the overall operation efficiency of the protocol is improved.
  • the present invention also provides an apparatus for implementing path calculation in a network domain, the apparatus comprising a storage unit, a calculation unit, a determination unit, a resource conflict processing unit, an available node notification unit, and an information update unit.
  • the global path meter in the network domain for path calculation is saved on the storage unit
  • the calculation unit performs calculation of the path according to the global path calculation information saved by the storage unit when the path needs to be established.
  • the determining unit receives the path calculation request message sent by the client entity to all the path calculation network nodes in the autonomous system, records the path calculation request, and determines whether to perform path calculation according to the identification information carried in the message.
  • the resource conflict processing unit acquires path calculation request information of other nodes saved by the storage unit, and determines whether the path calculation request information to be processed conflicts with the path calculation request information on the other path calculation network node.
  • the computing unit is notified to perform path calculation of the path calculation request on the premise of avoiding resource conflict.
  • the available node notification unit determines the available path calculation network node according to the path calculation request information on each path calculation network node saved by the storage unit; The available path calculation network node information is sent to the client entity along with a notification message that cannot be processed.
  • the information update unit receives the established path information issued by the client entity to all path calculations in the network domain, and updates the path information and path calculation in the saved global path calculation information according to the received path information. Request information.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Computer And Data Communications (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Description

网络域中实现路径计算的方法及装置 技术领域 本发明涉及网络通信技术领域, 尤其涉及一种网络域中实现路径计 算的方法及装置。
背景技术 流量工程关注网络整体性能的优化, 其主要目标是方便地提供高效 的、 可靠的网络服务, 优化网络资源的使用, 优化网络流量。 具体可以 分为两个层面: 一是面向流量的, 即关注如何提高网络的服务质量; 二 是面向资源的, 即关注如何优化网络资源的使用, 最主要是带宽资源的 有效利用。 随着部署范围的扩大和 GMPLS ( Generalized Multi Protocol Label Switching, 通用的多协议标签交换 )技术的发展, 域间流量工程将 会跨越不同的运营商, 涵盖 GMPLS网络。
约束路径计算, 如 CSPF ( Constrained Shortest Path First, 基于约束 的最短路径优先)计算, 是 MPLS ( Multi Protocol Label Switching, 多协 议标签交换)和 GMPLS流量工程的重要组成部分。对于多自治系统间的 路径计算将非常复杂, 需要不同自治系统的计算实体相互协作, 共同完 成。 基于 PCE ( Path Computation Element,路径计算网络节点)模型的路 径计算方法可以应用于域间流量工程, 该计算方法并不影响计算出来的 路径的使用, 如 LSP ( Label Switched Path标签交换路径) 的建立、 维护 和拆除, 只是针对于这样的 LSP路径的计算。
在基于 PCE模型的路径计算方法中, 当 ingress LSR ( ingress Label Switching Router,入口标签交换路由器)等 PCC( Path Computation Client, 向 PCE发起路径计算请求的客户端实体)希望建立 LSP路径时, 首先发 送请求信息给 PCE, 请求信息中会含有路径的目的地和各种约束条件等 基本信息。 PCE收到所述请求后,会根据与网络同步的拓朴、 TED ( Traffic Engineering Database, 流量工作数据库)等信息计算出满足该请求中的约 束条件的路径, 并将所述路径通过响应报文返回给 PCC, 作为 PCC建立 LSP的 ERO ( Explicit Router Object, 显式路径对象)参数。 所述的计算 出的路径可以含有精确节点 (一个路由器)和松散节点 (一个网段、 一 个区域、 一个自治系统)。
在基于 PCE模型的路径计算方法中,每个 PCE负责的计算范围通常 是一个自治系统,所述的自治系统具体为 IGP ( Internet Gateway Protocol, 内部网关协议)扩散 TED信息的范围。
在 PCE模型中, 需要两个基本协议: PCE发现协议, 负责 PCC发现 PCE的存在和计算能力,在 PCC有计算请求时,根据该协议得到的信息, 选择合适的 PCE发送计算请求进行计算; PCE通信协议, 主要负责 PCC 和 PCE之间传送计算请求和响应信息, PCC在发送计算请求时, 包含各 种约束条件, 当某一 PCE接收到路径计算请求是由本地处理, 则由其进 行相应的路径计算处理。
目前, 对于 PCE通信协议提供了相应的总体需求, 但是, 并没有对 需要中涉及的一些具体面临的问题提出相应的解决方法, 同时也没有对 需要中提出的可能遇到的问题给予解决的办法。
发明内容
本发明的目的是提供一种网络域中实现路径计算的方法及装置, 从 而提高网络域, 如自治系统中的路径计算的效率及准确性。
本发明的目的是通过以下技术方案实现的:
本发明提供了一种网络域中实现路径计算的方法, 包括:
A、在网络域中的各个路径计算网络实体上保存用于路径计算的网络 域中的全局路径计算信息;
B、 当需要建立路径时, 由路径计算网络实体根据保存的全局路径计 算信息进行路径的计算。
所述的全局路径计算信息包括:
网络域内当前所有的路径计算请求信息, 以及当前可用于分配的网 络资源信息或当前资源的占用信息。
所述的步驟 B具体包括:
Bl、 当客户端实体需要建立路径时, 客户端实体选择确定一个路径 计算网络节点作为路径计算网络实体, 并向所述的网络节点发送路径计 算请求;
B2、 所述网络节点接收所述路径计算请求后根据保存的全局路径计 算信息对其进行路径的计算。
或者, 所述的步骤 B具体包括:
Bll、 当客户端实体需要建立路径时, 客户端实体选择确定一个路径 计算网络节点;
B12、客户端实体向自治系统中所有的路径计算网络节点发送路径计 算请求消息, 消息中携带着选择确定的路径计算网络节点的标识信息; B13、 各个路径计算网络节点接收所述路径计算请求后, 记录接收的 路径计算请求, 并根据所述的路径计算网络节点的标识信息决定是否进 行路径计算;
B14、所述选择确定的路径计算网络节点根据保存的全局路径计算信 息进行路径的计算。
所述的步珮 B13中的记录接收的路径计算请求的过程包括: 在网络域中的路径计算网络节点上, 根据路径计算请求的优先级信 息依次保存需要在该路径计算网络节点上进行路径计算的各个路径计算 请求信息, 同时, 还分别保存网络域中的其他各个路径计算网络节点上 负责处理的路径计算请求信息。
本发明中, 当路径计算网络节点进行路径计算请求处理之前, 所述 根据保存的全局路径计算信息进行路径计算的过程包括:
C、 获取路径计算网络节点保存的其他节点的路径计算请求信息, 判 断待处理的路径计算请求信息是否与其他路径计算网络节点上路径计算 请求信息产生资源冲突, 如果是, 则执行步骤 D, 否则, 执行步驟 E;
D、 等待所述其他路径计算网络节点上的路径计算请求处理完成, 且 路径计算网络节点基于相应计算结果实现路径信息同步后, 执行步骤 E;
E、 在该路径计算网絡节点中进行路径计算请求的路径计算。
所述的步驟 C的判断是否产生资源冲突的过程包括: 判断网络域中待处理的路径计算请求及与所述其他路径计算请求是 否将要对某一资源同时进行占用而该资源无法同时满足需要, 如果是, 则确定产生资源冲突, 否则, 确定未产生资源冲突。
所述的步骤 B中,
在所述路径计算网络节点上分别记录网络域中各个路径计算网络节 点的正在处理的路径计算请求和等待处理的路径请求, 且在步骤 C中, 所述的其他路径计算网络节点上路径计算请求是指其他路径计算网络节 点中的正在处理的路径计算请求。
所述的网络域中实现路径计算的方法还包括:
F、 当路径计算网络节点无法对接收到的路径计算请求进行计算处理 时, 则向客户端实体返回无法进行计算处理的通知。
当路径计算网络节点根据自身计算能力或繁忙程度确定无法对接收 到的路径计算情求'进行计算处理时, 还包括:
Fl、 当路径计算网络节点根据自身计算能力或繁忙程度确定无法对 接收到的路径计算请求进行计算处理时, 根据保存的各个路径计算网络 节点上的路径计算请求信息确定可用的路径计算网络节点;
F2、 将所述可用的路径计算网络节点的信息随无法进行计算处理的 通知消息一起发送给客户端实体。
所述的步聚 F1包括:
路径计算网络节点根据保存的各个路径计算网络节点上的路径计算 请求信息确定路径计算请求最少的路径计算网络节点, 将该路径计算网 络节点作为可用的路径计算网络节点。
所述的步骤 F2还包括:
当客户端实体接收到路径计算网络节点返回的通知消息后, 获取所 述的可用的路径计算网络节点的标识信息, 并重新向所有的路径计算网 絡节点发送路径计算请求消息, 消息中携带着所述的可用的路径计算网 络节点的标识信息。
所述的网络域中实现路径计算的方法还包括: G、路径计算网络节点将路径计算结果返回给相应的客户端实体, 并 由客户端实体根据返回的路径计算结果进行路径的建立;
H、 当路径创建成功时, 客户端实体将建立的路径信息发布给网络域 中的所有路径计算网络节点, 所述路径计算网络节点根据接收的路径信 息更新其保存的全局路径计算信息中的路径信息和路径计算请求信息。
本发明还提供一种网絡域中实现路径计算的装置, 包括:
存储单元, 保存用于路径计算的网络域中的全局路径计算信息; 计算单元, 用于在需要建立路径时, 根据所述存储单元保存的全局 路径计算信息进行路径的计算。
另外, 该装置还可以包括判断单元, 用于接收客户端实体向自治系 统中所有的路径计算网络节点发送的路径计算请求消息, 记录该路径计 算请求, 并根据消息中携带的标识信息决定是否进行路径计算。
另外, 该装置还可以包括资源冲突处理单元, 用于在进行路径计算 之前, 获取所述存储单元保存的其他节点的路径计算请求信息, 判断待 处理的路径计算请求信息是否与其他路径计算网络节点上路径计算请求 信息产生资源冲突, 在避免资源冲突的前提下, 通知所述计算单元进行 路径计算请求的路径计算。
另外, 该装置还可以包括可用节点通知单元, 用于在无法对接收到 的路径计算请求进行计算处理时, 根据所述存储单元保存的各个路径计 算网络节点上的路径计算请求信息确定可用的路径计算网络节点; 将所 述可用的路径计算网絡节点的信息随无法进行计算处理的通知消息一起 发送给客户端实体。
另外, 该装置还可以包括信息更新单元, 用于在路径创建成功时, 接收客户端实体向网络域中的所有路径计算网络节点发布的建立的路径 信息, 根据接收的路径信息更新其保存的全局路径计算信息中的路径信 息和路径计算请求信息。
由上述本发明提供的技术方案可以看出, 本发明通过使 PCE快速保 持与网络状态的同步, 即实时更新 PCE上保存的整个网络域中的路径信 息, 从而可以大大提高 PCE处理任务的效率和正确性。
同时, 本发明的实现还可以有效的防止资源冲突, 提高了 PCE处理 计算任务的正确性, 避免了多次发送同一路径计算请求, 从而减少协议 交互的次数, 提高协议的运行效率。
另外, 本发明的实现还可以根据 PCE中保存的整个网络域中的路径 计算请求信息合理、 有效的将自治系统内部的计算请求进行负载分担处 理, 从而使得相应协议的整体运行效率提高。
附图说明 图 1为本发明应用的 PCE模式组网结构示意图;
图 2为本发明中全局路径计算请求列表的维护处理流程图; 图 3为本发明中全局路径计算请求列表的结构示意图;
图 4为本发明中防止资源冲突的处理流程图;
图 5为本发明中实现路径计算任务分担的处理流程图。
具体实施方式 本发明的核心是网络域内, 每个负责完成路径计算的路径计算网絡 实体上保存当前域内所有计算请求信息 , 从而可以有效的避免分布式计 算可能会遇到的资源冲突问题, 在确保不同的计算请求不会产生资源冲 突时, 域内的计算请求仍可以并行处理, 同时根据该信息进行有效的计 算负载分担。
本发明可以应用于各种路径资源独立管理的网络域中, 并且该网络 域中存在多个路径计算网络实体, 用于分担完成网络域中的路径计算。
下面将以在流量工程网络域, 即 PCE的自治系统域中实现本发明为 例, 对本发明的实现进行说明。
在 PCE自治系统中,本发明主要是分别在各个 PCE上分別保存有全 局路径计算信息, 所述的全局路径计算信息为整个自治系统内部的用于 路径计算的全部信息 (例如, 自治系统内部当前所有的路径计算请求信 息, 以及当前可用于分配的网络资源信息或当前资源的占用信息等)。 这 样可以保证在每个 PCE上均可以快速准确地获得相应的路径计算结果, 从而使得建立 LSP所需要的时间大大缩短。
本发明中所述的 PCE可以实现于路由器中, 或者实现于一台指定的 服务器中, 用于实现自治系统内部的路径计算。
在一个自治系统内部, 相应的路径计算可以由一个或者多个 PCE实 现。 当自治系统内部只有一个 PCE时, 所有自治系统内部的计算请求都 将发送给这个 PCE, 称为集中式的路径计算方法。 当自治系统中有多个 PCE存在时, 所有的自治系统内部的计算请求可以被分布到不同的 PCE 上实现, 从而实现路径计算的负载分担, 以减少计算请求由于 PCE阻塞 导致失败的可能, 称为分布式的路径计算方法。
在分布式路径计算方法中, PCC在发出计算请求前, 需要知道每个 PCE具备的计算能力, 如具备哪些 QoS (服务盾量)计算的能力、 是否 可以计算保护链路和计算负载分担的路径、 TED 同步能力和速度等, 以 便于其从中选出一个适合的 PCE, 并发送其计算请求。 对于这些要求, 在本发明之前的一些技术已经可以满足。 本发明主要关注的是在满足上 述要求的条件下, PCE侧如何实现更为合理的路径计算, 以及获得更为 准确的计算结果。
本发明在具体实现的过程中需要考虑以下三方面的问题:
( 1 )根据 PCE计算的路径完成 LSP的建立工作后, 需要更新 PCE 上的 LSP信息, 以确定针对其他路径计算的准确性;
当 PCE进行路径计算, 并将某一路径在计算出后返回给 PCC, 如 ingress LSR时, 在真正建立 LSP前, PCE是处于非同步的状态的。 这是 由于 LSP建立的过程中可能会失败, 也可能建立成功后与计算的路径不 一致, 即当 LSP真正建立时占用的网络资源与 PCE计算的结果可能会有 差异。 如果 PCE依据已经计算的路径进行新的路径计算, 其结果将仍可 能出错。 因此, 需要在 LSP建立成功或失败后, PCE根据实际的 LSP建 立情况更新维护网络状态信息, 如 TED和 LSP等, 重新实现网络同步, 以确保下次处理路径计算请求的结果的正确性; ( 2 )解决可能出现的资源冲突问题;
在分布式 PCE网络中,多个 PCE可能同时处理不同的路径计算请求, 例如, 某一链路失效后重新恢复, 可能引起多个 ingress LSR同时向不同 的 PCE发布计算请求,导致多个 PCE在计算路径时同时对某一资源使用 和分配, 并由此导致某些 LSP路径在建立时的失败, 从而再次向 PCE申 请计算, 降低了 PCE通信协议的效率;
( 3 )在网络域中各个 PCE可以协助 PCC准确选择合适的 PCE用于 处理其发送的路径计算请求, 从而提高路径计算效率;
当 PCC无法知道 PCE运行状态时, 不同的 PCE可能会存在请求分 配不均匀, 某一 PCE由于请求过多而阻塞, 而其他 PCE可能由于没有计 算任务而处于空闲状态, 即便 PCE可以告知 PCC当前由于任务过多而不 能接受计算请求时, PCC仍无法知道其他 PCE是否也在阻塞, 不能正确 的选择其它的 PCE, 只能依次发送请求信息, 从而降低了 PCE通信协议 整体效率 , 也无法使计算请求合理的负载分担。
本发明正是围绕解决上述 3个问题实现。从而实现可以快速保持 PCE 的路径信息的同步状态, PCE 需要保持网络资源状态即时信息, 以保证 所计算 LSP路径的正确性和及时性。 同时, 还可以有效防止资源冲突的 发生,即避免当一个区域或自治系统内多个 PCE同时在进行路径计算时, 可能会造成几个计算的结果对同一资源的重复占用, 导致资源冲突的情 况出现。
另外, 本发明的实现还需要可以合理的进行计算任务负载分担, 当 PCE计算请求过多, PCC的计算请求可能由于不能得到及时响应而发生 阻塞时, 采用该发明中的技术, PCE 除了通告自己阻塞消息外, 同时向 PCC返回网络中其他可以处理该路径计算请求的较为适合的 PCE, 提高 了 PCE通信协议的效率, 并可以实现路径计算请求的合理的负载分担。
为对本发明有进一步的理解, 下面将结合附图对本发明所述的方法 的具体实现方式进行详细的说明。
本发明中, 为实现可靠准确的路径计算, 需要使各个 PCE中实时保 存网络域中建立的路径的信息, 即要求 PCE上可以实现在根据 PCE的计 算结果建立相应路径后能够快速同步网络状态, 也就是保证各个 PCE中 的路径信息可以实时与网络状态同步。 为此, 本发明采用了如下的处理 方法:
每个 PCE根据相应的路径计算请求进行相应的路径计算处理后, 首 先将计算结果返回 PCC; 然后, 由 PCC通过 RSVP-TE (资源预留协议 - 流量工程)等信令, 将 PCE的计算结果作为 ERO参数, 向下游发起建立 LSP的信令;当 LSP建立成功 , PCC通过返回消息中的 RRO( Record Route Object, 路径记录对象)参数, 将已经建立的 LSP信息发布给所有 PCE, 以使所有的 PCE更新其维护的 LSP状态信息,保持网络状态同步。这样, 各个 PCE上均可以保存有可以实时更新的整个网络域的路径状态信息, 从而有效保证了各个 PCE的路径计算的准确性。
为解决 PCE路径计算过程中的资源冲突及负载分担问题, 本发明中 还需要在各个 PCE上建立维护相应的全局路径计算请求列表, 用于记录 网络域内的所有路径计算请求信息。 下面将对本发明所述的方法中涉及 的全局路径计算请求列表的具体维护实现方式及其应用进行详细说明。
全局路径计算请求列表的维护处理过程如图 2所示, 具体包括: 在 PCE中建立并维护着全局路径计算请求列表, 用于保存自治系统 内的所有 PCE需要处理的路径计算请求信息,根据该路径计算请求信息, PCE可以准确地完成相应的路径计算;
如图 3所示,所述的全局路径计算请求列表(GCT, Global Computing Table )具体为在每个 PCE上维护着当前全网中的路径计算请求的一张总 表, 全局路径计算请求列表 GCT并按照计算请求所属的 PCE保留每个 PCE当前正在处理和将要处理的计算请求信息。
以下举例具体说明在 PCE上如何维护全局路径计算请求列表: 如图 1所示, 图中虚线内为一个自治系统, 其中有三台路由器: RT 111 , RT 112, RT 113, 按照 PCE发现协议, 每台路由器都知道自治系统 内部有两个 PCE: PCE 121 , PCE 122; 如图 2所示, 具体的全局路径计算请求列表的更新处理过程包括: 步骤 21: 当三台路由器有路径计算请求时, 则根据每个路径计算请 求的约束条件和 PCE处理计算的能力, 选择其中一个确定的 PCE;
步骤 22: 路由器向自治系统内的所有 PCE发送路径计算请求信息, 请求信息中携带着确定的 PCE的标识信息;
具体为: 向确定的 PCE发送路径计算请求的同时, 还将该路径计算 请求信息发布给自治系统内的其它 PCE, 如当 RT 111向 PCE 121发送路 径计算请求时, 同时, 还需要将该路径计算请求信息发送给 PCE 122; 在所述的路径计算请求信息中需要包含处理该请求的 PCE的标识信 息, 例如, 相应的 PCE的 IP地址信息等, 该 IP信息段不是作为报文的 目的地址, 而是作为将要处理这个请求的 PCE标识; 当然, 也可以采用 其他标识信息作为区分不同 PCE的标识信息;
步骤 23: 通过每个 PCC向所有 PCE发布请求信息, 所有的 PCE都 将收到自治系统内所有的路径计算请求信息;
步驟 24: 各个 PCE根据路径计算请求信息中的 PCE标识,将所述的 路径计算请求加入到全局路径计算请求列表中相应的 PCE需要处理的路 径计算请求队列中;
具体为各个 PCE需要根据 PCE标识判断自己是否需要处理该路径计 算请求, 并对需要自己进行处理的路径计算请求进行相应的路径计算处 理, 同时, 还根据 PCE标识按照优先次序, 将各个路径计算请求信息加 入相应的队列, 这样自治系统内所有的 PCE将有一个同样的全局路径计 算请求列表;
以 PCE 110为例, 其全局路径计算请求列表如图 3所示, 在图 3中 local— computing— table (本地计算列表)记录了当前 PCE (即 PCE 110 ) 本地负责处理的计算列表, 其中有三个计算请求, 分别来自 RT 111 , RT 112, RT 113 , 排列次序按照每个请求的优先級, 并不代表接收倚求的时 间次序; PCE将顺序的从列表中提取路径计算请求并进行路径计算处理; 在图 3中的 PCE 120— computing— table ( PCE120计算列表)记录了 PCE2 当前的路径计算请求列表, 这样 PCE 110知道 PCE 120正在处理的请求, 反之亦然;
在全局路径计算请求列表中各个 PCE下包括正在处理的路径计算请 求信息和等待处理的路径计算请求信息。
在自治系统中所有的 PCE的计算列表合起来构成了全局路径计算请 求列表, 由于 PCE通信协议是基于可靠传输的, 该全局路径计算请求列 表在所有的 PCE上都是一致的。 如果自治系统内当前没有任何路径计算 请求, 则该表记录为空。
建立并维护了上述全局路径计算请求列表后, 本发明中, 可以利用 该表解决路径计算过程中可能出现的资源冲突问题, 具体的解决办法如 图 4所示, 具体包括以下步骤:
步骤 41: 从 PCE路径计算请求队列中, 提取需要进行处理的路径计 算请求信息;
步驟 42:遍历其他 PCE的路径计算请求队列,根据其他 PCE的正在 处理的路径计算请求信息, 判断本次将要进行的计算是否与其他 PCE的 计算将要产生资源冲突, 具体可以根据路径计算请求的资源类型信息和 可能的路径信息判断是否产生资源冲突, 如果可能产生资源冲突, 则执 行步骤 43 , 否则, 即判断不存在资源冲突, 则直接执行步骤 44, 而无需 等待其他 PCE计算任务的完成;
步驟 43: 本次提取的路径计算请求的计算处理延时进行, 即等待其 他 PCE正在处理的路径计算请求完成计算后, 且 PCE恢复同步, 使得资 源冲突的可能性消失时, 执行步骤 44;
步骤 44: 对步骤 41中提取的路径计算请求进行路径计算。
本发明中, 利用上述全局路径计算请求列表还可以实现路径计算任 务的负载分担处理, 具体的实现过程如图 5所示, 包括:
步骤 51: PCE由于计算任务过多会导致阻塞, 无法对部分路径计算 请求及时处理;
步驟 52: 该 PCE在全局路径计算请求列表中确定路径计算请求最少 的 PCE, 即相对空闲的 PCE;
步骤 53: 将所述空闲的 PCE的标识信息随着向 PCC返回的无法进 行计算处理的通知一起发送给相应的 PCC;
步驟 54: PCC收到所述的信息后, 便可以选择所述空闲的 PCE发起 路径计算请求处理过程, 从而加快路径计算处理过程。
也就是说, 在本发明以前, PCE 虽然可以将自身任务过载的信息反 馈给 PCC, 告诉 PCC暂时不能处理请求, 但由于 PCC无法知道 PCE状 态, 不能合理的将计算任务重新分发到其他 PCE, 此时, 如果 PCC在选 择其他 PCE重新发送请求时, 仍有可能会被其他 PCE拒绝, 使得一次路 径计算请求可能需要多次重新发送报文试探, 直至某个 PCE可以处理该 请求为止, 降低了 PCE通信协议的效率;
釆用上述步驟 52至步骤 54的处理过程, 使得在通过基于上述全局 路径计算请求列表的处理过程, 每个 PCE不但很清楚自己计算任务量, 而且也清楚其他 PCE当前的任务量信息, 从而在自己处于阻塞时, 根据 全局路径计算请求列表挑选出当前其他计算任务较少或者空闲, 并具备 相应的处理能力的 PCE, 在向 PCC反馈自己正处于阻塞状态而不能处理 计算请求信息的同时, 将其他可以处理该计算債求的 PCE标识反馈给 PCC, 使 PCC避免了盲目的选择 PCE, 提高了 PCE通信协议的效率, 并 可以合理地将自治系统内的路径计算任务分担到每个 PCE。
综上所述, 通过使路径计算网络实体可以快速保持与网絡状态的同 步, 可以大大提高其处理路径计算任务的效率和正确性; 同时, 本发明 还可以有效的防止路径计算过程中资源冲突的发生; 另外, 还可以合理、 有效的将网络域内部的路径计算请求负载分担, 使协议整体运行效率提 高。
此外, 本发明还提供一种网络域中实现路径计算的装置, 该装置包 括存储单元、 计算单元、 判断单元、 资源冲突处理单元、 可用节点通知 单元和信息更新单元。
其中, 所述存储单元上保存用于路径计算的网络域中的全局路径计 算信息; 在需要建立路径时, 所述计算单元根据所述存储单元保存的全 局路径计算信息进行路径的计算。
所述判断单元接收客户端实体向自治系统中所有的路径计算网络节 点发送的路径计算请求消息, 记录该路径计算请求, 并根据消息中携带 的标识信息决定是否进行路径计算。
在进行路径计算之前, 该资源冲突处理单元获取所述存储单元保存 的其他节点的路径计算请求信息, 判断待处理的路径计算请求信息是否 与其他路径计算网络节点上路径计算请求信息产生资源冲突, 在避免资 源冲突的前提下, 通知所述计算单元进行路径计算请求的路径计算。
在无法对接收到的路径计算请求进行计算处理时, 则所述可用节点 通知单元根据所述存储单元保存的各个路径计算网络节点上的路径计算 请求信息确定可用的路径计算网络节点; 将所述可用的路径计算网絡节 点的信息随无法进行计算处理的通知消息一起发送给客户端实体。
在路径创建成功时, 信息更新单元接收客户端实体向网络域中的所 有路径计算网络节点发布的建立的路径信息, 根据接收的路径信息更新 其保存的全局路径计算信息中的路径信息和路径计算请求信息。
以上所述, 仅为本发明较佳的具体实施方式, 但本发明的保护范围 并不局限于此, 任何熟悉本技术领域的技术人员在本发明揭露的技术范 围内, 可轻易想到的变化或替换, 都应涵盖在本发明的保护范围之内。 因此, 本发明的保护范围应该以权利要求的保护范围为准。

Claims

权 利 要 求
1、 一种网络域中实现路径计算的方法, 其特征在于, 包括:
A、在网络域中的各个路径计算网络实体上保存用于路径计算的网络 域中的全局路径计算信息;
B、 当需要建立路径时, 由路径计算网络实体根据保存的全局路径计 算信息进行路径的计算。
2、 根据权利要求 1所述的网络域中实现路径计算的方法, 其特征在 于, 所述的全局路径计算信息包括:
网络域内当前所有的路径计算请求信息, 以及当前可用于分配的网 络资源信息或当前资源的占用信息。
3、 根据权利要求 1所述的网络域中实现路径计算的方法, 其特征在 于, 所述的步驟 B具体包括:
Bl、 当客户端实体需要建立路径时, 客户端实体选择确定一个路径 计算网络节点作为路径计算网络实体, 并向所述的网络节点发送路径计 算请求;
B2、 所述网络节点接收所述路径计算请求后根据保存的全局路径计 算信息对其进行路径的计算。
4、 根据权利要求 1所述的网络域中实现路径计算的方法, 其特征在 于, 所述的步骤 B具体包括:
Bll、 当客户端实体需要建立路径时, 客户端实体选择确定一个路径 计算网络节点;
B12、客户端实体向自治系统中所有的路径计算网絡节点发送路径计 算请求消息, 消息中携带着选择确定的路径计算网络节点的标识信息; B13、 各个路径计算网絡节点接收所述路径计算请求后, 记录接收的 路径计算请求;
B14、所述选择确定的路径计算网络节点根据保存的全局路径计算信 息进行路径的计算。
5、 根据权利要求 4所述的网络域中实现路径计算的方法, 其特征在 于, 所述的步骤 B13中的记录接收的路径计算请求的过程包括:
在网絡域中的路径计算网络节点上, 根据路径计算请求的优先级信 息依次保存需要在该路径计算网络节点上进行路径计算的各个路径计算 请求信息; 还分别保存网络域中的其他各个路径计算网络节点上负责处 理的路径计算请求信息。
6、 根据权利要求 3、 4或 5所述的网络域中实现路径计算的方法, 其特征在于 , 所述根据保存的全局路径计算信息进行路径计算的过程包 括:
c、 获取路径计算网络节点保存的其他节点的路径计算请求信息, 判 断待处理的路径计算请求信息是否与其他路径计算网络节点上路径计算 请求信息产生资源冲突, 如果是, 则执行步驟 D; 否则, 执行步骤 E;
D、 等待所述其他路径计算网络节点上的路径计算请求处理完成, 且 路径计算网络节点基于相应计算结果实现路径信息同步后 , 执行步骤 E;
E、 在该路径计算网络节点中进行路径计算请求的路径计算。
7、 根据权利要求 6所述的网络域中实现路径计算的方法, 其特征在 于, 所述的步骤 C的判断是否产生资源冲突的过程包括:
判断网络域中待处理的路径计算请求及与所述其他路径计算请求是 否将要对某一资源同时进行占用而该资源无法同时满足需要, 如果是, 则确定产生资源冲突; 否则, 确定未产生资源冲突。
8、 根据权利要求 6所述的网络域中实现路径计算的方法, 其特征在 于, 所述的步驟 B 中, 在所述路径计算网络节点上分别记录网络域中各 个路径计算网络节点的正在处理的路径计算请求和等待处理的路径请 求;
且在步骤 C 中, 所述的其他路径计算网络节点上路径计算请求是指 其他路径计算网络节点中的正在处理的路径计算请求。
9、根据权利要求 1至 5任一项所述的网络域中实现路径计算的方法 , 其特征在于, 该方法还包括: F、 当路径计算网络节点无法对接收到的路径计算请求进行计算处理 时, 则向客户端实体返回无法进行计算处理的通知。
10、 根据权利要求 9所述的网络域中实现路径计算的方法, 其特征 在于, 当路径计算网络节点根据自身计算能力或繁忙程度确定无法对接 收到的路径计算请求进行计算处理时, 还包括:
F 1、 根据保存的各个路径计算网络节点上的路径计算请求信息确定 可用的路径计算网络节点;
F2、 将所述可用的路径计算网络节点的信息随无法进行计算处理的 通知消息一起发送给客户端实体。
11、 根据权利要求 10所述的网络域中实现路径计算的方法, 其特征 在于, 所述的步骤 F1包括:
路径计算网络节点根据保存的各个路径计算网络节点上的路径计算 请求信息确定路径计算请求最少的路径计算网络节点, 将该路径计算网 络节点作为可用的路径计算网络节点。
12、 根据权利要求 10所述的网络域中实现路径计算的方法, 其特征 在于, 所述的步骤 F2还包括:
当客户端实体接收到路径计算网络节点返回的通知消息后, 获取所 述的可用的路径计算网络节点的标识信息, 并重新向所有的路径计算网 络节点发送路径计算请求消息, 消息中携带着所述的可用的路径计算网 络节点的标识信息。
13、 根据权利要求 1至 5任一项所述的网络域中实现路径计算的方 法, 其特征在于, 该方法还包括:
G、路径计算网络节点将路径计算结果返回给相应的客户端实体, 并 由客户端实体根据返回的路径计算结果进行路径的建立;
H、 当路径创建成功时, 客户端实体将建立的路径信息发布给网络域 中的所有路径计算网络节点, 所述路径计算网络节点根据接收的路径信 息更新其保存的全局路径计算信息中的路径信息和路径计算请求信息。
14、 一种网络域中实现路径计算的装置, 其特征在于, 包括: 存储单元, 保存用于路径计算的网络域中的全局路径计算信息; 计算单元, 用于在需要建立路径时, 根据所述存储单元保存的全局 路径计算信息进行路径的计算。
15、 根据权利要求 14所述的网络域中实现路径计算的装置, 其特征 在于, 还包括判断单元, 用于接收客户端实体向自治系统中所有的路径 计算网络节点发送的路径计算请求消息, 记录该路径计算请求, 并根据 消息中携带的标识信息决定是否进行路径计算。
16、 根据权利要求 15所述的网络域中实现路径计算的装置, 其特征 在于, 还包括资源冲突处理单元, 用于在进行路径计算之前, 获取所述 存储单元保存的其他节点的路径计算请求信息, 判断待处理的路径计算 请求信息是否与其他路径计算网络节点上路径计算请求信息产生资源冲 突, 在避免资源冲突的前提下, 通知所述计算单元进行路径计算请求的 路径计算。
17、 居权利要求 14至 16任一项所述的网络域中实现路径计算的 装置, 其特征在于, 还包括可用节点通知单元, 用于在无法对接收到的 路径计算请求进行计算处理时, 根据所述存储单元保存的各个路径计算 网络节点上的路径计算请求信息确定可用的路径计算网络节点; 将所述 可用的路径计算网络节点的信息随无法进行计算处理的通知消息一起发 送给客户端实体。
18、 根据权利要求 14至 16任一项所述的网絡域中实现路径计算的 装置, 其特征在于, 还包括信息更新单元, 用于在路径创建成功时, 接 收客户端实体向网络域中的所有路径计算网络节点发布的建立的路径信 息, 根据接收的路径信息更新其保存的全局路径计算信息中的路径信息 和路径计算请求信息。
PCT/CN2006/001039 2005-05-20 2006-05-19 Procede et appareil pour calculer un chemin d'acces dans un domaine de reseau WO2006122506A1 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP06741927A EP1883181B1 (en) 2005-05-20 2006-05-19 A method and apparatus for computing a path in a network domain
AT06741927T ATE437499T1 (de) 2005-05-20 2006-05-19 Verfahren und vorrichtung zum berechnen eines pfades in einer netzwerkdomäne
DE602006007983T DE602006007983D1 (de) 2005-05-20 2006-05-19 Verfahren und vorrichtung zum berechnen eines pfades in einer netzwerkdomäne
US11/914,929 US7978622B2 (en) 2005-05-20 2006-05-19 Method and apparatus for computing a path in a network domain

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CNB2005100708904A CN100454830C (zh) 2005-05-20 2005-05-20 网络域中实现路径计算的方法
CN200510070890.4 2005-05-20

Publications (1)

Publication Number Publication Date
WO2006122506A1 true WO2006122506A1 (fr) 2006-11-23

Family

ID=37425743

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2006/001039 WO2006122506A1 (fr) 2005-05-20 2006-05-19 Procede et appareil pour calculer un chemin d'acces dans un domaine de reseau

Country Status (6)

Country Link
US (1) US7978622B2 (zh)
EP (1) EP1883181B1 (zh)
CN (1) CN100454830C (zh)
AT (1) ATE437499T1 (zh)
DE (1) DE602006007983D1 (zh)
WO (1) WO2006122506A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101686170A (zh) * 2008-09-27 2010-03-31 重庆广用通信技术有限责任公司 基于多出口用户路由的分级传输品质保障系统
US8953597B2 (en) 2008-03-27 2015-02-10 Futurewei Technolgies, Inc. Computing point-to-multipoint paths

Families Citing this family (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100512209C (zh) 2005-05-24 2009-07-08 华为技术有限公司 分布式路径计算中解决资源冲突的方法
US7831700B2 (en) 2006-10-16 2010-11-09 Futurewei Technologies, Inc. Distributed PCE-based system and architecture in multi-layer network
US8009669B2 (en) 2006-10-16 2011-08-30 Futurewei Technologies, Inc. System of path computation element protocol support for large-scale concurrent path computation
CN101286892B (zh) * 2007-04-12 2012-09-05 华为技术有限公司 进行业务恢复的装置和方法
JP5316416B2 (ja) * 2007-10-18 2013-10-16 日本電気株式会社 ネットワークシステム、経路計算方法、及び、経路計算用プログラム
CN101425956B (zh) * 2007-10-30 2011-05-11 华为技术有限公司 跨自治系统发现路径计算单元的方法、设备和系统
US7940753B2 (en) * 2007-11-29 2011-05-10 Alcatel Lucent Enhancing routing optimality in IP networks requiring path establishment
CN101163110B (zh) * 2007-11-30 2010-06-02 华为技术有限公司 部署流量工程隧道的方法及装置
US7668971B2 (en) * 2008-01-11 2010-02-23 Cisco Technology, Inc. Dynamic path computation element load balancing with backup path computation elements
CN101621447B (zh) * 2008-06-30 2012-04-04 华为技术有限公司 一种业务路径计算的方法、设备和系统
CN101626618B (zh) * 2008-07-07 2012-08-08 华为技术有限公司 无线资源分配方法、网络节点设备及无线通信系统
CN101729376B (zh) 2008-10-27 2011-12-21 华为技术有限公司 一种路径计算方法、节点设备及路径计算单元
CN102065512B (zh) * 2009-11-12 2013-08-07 中兴通讯股份有限公司 多层网络中区域边界控制的方法、建立连接的方法和系统
KR101304793B1 (ko) * 2009-12-21 2013-09-05 한국전자통신연구원 Ted 정확성을 보장하는 ted 관리 방법 및 시스템
ES2434261T3 (es) * 2010-01-04 2013-12-16 Telefonaktiebolaget Lm Ericsson (Publ) Proporcionar información de retorno a un elemento de cálculo de ruta
CN101820362B (zh) * 2010-04-29 2013-02-27 中兴通讯股份有限公司 一种解决资源分配冲突的方法及装置
KR20120071118A (ko) * 2010-12-22 2012-07-02 한국전자통신연구원 경로 계산 장치 및 그를 이용한 경로 계산 방법
US9491086B2 (en) 2011-03-02 2016-11-08 Ciena Corporation Distributed network planning systems and methods
CN104348744B (zh) 2013-08-01 2019-05-24 中兴通讯股份有限公司 一种路径计算方法及路径计算单元
EP3076611B1 (en) * 2013-11-27 2018-11-21 Nec Corporation Communication system, communication method, network information combination apparatus, and network information combination program
CN105591888A (zh) * 2014-11-18 2016-05-18 中兴通讯股份有限公司 一种计算路径的方法和路径计算服务器
CN106549865A (zh) * 2015-09-21 2017-03-29 中兴通讯股份有限公司 业务动态恢复的方法、装置及软件定义网络sdn控制器
CN106789656B (zh) * 2016-12-16 2019-10-25 北京格林伟迪科技股份有限公司 一种路由请求处理方法和装置
CN108574636B (zh) * 2017-03-13 2022-04-05 中兴通讯股份有限公司 一种隧道授权信息处理方法及路径计算单元
US10447587B2 (en) * 2017-09-22 2019-10-15 Keysight Technologies Singapore (Sales) Pte. Ltd. Computing label-switched data communication paths
CN111371683B (zh) * 2018-12-25 2021-06-29 华为技术有限公司 网络连接路径的判定方法、设备及通信系统
CN113328929B (zh) * 2020-02-29 2023-04-18 杭州迪普科技股份有限公司 路由冲突提醒方法、装置、电子设备及计算机可读介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1473887A2 (en) * 2003-04-29 2004-11-03 Alcatel Protection scheme for a communications network under multiple failures
US20050008014A1 (en) * 2003-07-07 2005-01-13 Debasis Mitra Techniques for network traffic engineering
CN1601966A (zh) * 2003-09-28 2005-03-30 华为技术有限公司 一种路由路径选择方法

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7324453B2 (en) * 2002-08-30 2008-01-29 Alcatel Lucent Constraint-based shortest path first method for dynamically switched optical transport networks
CN100391154C (zh) * 2003-09-18 2008-05-28 华为技术有限公司 一种资源管理器中路由的选路方法
CN1601971A (zh) * 2003-09-26 2005-03-30 华为技术有限公司 一种承载控制层的资源分配方法
US20050074003A1 (en) 2003-10-02 2005-04-07 Ball David Alexander Distributed software architecture for implementing BGP
US7599349B2 (en) * 2004-01-29 2009-10-06 Cisco Technology, Inc. Computing inter-autonomous system MPLS traffic engineering LSP paths
US7496105B2 (en) * 2004-11-05 2009-02-24 Cisco Technology, Inc. System and method for retrieving computed paths from a path computation element using encrypted objects
US7623461B2 (en) * 2005-02-09 2009-11-24 Cisco Technology, Inc. Trigger for packing path computation requests
US9059867B2 (en) * 2005-03-02 2015-06-16 Cisco Technology, Inc. Technique for selecting a path computation element based on response time delay
US7599302B2 (en) * 2005-07-19 2009-10-06 Cisco Technology, Inc. Dynamic enforcement of MPLS-TE inter-domain policy and QoS

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1473887A2 (en) * 2003-04-29 2004-11-03 Alcatel Protection scheme for a communications network under multiple failures
US20050008014A1 (en) * 2003-07-07 2005-01-13 Debasis Mitra Techniques for network traffic engineering
CN1601966A (zh) * 2003-09-28 2005-03-30 华为技术有限公司 一种路由路径选择方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8953597B2 (en) 2008-03-27 2015-02-10 Futurewei Technolgies, Inc. Computing point-to-multipoint paths
CN101686170A (zh) * 2008-09-27 2010-03-31 重庆广用通信技术有限责任公司 基于多出口用户路由的分级传输品质保障系统

Also Published As

Publication number Publication date
EP1883181B1 (en) 2009-07-22
CN100454830C (zh) 2009-01-21
DE602006007983D1 (de) 2009-09-03
ATE437499T1 (de) 2009-08-15
EP1883181A4 (en) 2008-05-28
US20080151896A1 (en) 2008-06-26
US7978622B2 (en) 2011-07-12
EP1883181A1 (en) 2008-01-30
CN1866852A (zh) 2006-11-22

Similar Documents

Publication Publication Date Title
WO2006122506A1 (fr) Procede et appareil pour calculer un chemin d'acces dans un domaine de reseau
EP1885081B1 (en) Method, system and path computation element for processing distributed path computation requests
CN111865796B (zh) 用于网络业务的路径计算单元中央控制器(pcecc)
JP3923863B2 (ja) リクエストルータ装置
US8645546B2 (en) Cloud service control and management architecture expanded to interface the network stratum
CN101001200B (zh) 一种区域间流量工程全网计算方法及系统
US10637775B2 (en) Make-before-break mechanism for label switched paths
WO2007143904A1 (fr) Procédé et système de calcul de routes vers des domaines multiples
CN101036134A (zh) 用于域间te-lsp的rsvp-te中的路由信息的传播
JP2013510459A (ja) 分離的なパス計算アルゴリズム
US20190356586A1 (en) Elegant Temporal Label Switched Path Tunnel Service Controller
WO2012062091A1 (zh) 一种pce状态属性的自动识别方法及系统
US11677659B2 (en) Optimization of segment routing-enabled multipath network
EP3016328B1 (en) Path acquisition method, path computation element, path computation client and system
KR20140088173A (ko) 통신 네트워크에서 데이터 패킷의 신속한 데이터 흐름을 촉진하는 방법, 통신 네트워크 및 데이터 처리 유닛
US20140185607A1 (en) Communication system, communication path establishing method and management server
EP3099010B1 (en) Network path computation method, apparatus and system
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
WO2015024440A1 (zh) 一种获取ip链路的链路开销值的方法及系统
US20150071119A1 (en) Technique for Explicit Path Control
EP3020163B1 (en) Interworking between first protocol entity of stream reservation protocol and second protocol entity of routing protocol
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
WO2021052364A1 (zh) 业务路径的建立方法、装置、电子设备及可读存储介质
KR100912298B1 (ko) Mpls 기반 네트워크 시스템의 명시적 경로 관리를 위한중앙관리장치

Legal Events

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

Ref document number: 11914929

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

WWW Wipo information: withdrawn in national office

Country of ref document: DE

WWE Wipo information: entry into national phase

Ref document number: 2006741927

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: RU

WWW Wipo information: withdrawn in national office

Country of ref document: RU

WWP Wipo information: published in national office

Ref document number: 2006741927

Country of ref document: EP