WO2008031337A1 - A traffic engineering path computation method, a system and a path computation element - Google Patents

A traffic engineering path computation method, a system and a path computation element Download PDF

Info

Publication number
WO2008031337A1
WO2008031337A1 PCT/CN2007/070227 CN2007070227W WO2008031337A1 WO 2008031337 A1 WO2008031337 A1 WO 2008031337A1 CN 2007070227 W CN2007070227 W CN 2007070227W WO 2008031337 A1 WO2008031337 A1 WO 2008031337A1
Authority
WO
WIPO (PCT)
Prior art keywords
autonomous system
pce
address
path
path calculation
Prior art date
Application number
PCT/CN2007/070227
Other languages
French (fr)
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 WO2008031337A1 publication Critical patent/WO2008031337A1/en

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/02Topology update or discovery
    • H04L45/04Interdomain routing, e.g. hierarchical routing
    • 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

Definitions

  • the present invention relates to the field of network communication technologies, and in particular, to a method and system for calculating a traffic engineering path and a path computing device. Background of the invention
  • Traffic Engineering focuses on the optimization of overall network performance, measuring, modeling, describing and controlling network traffic according to certain principles to achieve specific performance goals.
  • the performance goal that traffic engineering wants to achieve is 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 of which is bandwidth resources. Effective use.
  • 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 of which is bandwidth resources.
  • GMPLS General Multiple Protocol Label Switch
  • Constraint-based Shortest Path First (CSPF) algorithm is an important part of traffic engineering.
  • the path calculation between Autonomous System (AS) is very complicated and may require calculation of different autonomous systems. Entities collaborate and work together.
  • the path calculation method based on the Path Computation Element (PCE) model can be applied to traffic engineering between different network domains. The calculation method does not affect the use of calculated paths, such as Label Switch Path (LSP). ) establishment, maintenance and demolition.
  • LSP Label Switch Path
  • the calculation request information is sent to the PCE, and the request information includes the destination of the path and various constraints.
  • the PCE calculates a path that satisfies the constraint condition in the request information according to the topology synchronized with the network and the Traffic Engineering Database (TED), and returns the response message to the response message.
  • PCC As an explicit path object (ERO) parameter for establishing an LSP, the foregoing calculation result may include an exact node and a loose node, where the precise node is a specific router, and the loose node is a network segment, or a region. Or an autonomous system.
  • the calculation range that a PCE is responsible for is generally an autonomous system. When the destination of the calculation request information is another autonomous system, PCE collaboration between different autonomous systems is required to complete the calculation of a path.
  • the PCE discovery protocol is responsible for discovering the existence and computing power of the PCE and transmitting corresponding information to the PCC that initiates the path calculation request, and the PCC selects an appropriate PCE according to the information sent by the protocol and sends a calculation request to the path calculation; PCE communication
  • the protocol is mainly responsible for transmitting calculation request and response information between the PCC and the PCE.
  • the calculation request message sent by the PCC to the PCE includes the unique identification number and various constraints of the current calculation. When a PCE calculation requires other PCEs. This communication protocol support is also required between PCEs when assisting.
  • PCE One of the main applications of PCE is to implement the calculation of MPLS TE paths between autonomous systems.
  • Each autonomous system is responsible for the path calculation within the autonomous system by its respective PCE.
  • the PCE in each autonomous system passes the calculation request and the result one by one through the PCE communication protocol.
  • FIG. 1 is a schematic diagram of establishing a TE path between two autonomous systems in the prior art.
  • AS 100 and AS 200 are two different autonomous systems.
  • Router A in AS 100 needs to establish a TE path to Router B in AS 200: Router A first sends a path calculation request to the path calculation device PCE1 in its AS 100; PCE1 receives the calculation. After the request, the request is passed to the AS through the PCE communication protocol.
  • Router A can establish a TE path from Router A to Router B through the communication signaling protocol.
  • the process when path computation needs to span more autonomous systems can be derived from the example shown in Figure 1, and will not be repeated here.
  • Different autonomous systems spanned by a TE path can belong to the same carrier or different operators.
  • the network topology between operators is considered for security reasons. Node information needs to be isolated.
  • the PCE2 when the PCE2 returns the calculation result to the PCE1, it includes the node of the AS 200 and part of the topology information, and the The information is not allowed to be obtained by Router A and is used as a parameter when establishing a path.
  • the explicit path object ERO parameter cannot contain the node information in the AS 200, but according to the current letter. Order the agreement, such a path cannot be established.
  • each PCE responsible for calculating the TE path across the autonomous system passes each of the calculated paths within the local autonomous system.
  • the node information is mapped to a path index, and the path index and its own address information are returned to the PCE in the upstream autonomous system as a calculation result, and the true calculation result, that is, the node information of the path in the local autonomous system is each
  • the PCE is stored locally, so that the local node information is not spread to other operators' networks.
  • the resource reservation protocol-based traffic reservation RSVP-TE
  • the address information of the path I and PCE is taken as the ERO parameter.
  • the first router in the next autonomous system that receives the message parses the ERO field to obtain the corresponding ETO.
  • the road will be The path index is sent to the PCE in the autonomous system, and the PCE is requested to return the stored node information corresponding to the path index; the router inserts the node information returned by the PCE into the ERO parameter of the signaling message, and executes in the local autonomous system.
  • the path is established until the signaling message established by the path is transmitted to the next autonomous system.
  • the above steps are also performed in the next autonomous system until the entire path is established.
  • the embodiment of the invention provides a method for calculating a traffic engineering path, which makes the PCE address not spread to all upstream autonomous systems during the path calculation process.
  • the embodiment of the invention provides a system for calculating a traffic engineering path, which makes the PCE address not spread to all upstream autonomous systems during the path calculation process.
  • the embodiment of the present invention further provides a PCE, which makes the PCE address not spread to all upstream autonomous systems during the path calculation process.
  • the embodiment of the invention discloses a method for calculating a traffic engineering path, the method comprising: calculating, by the path computing device PCE in the most downstream autonomous system where the destination node is located, the path in the local autonomous system, and saving the calculated local autonomous system The result of the path calculation is performed, and the calculated entry node address in the path calculation result in the local autonomous system is sent to the PCE in the neighboring upstream autonomous system;
  • the PCE in the intermediate autonomous system calculates the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system and the ingress node address and PCE address of the adjacent downstream autonomous system, and is adjacent to its own upstream autonomy. Calculated by PCE transmission in the system The entry node address in the path calculation result in the local autonomous system;
  • the PCE in the autonomous system where the client device is located calculates the path in the local autonomous system, and sends the calculated path calculation result in the local autonomous system and the ingress node address and PCE address of the neighboring downstream autonomous system to the client device. .
  • the embodiment of the invention discloses a system for calculating a traffic engineering path, the system comprising: a client device, a PCE in an autonomous system where the client device is located, a PCE in the most downstream autonomous system where the destination node is located, and an inter-autonomous system PCE, where,
  • the PCE in the most downstream autonomous system is used to calculate the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system, and sends the calculated local autonomous system to the PCE in its neighboring upstream autonomous system.
  • the entry node address in the path calculation result; the PCE in the intermediate autonomous system is used to calculate the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system and the PCE in the adjacent downstream autonomous system.
  • the address and the ingress node address are sent to the PCE in the neighboring upstream autonomous system to calculate the ingress node address in the path calculation result in the local autonomous system;
  • the PCE in the autonomous system where the client device is located is used to calculate the path in the local autonomous system, and sends the calculated path calculation result in the local autonomous system and the PCE address in the adjacent downstream autonomous system to the client device.
  • Ingress node address
  • the client device is configured to receive information returned by the PCE in the autonomous system.
  • the embodiment of the invention discloses a path computing device PCE, which includes a main processing module and a storage module, wherein
  • the main processing module is used to:
  • the path calculation request message carrying the destination node address and the identification sequence number
  • determining whether the destination node is in the local autonomous system, and if so, calculating the path in the local autonomous system, and calculating the calculated internal The path calculation result and the identification sequence number are sent to the storage module, and the calculated internal Autonomous System is sent to the PCE in the adjacent upstream autonomous system.
  • the path in the local autonomous system is calculated, and it is determined whether the client device that initiates the path calculation request message is in the local autonomous system, if If yes, the calculated path calculation result in the local autonomous system and the PCE address and the ingress node address in the adjacent downstream autonomous system are returned to the client device; otherwise, the calculated path calculation result in the local autonomous system is calculated.
  • the identification sequence number, the PCE address and the ingress node address in the adjacent downstream autonomous system are sent to the storage module, and the identification number and the calculated path calculation result in the local autonomous system are returned to the PCE in the adjacent upstream autonomous system.
  • Ingress node address in is sent to the storage module, and the identification number and the calculated path calculation result in the local autonomous system are returned to the PCE in the adjacent upstream autonomous system.
  • a storage module configured to save information sent by the main processing module.
  • the path computing device PCE saves the path calculation result in the local autonomous system and the path computing device address and the ingress node address in the adjacent downstream autonomous system in the calculation process of the traffic engineering path.
  • Local and only inform the neighboring upstream autonomous system of its own address and the ingress node address in the local autonomous system, so that the PCE address in an autonomous system is limited to be known by the adjacent upstream autonomous system, and does not spread to all upstream autonomous In the system.
  • FIG. 1 is a schematic diagram of establishing a TE path between two autonomous systems in the prior art
  • FIG. 2 is a flowchart of a method for calculating a TE path according to an embodiment of the present invention
  • FIG. 3 is a flow chart of establishing a TE path according to the TE path calculated in FIG. 2 according to an embodiment of the present invention
  • FIG. 4 is a schematic diagram of a scenario for calculating a TE path and establishing a TE path according to an embodiment of the present invention
  • FIG. 5 is a structural block diagram of a system for calculating a traffic engineering path according to an embodiment of the present invention.
  • FIG. 6 is a structural block diagram of a PCE according to an embodiment of the present invention. Mode for carrying out the invention
  • FIG. 2 is a flow chart of a method for calculating a TE path according to an embodiment of the present invention. As shown in Figure 2, the following steps are included:
  • Step 201 The path calculation device PCE in the most downstream autonomous system where the destination node is located calculates the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system to the PCE in the neighboring upstream autonomous system.
  • the calculated entry node address in the calculated path calculation result in the local autonomous system is not limited to the path calculation device PCE in the most downstream autonomous system.
  • Step 202 The PCE in the intermediate autonomous system calculates a path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system and the ingress node address and the PCE address of the neighboring downstream autonomous system to the self.
  • the PCE in the neighboring upstream autonomous system transmits the calculated ingress node address in the path calculation result in the local autonomous system.
  • the intermediate autonomous system is an autonomous system that passes from the autonomous system where the client device is located to the autonomous system where the destination node is located.
  • Step 203 The PCE in the autonomous system where the PCC is located calculates a path in the local autonomous system, and sends the calculated path calculation result in the local autonomous system and the ingress node address and the PCE address of the neighboring downstream autonomous system to the PCC.
  • the address information of the PCE is limited to be known by the adjacent upstream autonomous system, and is not spread to all upstream autonomous systems.
  • FIG. 3 is a flow chart of establishing a TE path according to the TE path calculated in FIG. 2 according to an embodiment of the present invention. As shown in Figure 3, the following steps are included:
  • Step 301 The PCC establishes a path in the local autonomous system according to the received path calculation result.
  • the path sends the received PCE address to the ingress node indicated by the received ingress node address.
  • Step 302 The ingress node in the intermediate autonomous system obtains the path calculation result, the PCE address and the ingress node address in the adjacent downstream autonomous system from the PCE indicated by the received PCE address, and establishes the autonomy according to the obtained path calculation result.
  • the path in the system sends the acquired PCE address to the ingress node indicated by the acquired ingress node address.
  • Step 303 The ingress node in the most downstream autonomous system acquires a path calculation result from the PCE indicated by the received PCE address, and establishes a path in the local autonomous system according to the obtained path calculation result.
  • FIG. 4 is a schematic diagram of a scenario for calculating a TE path and establishing a TE path according to an embodiment of the present invention.
  • the client device PCC located in the autonomous system AS 300 needs to establish a path to the node R5 in the autonomous system AS 500.
  • the PCC first sends a path calculation request message to the PCE3 in the autonomous system AS 300.
  • the path request message carries the address of the destination node R5 and the identification number X of the path calculation.
  • the PCC initiates the path calculation request for a variety of reasons. For example, after receiving a packet and parsing it, it finds that there is no forwarding path for storing the destination address of the packet, or that a fixed channel needs to be established for a certain service, and PCC Before the path calculation request message is sent, a unique identifier sequence number is assigned to the calculation. In this embodiment, the identifier sequence number is X.
  • PCE3 After receiving the path calculation request message, PCE3 finds that R5 is located in AS 600, and must reach AS 500 through Autonomous System AS 400, and then forward the path calculation request message to PCE4 in AS 400, also in AS 400. The PCE 4 in turn forwards the path computation request message to the PCE 5 in the AS 500.
  • PCE5 receives the path calculation request message After that, the TE path R4-R5 in the AS 500 is calculated, the identification number X and the calculated path R4-R5 are locally saved, and then the calculated entry in the TE path R4-R5 in the AS 500 is returned to the PCE4. The address of the node R4 and the identification number X.
  • the PCE4 After receiving the address and the identification number X of the ingress node R4 sent by the PCE5, the PCE4 calculates the TE path R2-R3 in the AS 400, and locally stores the calculated identification number X, R4 address, the address of the PCE5, and the calculated The path R2-R3 then returns to PCE3 the calculated address and identification number X of the ingress node R2 in the TE path R2-R3 within the AS 400. After receiving the address of the ingress node R2 and the identification number X sent by the PCE4, the PCE3 determines that it and the client PCC are located in the same AS 300, and after calculating the TE path PCC-R1 in the AS 300, the calculation result is obtained.
  • the PCE discovery protocol is responsible for discovering the existence and computing power of the PCE and transmitting corresponding information to the PCC that initiates the path calculation request, and the PCC selects an appropriate PCE according to the information sent by the protocol and The transmission path is calculated, these are prior art and will not be described in detail here.
  • the TE path establishment process is: After receiving the path calculation result in the AS 300 returned by the PCE3 and the address of the ingress node R2 and the address of the PCE4 in the AS 400, the PCC initiates path establishment signaling by using a signaling protocol.
  • the message, the ERO parameter of the message includes the path calculation result in the AS 300, the address of the ingress node R2 in the AS 400, the address of the PCE4, and the identification number X.
  • the path establishment signaling message arrives at the ingress node R2 in the AS 400 indicated in the ERO after establishing a path in the AS 300 according to the path calculation result in its own ERO.
  • R2 sends a query request message including the identification number X to the PCE 4 according to the address of the PCE 4 included in the path establishment signaling message.
  • the PCE4 After receiving the inquiry request message, the PCE4 returns the path calculation result R2-R3 corresponding to the identification number X and the saved R4 to R2.
  • R2 inserts the path calculation results R2-R3 and the address of R4 and the address of PCE5 returned by PCE4 into the ERO parameters of the path establishment signaling message.
  • the path establishment signaling message arrives at the ingress node R4 in the AS 500 indicated in the ERO according to the path calculation result R2-R3 in the ERO after establishing the path in the AS 400.
  • R4 sends a query request message including the identification number X to the PCE 5 according to the address of the PCE5 included in the path establishment signaling message.
  • the PCE 5 After receiving the inquiry request message, the PCE 5 returns the path calculation result R4-R5 corresponding to the identification number X to R4.
  • R4 inserts the path calculation result R4-R5 returned by PCE5 into the ERO parameter of the path establishment signaling message.
  • the path establishment signaling message establishes a path within the AS 500 based on the path calculation result R4-R5 in its own ERO. At this point, the establishment process of the TE path from PCC to R5 is completed.
  • FIG. 5 is a block diagram showing the structure of a system for calculating a traffic engineering path according to an embodiment of the present invention.
  • the system includes: PCC, PCE in the autonomous system where the PCC is located, PCE in the most downstream autonomous system where the destination node is located, and PCE in the intermediate autonomous system.
  • the intermediate autonomous system refers to an autonomous system through which the path between the PCC and the destination node passes, except for the autonomous system in which the PCC is located in the autonomous system and the destination node.
  • the AS 400 in FIG. 4 is an intermediate autonomous system.
  • the PCC is configured to send a path calculation request message to the PCE in the autonomous system, where the destination node address and the identification number of the current path calculation are carried; and the message for receiving the return of the PCE in the autonomous system is received.
  • the PCE in the autonomous system in which the PCC is located is used to forward the path calculation request message to the PCE of the neighboring downstream autonomous system; and to receive the neighboring downstream of the PCE returned by the neighboring downstream autonomous system.
  • the ingress node address in the autonomous system calculate the path in the local autonomous system, and return the path calculation result in the autonomous system to the PCC, the address of the PCE in its neighboring downstream autonomous system, and the neighboring downstream autonomous system.
  • the address of the ingress node is configured to forward to the PCE of the neighboring downstream autonomous system after receiving the path calculation request message, and is used to receive the neighboring downstream autonomy of the PCE returned by the neighboring downstream autonomous system.
  • the ingress node address in the system calculate the path in the local autonomous system, save the path calculation result in the autonomous system, the identification sequence number, the address of the PCE in its neighboring downstream autonomous system, and the entry in its neighboring downstream autonomous system.
  • the address of the node returns the identification sequence number and the entry node address in the path calculation result in the local autonomous system to the PCE in the neighboring upstream autonomous system.
  • the PCE in the most downstream autonomous system is configured to calculate a path in the local autonomous system after receiving the path calculation request message sent by the PCE in the neighboring upstream autonomous system, and save the path calculation result in the local autonomous system and the The serial number is identified, and the identification number and the entry node address in the path calculation result in the local autonomous system are returned to the PCE in the neighboring upstream autonomous system.
  • the number of PCEs in the intermediate autonomous system can be arbitrary, and the case in Fig. 5 is given when there is only one PCE in the intermediate autonomous system.
  • the system shown in Figure 5 further includes: an ingress node in the intermediate autonomous system and an ingress node in the most downstream autonomous system for participating in the establishment of the TE path.
  • the PCC when establishing a TE path, is configured to establish a path in the local autonomous system according to the received path calculation result in the local autonomous system, and according to the received address of the ingress node in the adjacent downstream autonomous system. And sending the identification sequence number and the received address of the PCE in the neighboring downstream autonomous system to the ingress node in the neighboring downstream autonomous system.
  • the ingress node in the intermediate autonomous system is configured to obtain, according to the received PCE address and the identification sequence number, the path calculation result corresponding to the identification sequence number from the PCE in the local autonomous system, and the neighboring downstream autonomous system.
  • the address of the PCE and the address of the ingress node in its neighboring downstream autonomous system based on the obtained path calculation result.
  • a path in the autonomous system and sending the identification sequence number and the acquired address of the PCE in the neighboring downstream autonomous system to the neighboring downstream according to the obtained address of the ingress node in the neighboring downstream autonomous system.
  • the ingress node in the most downstream autonomous system obtains the path calculation result corresponding to the identification sequence number from the PCE in the local autonomous system according to the received path, when the TE path is established, according to the received PCE address and the identification sequence number, according to the acquired path.
  • the calculation results establish the path within the autonomous system.
  • FIG. 6 is a structural block diagram of a PCE according to an embodiment of the present invention.
  • the PCE includes a main processing module 601, a storage module 602, and a query module 603 as shown in FIG.
  • the main processing module 601 is configured to: when receiving the path calculation request message carrying the destination node address and the identification sequence number, determine whether the destination node is in the local autonomous system, and if yes, calculate the path in the local autonomous system. And sending the path calculation result and the identification sequence number in the local autonomous system to the storage module 602, and sending the entry node address and the identification sequence number in the path calculation result in the local autonomous system to the PCE in the adjacent upstream autonomous system; otherwise, The path calculation request message is forwarded to the PCE in the adjacent downstream autonomous system.
  • the main processing module 601 is further configured to: when receiving the ingress node address and the identification sequence number in the path calculation result in the adjacent downstream autonomous system sent by the PCE in the adjacent downstream autonomous system, determine whether the PCC that initiates the path calculation request message is In the autonomous system, if yes, the path in the local autonomous system is calculated, and the path calculation result in the local autonomous system, the address of the PCE in the adjacent downstream autonomous system, and the neighboring downstream autonomous system are returned to the PCC.
  • the address of the ingress node otherwise, calculate the path in the local autonomous system, calculate the path result in the local autonomous system, the identification sequence number, the address of the PCE in the adjacent downstream autonomous system, and the address of the ingress node in the adjacent downstream autonomous system.
  • the method is sent to the storage module 602, and returns the identification sequence number and the entry node address in the path calculation result in the local autonomous system to the PCE in the neighboring upstream autonomous system.
  • the storage module 602 is configured to save information sent by the main processing module 601.
  • the querying module 603 is configured to query, from the storage module 602, information corresponding to the identification sequence number to the ingress node when receiving the query request that includes the identification sequence number sent by the ingress node in the autonomous system.
  • each PCE saves the path calculation result in the local autonomous system and the PCE address and the ingress node address in the adjacent downstream autonomous system locally.
  • the technical solution of only informing the neighboring upstream autonomous system of its own address and the address of the ingress node in the autonomous system makes the address of the PCE in an autonomous system limited to be known by the adjacent upstream autonomous system, and does not spread to all. In the upstream autonomous system, the security of the PCE address is effectively improved.

Landscapes

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

Abstract

A traffic engineering path computation method, a system and a path computation element. By using the technical solution that a path computation element locally saves the path computation result in the own autonomous system and the entry node address and the path computation element address in the neighbored downstream autonomous system, and informs the neighbored upstream autonomous system of nothing but the address of itself and the entry node address of the own autonomous system during the traffic engineering path computation process, the address of the path computation element in one autonomous system is known only by the neighbored upstream autonomous system, and doesn't be spread to all the upstream autonomous systems.

Description

计算流量工程路径的方法和系统以及路径计算设备  Method and system for calculating traffic engineering path and path computing device
技术领域 Technical field
本发明涉及网络通信技术领域, 尤其涉及一种计算流量工程路径的 方法和系统以及一种路径计算设备。 发明背景  The present invention relates to the field of network communication technologies, and in particular, to a method and system for calculating a traffic engineering path and a path computing device. Background of the invention
流量工程(Traffic Engineering, TE )关注网络整体性能的优化, 根 据一定的原则对网络流量进行测量、 建模、 描述和控制, 以达到特定的 性能目标。 流量工程想要达到的性能目标分为两个层面: 一是面向流量 的, 即关注如何提高网络的服务质量; 二是面向资源的, 即关注如何优 化网络资源的使用, 其中最主要是带宽资源的有效利用。 随着网络技术 的不断发展和通用多协议标签交换 ( GMPLS , General Multiple Protocol Label Switch )技术的成熟, 域间流量工程将涵盖 GMPLS网络, 并跨越 不同的运营商网络。  Traffic Engineering (TE) focuses on the optimization of overall network performance, measuring, modeling, describing and controlling network traffic according to certain principles to achieve specific performance goals. The performance goal that traffic engineering wants to achieve is 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 of which is bandwidth resources. Effective use. With the continuous development of network technologies and the mature technology of General Multiple Protocol Label Switch (GMPLS), inter-domain traffic engineering will cover GMPLS networks and span different carrier networks.
基于约束的最短路径优先 ( Constraint-based Shortest Path First, CSPF )算法是流量工程的重要组成部分, 其在多自治系统( Autonomous System, AS ) 间的路径计算非常复杂, 可能需要不同自治系统的计算实 体相互协作, 共同完成。 基于路径计算设备 ( Path Computation Element , PCE )模型的路径计算方法可以应用于不同网域间的流量工程, 该计算 方法并不影响计算出来的路径的使用, 如标签交换路径 ( Label switch Path, LSP ) 的建立, 维护和拆除。  Constraint-based Shortest Path First (CSPF) algorithm is an important part of traffic engineering. The path calculation between Autonomous System (AS) is very complicated and may require calculation of different autonomous systems. Entities collaborate and work together. The path calculation method based on the Path Computation Element (PCE) model can be applied to traffic engineering between different network domains. The calculation method does not affect the use of calculated paths, such as Label Switch Path (LSP). ) establishment, maintenance and demolition.
在基于 PCE模型的路径计算方法中, 请求路径计算的客户端设备 ( PCC, Path Computation Client )需要建立 LSP路径时, 发送计算请求 信息给 PCE, 计算请求信息中含有路径的目的地和各种约束条件等基本 信息; PCE接收到请求信息后, 根据与网络同步的拓朴以及流量工程数 据库(Traffic Engineering Database, TED )等信息, 计算出满足该请求 信息中的约束条件的路径, 并通过响应报文返回给 PCC。 作为建立 LSP 的显式路径对象( Explicit Route Object, ERO )参数, 上述计算结果中可 以含有精确节点和松散节点, 其中, 精确节点是一个具体的路由器, 松 散节点是一个网段, 或一个区域, 或一个自治系统。 一个 PCE负责的计 算范围一般是一个自治系统, 当计算请求信息的目的地是另外一个自治 系统时, 则需要不同的自治系统间的 PCE协作, 来完成一条路径的计算。 In the path calculation method based on the PCE model, when the client device (PCC, Path Computation Client) requesting the path calculation needs to establish an LSP path, the calculation request information is sent to the PCE, and the request information includes the destination of the path and various constraints. Basic conditions After receiving the request information, the PCE calculates a path that satisfies the constraint condition in the request information according to the topology synchronized with the network and the Traffic Engineering Database (TED), and returns the response message to the response message. PCC. As an explicit path object (ERO) parameter for establishing an LSP, the foregoing calculation result may include an exact node and a loose node, where the precise node is a specific router, and the loose node is a network segment, or a region. Or an autonomous system. The calculation range that a PCE is responsible for is generally an autonomous system. When the destination of the calculation request information is another autonomous system, PCE collaboration between different autonomous systems is required to complete the calculation of a path.
在基于 PCE模型的路径计算方法中, 有两个基本协议: PCE发现协 议和 PCE通信协议。 其中, PCE发现协议负责发现 PCE的存在和计算能 力并向发起路径计算请求的 PCC发送相应的信息, PCC根据该协议发送 的信息, 选择合适的 PCE并向其发送计算请求进行路径计算; PCE通信 协议,主要负责在 PCC和 PCE之间传送计算请求和响应信息, PCC向 PCE 发送的计算请求消息中, 包含本次计算的唯一标识序号及各种约束条 件, 当某一 PCE的计算需要其他 PCE进行协助时, 各 PCE之间也需要该 通信协议支持。  In the path calculation method based on the PCE model, there are two basic protocols: the PCE discovery protocol and the PCE communication protocol. The PCE discovery protocol is responsible for discovering the existence and computing power of the PCE and transmitting corresponding information to the PCC that initiates the path calculation request, and the PCC selects an appropriate PCE according to the information sent by the protocol and sends a calculation request to the path calculation; PCE communication The protocol is mainly responsible for transmitting calculation request and response information between the PCC and the PCE. The calculation request message sent by the PCC to the PCE includes the unique identification number and various constraints of the current calculation. When a PCE calculation requires other PCEs. This communication protocol support is also required between PCEs when assisting.
PCE的主要应用之一就是实现自治系统间的 MPLS TE路径的计算。 每个自治系统都由各自的 PCE负责该自治系统内的路径计算。 当一条路 径需要跨越多个自治系统时, 各个自治系统内的 PCE通过 PCE通信协议 将计算请求和结果逐一传递。  One of the main applications of PCE is to implement the calculation of MPLS TE paths between autonomous systems. Each autonomous system is responsible for the path calculation within the autonomous system by its respective PCE. When a path needs to span multiple autonomous systems, the PCE in each autonomous system passes the calculation request and the result one by one through the PCE communication protocol.
图 1是现有技术中跨越两个自治系统间建立 TE路径的示意图。如图 1 所示, AS 100和 AS 200为两个不同的自治系统。 当 AS 100内的路由器 Router A 需要建立一条 TE路径到 AS 200内的路由器 Router B时: Router A首先向其所在的自治系统 AS 100内的路径计算设备 PCE1发送路径计 算请求; PCE1收到该计算请求后,将该请求通过 PCE通信协议传递到 AS 200内的 PCE2; PCE2计算所有从 AS 100到达 Router B的路径, 并将结果 通过 PCE通信协议返回给 PCE1 ; PCE1根据 PCE2返回的结果, 计算所有 从 Router A 到达 Router B的路径, 并从中选择一条最优的路径通过 PCE 通信协议返回给 Router A; 此时, Router A就可以通过通信信令协议建 立从 Router A到 Router B的 TE路径。 当路径计算需要跨越更多的自治系 统时的处理过程可以从图 1所示的例子推出来, 这里不再复述。 FIG. 1 is a schematic diagram of establishing a TE path between two autonomous systems in the prior art. As shown in Figure 1, AS 100 and AS 200 are two different autonomous systems. When Router A in AS 100 needs to establish a TE path to Router B in AS 200: Router A first sends a path calculation request to the path calculation device PCE1 in its AS 100; PCE1 receives the calculation. After the request, the request is passed to the AS through the PCE communication protocol. PCE2 in 200; PCE2 calculates all paths from AS 100 to Router B, and returns the result to PCE1 through PCE communication protocol; PCE1 calculates all paths from Router A to Router B based on the result returned by PCE2, and selects one from it. The optimal path is returned to Router A through the PCE communication protocol. At this time, Router A can establish a TE path from Router A to Router B through the communication signaling protocol. The process when path computation needs to span more autonomous systems can be derived from the example shown in Figure 1, and will not be repeated here.
一条 TE路径所跨越的不同自治系统既可以属于同一个运营商,也可 以属于不同的运营商, 当跨越不同运营商的自治系统时, 出于安全性考 虑, 运营商之间的网络拓朴和节点信息需要隔离。 但在图 1中, 如果 AS 100和 AS 200分属于不同的运营商, 则在上述的计算过程中, PCE2将计 算结果返回给 PCE1时, 其中含有 AS 200的节点和部分拓朴信息, 而该信 息不允许被 Router A获得并作为建立路径时的参数,此时, Router A在通 过信令协议建立路径时其显式路径对象 ERO参数中不能包含 AS 200内 的节点信息, 但按照目前的信令协议, 这样的路径是无法建立的。  Different autonomous systems spanned by a TE path can belong to the same carrier or different operators. When crossing the autonomous systems of different operators, the network topology between operators is considered for security reasons. Node information needs to be isolated. However, in FIG. 1, if the AS 100 and the AS 200 belong to different operators, in the above calculation process, when the PCE2 returns the calculation result to the PCE1, it includes the node of the AS 200 and part of the topology information, and the The information is not allowed to be obtained by Router A and is used as a parameter when establishing a path. In this case, when the router A establishes a path through the signaling protocol, the explicit path object ERO parameter cannot contain the node information in the AS 200, but according to the current letter. Order the agreement, such a path cannot be established.
为了解决上述问题, IETF标准组织提出了一种 PKS ( Path Key Solution ) 方案, 在该方案中: 负责计算跨自治系统 TE路径的每个 PCE 都把各自计算出的本自治系统内的路径经过的节点信息映射为一个路 径索引, 并将该路径索引以及自身的地址信息作为计算结果返回给上游 自治系统中的 PCE, 而真正的计算结果, 即本自治系统内的路径经过的 节点信息被每个 PCE保存在本地, 从而保证了本地节点信息不被扩散到 其他运营商的网络中去; 在建立路径的时候, 基于流量工程的资源预留 十办议 ( Resource Reservation Protocol - Traffic Engineering, RSVP-TE )以 路径索弓 I和 PCE的地址信息作为 ERO参数, 当路径建立的信令消息到达 下一个自治系统时, 下一个自治系统中第一个接收该消息的路由器, 解 析 ERO字段获得对应于本自治系统的 PCE地址和路径索引信息后, 将路 径索引发送到本自治系统中的 PCE , 并请求该 PCE返回其存储的与路径 索引对应的节点信息; 该路由器将 PCE返回的节点信息插入信令消息的 ERO参数中, 执行在本自治系统中的路径建立, 直到该路径建立的信令 消息报文传送到下一个自治系统。 以此类推, 在下一个自治系统同样执 行上述步骤, 直到整条路径建立为止。 In order to solve the above problem, the IETF standards organization proposes a PKS (Path Key Solution) scheme, in which: each PCE responsible for calculating the TE path across the autonomous system passes each of the calculated paths within the local autonomous system. The node information is mapped to a path index, and the path index and its own address information are returned to the PCE in the upstream autonomous system as a calculation result, and the true calculation result, that is, the node information of the path in the local autonomous system is each The PCE is stored locally, so that the local node information is not spread to other operators' networks. When the path is established, the resource reservation protocol-based traffic reservation (RSVP-TE) The address information of the path I and PCE is taken as the ERO parameter. When the signaling message established by the path reaches the next autonomous system, the first router in the next autonomous system that receives the message parses the ERO field to obtain the corresponding ETO. After the PCE address and path index information of the autonomous system, the road will be The path index is sent to the PCE in the autonomous system, and the PCE is requested to return the stored node information corresponding to the path index; the router inserts the node information returned by the PCE into the ERO parameter of the signaling message, and executes in the local autonomous system. The path is established until the signaling message established by the path is transmitted to the next autonomous system. By analogy, the above steps are also performed in the next autonomous system until the entire path is established.
但发明人在实现本发明的过程中, 发现在上述的 PKS方案中, 虽然 将计算结果在自治系统间进行了隔离, 但是却将 PCE地址信息扩散到了 所有上游自治系统。 发明内容  However, in the process of implementing the present invention, the inventors found that in the above PKS scheme, although the calculation results are isolated among the autonomous systems, the PCE address information is spread to all upstream autonomous systems. Summary of the invention
本发明实施例提供了一种计算流量工程路径的方法, 该方法使得在 路径计算过程中, PCE地址不会扩散到所有上游自治系统中。  The embodiment of the invention provides a method for calculating a traffic engineering path, which makes the PCE address not spread to all upstream autonomous systems during the path calculation process.
本发明实施例提供了一种计算流量工程路径的系统, 该系统使得在 路径计算过程中, PCE地址不会扩散到所有上游自治系统中。  The embodiment of the invention provides a system for calculating a traffic engineering path, which makes the PCE address not spread to all upstream autonomous systems during the path calculation process.
本发明实施例还提供了一种 PCE, 该 PCE使得在路径计算过程中, PCE地址不会扩散到所有上游自治系统中。  The embodiment of the present invention further provides a PCE, which makes the PCE address not spread to all upstream autonomous systems during the path calculation process.
为达到上述目的, 本发明的技术方案具体是这样实现的:  In order to achieve the above object, the technical solution of the present invention is specifically implemented as follows:
本发明实施例公开了一种计算流量工程路径的方法, 该方法包括: 目的节点所在的最下游自治系统中的路径计算设备 PCE计算本自 治系统内的路径, 并保存所计算出的本自治系统内的路径计算结果, 向 自身相邻上游自治系统中 PCE发送所计算出的本自治系统内的路径计 算结果中的入口节点地址;  The embodiment of the invention discloses a method for calculating a traffic engineering path, the method comprising: calculating, by the path computing device PCE in the most downstream autonomous system where the destination node is located, the path in the local autonomous system, and saving the calculated local autonomous system The result of the path calculation is performed, and the calculated entry node address in the path calculation result in the local autonomous system is sent to the PCE in the neighboring upstream autonomous system;
中间自治系统中的 PCE, 计算本自治系统内的路径, 并保存所计算 出的本自治系统内的路径计算结果以及自身相邻下游自治系统的入口 节点地址和 PCE地址, 向自身相邻上游自治系统中 PCE发送所计算出 的本自治系统内的路径计算结果中的入口节点地址; The PCE in the intermediate autonomous system calculates the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system and the ingress node address and PCE address of the adjacent downstream autonomous system, and is adjacent to its own upstream autonomy. Calculated by PCE transmission in the system The entry node address in the path calculation result in the local autonomous system;
客户端设备所在自治系统中的 PCE, 计算本自治系统内的路径, 并 向客户端设备发送所计算出的本自治系统内的路径计算结果以及自身 相邻下游自治系统的入口节点地址和 PCE地址。  The PCE in the autonomous system where the client device is located calculates the path in the local autonomous system, and sends the calculated path calculation result in the local autonomous system and the ingress node address and PCE address of the neighboring downstream autonomous system to the client device. .
本发明实施例公开了一种计算流量工程路径的系统, 该系统包括: 客户端设备, 客户端设备所在自治系统中的 PCE, 目的节点所在的最下 游自治系统中的 PCE , 间自治系统中的 PCE, 其中,  The embodiment of the invention discloses a system for calculating a traffic engineering path, the system comprising: a client device, a PCE in an autonomous system where the client device is located, a PCE in the most downstream autonomous system where the destination node is located, and an inter-autonomous system PCE, where,
最下游自治系统中的 PCE, 用于计算本自治系统内的路径, 并保存 所计算出的本自治系统内的路径计算结果, 向自身相邻上游自治系统中 PCE发送所计算出的本自治系统内的路径计算结果中的入口节地址; 中间自治系统中的 PCE, 用于计算本自治系统内的路径, 并保存所 计算出的本自治系统内的路径计算结果以及相邻下游自治系统中 PCE 地址和入口节点地址,向自身相邻上游自治系统中 PCE发送所计算出的 本自治系统内的路径计算结果中的入口节点地址;  The PCE in the most downstream autonomous system is used to calculate the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system, and sends the calculated local autonomous system to the PCE in its neighboring upstream autonomous system. The entry node address in the path calculation result; the PCE in the intermediate autonomous system is used to calculate the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system and the PCE in the adjacent downstream autonomous system. The address and the ingress node address are sent to the PCE in the neighboring upstream autonomous system to calculate the ingress node address in the path calculation result in the local autonomous system;
客户端设备所在自治系统中的 PCE,用于计算本自治系统内的路径, 并向客户端设备发送所计算出的本自治系统内的路径计算结果以及自 身相邻下游自治系统中的 PCE地址和入口节点地址;  The PCE in the autonomous system where the client device is located is used to calculate the path in the local autonomous system, and sends the calculated path calculation result in the local autonomous system and the PCE address in the adjacent downstream autonomous system to the client device. Ingress node address;
客户端设备, 用于接收本自治系统中的 PCE返回的信息。  The client device is configured to receive information returned by the PCE in the autonomous system.
本发明实施例公开了一种路径计算设备 PCE,该 PCE包括主处理模 块和存储模块, 其中,  The embodiment of the invention discloses a path computing device PCE, which includes a main processing module and a storage module, wherein
主处理模块用于:  The main processing module is used to:
在接收到携带目的节点地址和标识序号的路径计算请求消息时, 判 断目的节点是否在本自治系统中,如果是,则计算本自治系统内的路径, 并将所计算出的本自治系统内的路径计算结果和所述标识序号发送到 存储模块,向相邻上游自治系统中的 PCE发送所计算出的本自治系统内 的路径计算结果中的入口节点地址和标识序号; 否则, 将路径计算请求 消息转发给相邻下游自治系统中 PCE; When receiving the path calculation request message carrying the destination node address and the identification sequence number, determining whether the destination node is in the local autonomous system, and if so, calculating the path in the local autonomous system, and calculating the calculated internal The path calculation result and the identification sequence number are sent to the storage module, and the calculated internal Autonomous System is sent to the PCE in the adjacent upstream autonomous system. The path of the entry node and the identification sequence number in the path calculation result; otherwise, the path calculation request message is forwarded to the PCE in the adjacent downstream autonomous system;
在接收到相邻下游 PCE发送的相邻下游治系统内的入口节点地址 和标识序号时, 计算本自治系统内的路径, 判断发起路径计算请求消息 的客户端设备是否在本自治系统中, 如果是, 则向客户端设备返回所计 算出的本自治系统内的路径计算结果以及相邻下游自治系统中的 PCE 地址和入口节点地址; 否则, 将所计算出的本自治系统内的路径计算结 果、所述标识序号、相邻下游自治系统中 PCE地址和入口节点地址发送 到存储模块,向其相邻上游自治系统中 PCE返回所述标识序号和所计算 出的本自治系统内的路径计算结果中的入口节点地址;  When the ingress node address and the identification sequence number in the neighboring downstream system sent by the neighboring downstream PCE are received, the path in the local autonomous system is calculated, and it is determined whether the client device that initiates the path calculation request message is in the local autonomous system, if If yes, the calculated path calculation result in the local autonomous system and the PCE address and the ingress node address in the adjacent downstream autonomous system are returned to the client device; otherwise, the calculated path calculation result in the local autonomous system is calculated. The identification sequence number, the PCE address and the ingress node address in the adjacent downstream autonomous system are sent to the storage module, and the identification number and the calculated path calculation result in the local autonomous system are returned to the PCE in the adjacent upstream autonomous system. Ingress node address in ;
存储模块, 用于保存所述主处理模块发送的信息。  a storage module, configured to save information sent by the main processing module.
由上述技术方案可见, 本发明实施例在流量工程路径的计算过程 中,路径计算设备 PCE将本自治系统中的路径计算结果以及相邻下游自 治系统中的路径计算设备地址和入口节点地址保存在本地, 而只向相邻 上游自治系统告知自身的地址和本自治系统中入口节点地址, 使得一个 自治系统中的 PCE地址只限于被相邻上游自治系统所知,而不会扩散到 所有上游自治系统中。 附图简要说明  It can be seen from the foregoing technical solution that, in the calculation process of the traffic engineering path, the path computing device PCE saves the path calculation result in the local autonomous system and the path computing device address and the ingress node address in the adjacent downstream autonomous system in the calculation process of the traffic engineering path. Local, and only inform the neighboring upstream autonomous system of its own address and the ingress node address in the local autonomous system, so that the PCE address in an autonomous system is limited to be known by the adjacent upstream autonomous system, and does not spread to all upstream autonomous In the system. BRIEF DESCRIPTION OF THE DRAWINGS
图 1是现有技术中跨越两个自治系统间建立 TE路径的示意图; 图 2是本发明实施例一种计算 TE路径的方法的流程图;  1 is a schematic diagram of establishing a TE path between two autonomous systems in the prior art; FIG. 2 is a flowchart of a method for calculating a TE path according to an embodiment of the present invention;
图 3是本发明实施例根据图 2所计算出的 TE路径建立 TE路径的流 程图;  3 is a flow chart of establishing a TE path according to the TE path calculated in FIG. 2 according to an embodiment of the present invention;
图 4是本发明实施例计算 TE路径以及建立 TE路径的场景示意图; 图 5 是本发明实施例一种计算流量工程路径的系统的组成结构框 图; 4 is a schematic diagram of a scenario for calculating a TE path and establishing a TE path according to an embodiment of the present invention; FIG. 5 is a structural block diagram of a system for calculating a traffic engineering path according to an embodiment of the present invention; Figure
图 6是本发明实施例一种 PCE的结构框图。 实施本发明的方式  FIG. 6 is a structural block diagram of a PCE according to an embodiment of the present invention. Mode for carrying out the invention
图 2是本发明实施例一种计算 TE路径的方法的流程图。 如图 2所 示, 包括以下步骤:  2 is a flow chart of a method for calculating a TE path according to an embodiment of the present invention. As shown in Figure 2, the following steps are included:
步骤 201 , 目的节点所在的最下游自治系统中的路径计算设备 PCE 计算本自治系统内的路径, 并保存所计算出的本自治系统内的路径计算 结果,向自身相邻上游自治系统中的 PCE发送所计算出的本自治系统内 的路径计算结果中的入口节点地址。  Step 201: The path calculation device PCE in the most downstream autonomous system where the destination node is located calculates the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system to the PCE in the neighboring upstream autonomous system. The calculated entry node address in the calculated path calculation result in the local autonomous system.
步骤 202, 中间自治系统中的 PCE, 计算本自治系统内的路径, 并 保存所计算出的本自治系统内的路径计算结果以及自身相邻下游自治 系统的入口节点地址和 PCE地址, 向自身相邻上游自治系统中 PCE发 送所计算出的本自治系统内的路径计算结果中的入口节点地址。  Step 202: The PCE in the intermediate autonomous system calculates a path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system and the ingress node address and the PCE address of the neighboring downstream autonomous system to the self. The PCE in the neighboring upstream autonomous system transmits the calculated ingress node address in the path calculation result in the local autonomous system.
在本步骤中, 中间自治系统是从客户端设备所在的自治系统到达目 的节点所在的自治系统所经过的自治系统。  In this step, the intermediate autonomous system is an autonomous system that passes from the autonomous system where the client device is located to the autonomous system where the destination node is located.
步骤 203 , PCC所在自治系统中的 PCE,计算本自治系统内的路径, 并向 PCC发送所计算出的本自治系统内的路径计算结果以及自身相邻 下游自治系统的入口节点地址和 PCE地址。  Step 203: The PCE in the autonomous system where the PCC is located calculates a path in the local autonomous system, and sends the calculated path calculation result in the local autonomous system and the ingress node address and the PCE address of the neighboring downstream autonomous system to the PCC.
到此为止, 完成了计算 TE路径的过程, 在此过程中, PCE的地址 信息只限于被相邻上游自治系统所知, 而不会被扩散到所有的上游自治 系统中。  So far, the process of calculating the TE path is completed. In this process, the address information of the PCE is limited to be known by the adjacent upstream autonomous system, and is not spread to all upstream autonomous systems.
图 3是本发明实施例根据图 2所计算出的 TE路径建立 TE路径的流 程图。 如图 3所示, 包括以下步骤:  FIG. 3 is a flow chart of establishing a TE path according to the TE path calculated in FIG. 2 according to an embodiment of the present invention. As shown in Figure 3, the following steps are included:
步骤 301 , PCC根据所接收的路径计算结果建立本自治系统内的路 径,将所接收的 PCE地址发送给所接收的入口节点地址所指示的入口节 点。 Step 301: The PCC establishes a path in the local autonomous system according to the received path calculation result. The path sends the received PCE address to the ingress node indicated by the received ingress node address.
步骤 302, 所述中间自治系统中的入口节点从所接收 PCE地址所指 示的 PCE获取路径计算结果、 相邻下游自治系统中的 PCE地址和入口 节点地址, 根据所获取的路径计算结果建立本自治系统内的路径, 将所 获取的 PCE地址发送给所获取的入口节点地址所指示的入口节点。  Step 302: The ingress node in the intermediate autonomous system obtains the path calculation result, the PCE address and the ingress node address in the adjacent downstream autonomous system from the PCE indicated by the received PCE address, and establishes the autonomy according to the obtained path calculation result. The path in the system sends the acquired PCE address to the ingress node indicated by the acquired ingress node address.
步骤 303 , 最下游自治系统中的入口节点从所接收的 PCE地址所指 示的 PCE获取路径计算结果,根据所获取的路径计算结果建立本自治系 统内的路径。  Step 303: The ingress node in the most downstream autonomous system acquires a path calculation result from the PCE indicated by the received PCE address, and establishes a path in the local autonomous system according to the obtained path calculation result.
到此完成了 TE路径的建立过程。  This completes the TE path establishment process.
为使本发明的技术方案更加清楚明白, 下面举一个具体的例子, 对 本发明进一步详细说明。  In order to make the technical solution of the present invention more clear, the present invention will be further described in detail below with reference to a specific example.
图 4是本发明实施例计算 TE路径以及建立 TE路径的场景示意图。 如图 4所示, 位于自治系统 AS 300的客户端设备 PCC需要建立到自治 系统 AS 500中的节点 R5的路径。  FIG. 4 is a schematic diagram of a scenario for calculating a TE path and establishing a TE path according to an embodiment of the present invention. As shown in Figure 4, the client device PCC located in the autonomous system AS 300 needs to establish a path to the node R5 in the autonomous system AS 500.
在图中 4,首先 PCC向本自治系统 AS 300中的 PCE3发送路径计算 请求消息。 路径请求消息中携带目的节点 R5的地址和此次路径计算的 标识序号 X。 PCC发起路径计算请求的原因是多方面的, 例如, 接收到 某个报文并解析后发现本地没有存储该报文目的地址的转发路径, 或者 需要为某个业务建立固定通道等, 并且, PCC在发送路径计算请求消息 之前, 先要为该次计算分配一个唯一的标识序号, 在本实施例中该标识 序号为 X。 PCE3收到路径计算请求消息后,发现 R5位于自治系统 AS 500 中, 且要到达 AS 500必须经过自治系统 AS 400, 于是将该路径计算请 求消息转发给 AS 400中的 PCE4, 同样 AS 400中的 PCE4又将该路径 计算请求消息转发给 AS 500中的 PCE5。 PCE5收到路径计算请求消息 后,计算在 AS 500内的 TE路径 R4-R5 ,在本地保存标识序号 X和所计 算出的路径 R4-R5 , 然后向 PCE4返回所计算出的 AS 500内的 TE路径 R4-R5中的入口节点 R4的地址和标识序号 X。 PCE4收到 PCE5发送的 入口节点 R4的地址和标识序号 X后,计算 AS 400内的 TE路径 R2-R3, 在本地存储此次计算的标识序号 X、 R4的地址、 PCE5的地址以及所计 算出的路径 R2-R3 , 然后向 PCE3返回所计算出的 AS 400内的 TE路径 R2-R3中的入口节点 R2的地址和标识序号 X。 PCE3收到 PCE4发送的 入口节点 R2的地址和标识序号 X后,判断出自己和客户端 PCC位于同 一自治系统 AS 300内, 于是在计算出 AS 300内的 TE路径 PCC-R1后, 将计算结果连同相邻下游自治系统 AS 400 的入口节点 R2 的地址和 PCE4的地址送给 PCC。 到此, 完成了 PCC到 R5的 TE路径计算, PCC 可以根据计算结果发起路径建立消息了。 In the figure 4, the PCC first sends a path calculation request message to the PCE3 in the autonomous system AS 300. The path request message carries the address of the destination node R5 and the identification number X of the path calculation. The PCC initiates the path calculation request for a variety of reasons. For example, after receiving a packet and parsing it, it finds that there is no forwarding path for storing the destination address of the packet, or that a fixed channel needs to be established for a certain service, and PCC Before the path calculation request message is sent, a unique identifier sequence number is assigned to the calculation. In this embodiment, the identifier sequence number is X. After receiving the path calculation request message, PCE3 finds that R5 is located in AS 600, and must reach AS 500 through Autonomous System AS 400, and then forward the path calculation request message to PCE4 in AS 400, also in AS 400. The PCE 4 in turn forwards the path computation request message to the PCE 5 in the AS 500. PCE5 receives the path calculation request message After that, the TE path R4-R5 in the AS 500 is calculated, the identification number X and the calculated path R4-R5 are locally saved, and then the calculated entry in the TE path R4-R5 in the AS 500 is returned to the PCE4. The address of the node R4 and the identification number X. After receiving the address and the identification number X of the ingress node R4 sent by the PCE5, the PCE4 calculates the TE path R2-R3 in the AS 400, and locally stores the calculated identification number X, R4 address, the address of the PCE5, and the calculated The path R2-R3 then returns to PCE3 the calculated address and identification number X of the ingress node R2 in the TE path R2-R3 within the AS 400. After receiving the address of the ingress node R2 and the identification number X sent by the PCE4, the PCE3 determines that it and the client PCC are located in the same AS 300, and after calculating the TE path PCC-R1 in the AS 300, the calculation result is obtained. It is sent to the PCC along with the address of the ingress node R2 of the adjacent downstream autonomous system AS 400 and the address of PCE4. At this point, the TE path calculation from PCC to R5 is completed, and the PCC can initiate a path establishment message according to the calculation result.
在图 4所示的上述过程中, 由 PCE发现协议负责发现 PCE的存在 和计算能力并向发起路径计算请求的 PCC发送相应的信息, PCC根据 该协议发送的信息,选择合适的 PCE并向其发送路经计算请求, 这些是 现有技术, 这里不再详述。  In the above process shown in FIG. 4, the PCE discovery protocol is responsible for discovering the existence and computing power of the PCE and transmitting corresponding information to the PCC that initiates the path calculation request, and the PCC selects an appropriate PCE according to the information sent by the protocol and The transmission path is calculated, these are prior art and will not be described in detail here.
在图 4中, TE路径的建立过程是: PCC收到 PCE3返回的 AS 300 中的路径计算结果以及 AS 400中的入口节点 R2的地址和 PCE4的地址 后, 通过信令协议发起路径建立信令消息, 该消息的 ERO参数中包含 AS 300中的路径计算结果以及 AS 400中的入口节点 R2的地址、 PCE4 的地址和标识序号 X。 路径建立信令消息根据自身 ERO 中的路径计算 结果在 AS 300内建立路径后到达 ERO中所指示的 AS 400中的入口节 点 R2。 R2根据路径建立信令消息中包含的 PCE4的地址, 向 PCE4发 送包含标识序号 X的查询请求消息。 PCE4接收到查询请求消息后, 向 R2返回与标识序号 X对应的路径计算结果 R2-R3以及所保存的 R4的 地址和 PCE5的地址。 R2将 PCE4返回的路径计算结果 R2-R3以及 R4 的地址和 PCE5的地址插入到路径建立信令消息的 ERO参数中。路径建 立信令消息根据自身 ERO中的路径计算结果 R2-R3在 AS 400内建立路 径后到达 ERO中所指示的 AS 500中的入口节点 R4。 R4根据路径建立 信令消息中包含的 PCE5的地址, 向 PCE5发送包含标识序号 X的查询 请求消息。 PCE5接收到查询请求消息后, 向 R4返回与标识序号 X对 应的路径计算结果 R4-R5。 R4将 PCE5返回的路径计算结果 R4-R5插入 到路径建立信令消息的 ERO参数中。 路径建立信令消息根据自身 ERO 中的路径计算结果 R4-R5在 AS 500内建立路径。 到此, 完成了从 PCC 到 R5的 TE路径的建立过程。 In FIG. 4, the TE path establishment process is: After receiving the path calculation result in the AS 300 returned by the PCE3 and the address of the ingress node R2 and the address of the PCE4 in the AS 400, the PCC initiates path establishment signaling by using a signaling protocol. The message, the ERO parameter of the message includes the path calculation result in the AS 300, the address of the ingress node R2 in the AS 400, the address of the PCE4, and the identification number X. The path establishment signaling message arrives at the ingress node R2 in the AS 400 indicated in the ERO after establishing a path in the AS 300 according to the path calculation result in its own ERO. R2 sends a query request message including the identification number X to the PCE 4 according to the address of the PCE 4 included in the path establishment signaling message. After receiving the inquiry request message, the PCE4 returns the path calculation result R2-R3 corresponding to the identification number X and the saved R4 to R2. Address and address of PCE5. R2 inserts the path calculation results R2-R3 and the address of R4 and the address of PCE5 returned by PCE4 into the ERO parameters of the path establishment signaling message. The path establishment signaling message arrives at the ingress node R4 in the AS 500 indicated in the ERO according to the path calculation result R2-R3 in the ERO after establishing the path in the AS 400. R4 sends a query request message including the identification number X to the PCE 5 according to the address of the PCE5 included in the path establishment signaling message. After receiving the inquiry request message, the PCE 5 returns the path calculation result R4-R5 corresponding to the identification number X to R4. R4 inserts the path calculation result R4-R5 returned by PCE5 into the ERO parameter of the path establishment signaling message. The path establishment signaling message establishes a path within the AS 500 based on the path calculation result R4-R5 in its own ERO. At this point, the establishment process of the TE path from PCC to R5 is completed.
图 5 是本发明实施例一种计算流量工程路径的系统的组成结构框 图。 如图 5所示, 该系统包括: PCC, PCC所在自治系统中的 PCE, 目 的节点所在的最下游自治系统中的 PCE和中间自治系统中的 PCE。这里 中间自治系统是指 PCC与目的节点之间的路径所经过的, 除 PCC所在 自治系统和目的节点所在的自治系统以外的自治系统, 比如, 图 4中的 AS 400便是一个中间自治系统。  FIG. 5 is a block diagram showing the structure of a system for calculating a traffic engineering path according to an embodiment of the present invention. As shown in Figure 5, the system includes: PCC, PCE in the autonomous system where the PCC is located, PCE in the most downstream autonomous system where the destination node is located, and PCE in the intermediate autonomous system. Here, the intermediate autonomous system refers to an autonomous system through which the path between the PCC and the destination node passes, except for the autonomous system in which the PCC is located in the autonomous system and the destination node. For example, the AS 400 in FIG. 4 is an intermediate autonomous system.
在图 5中, PCC, 用于向本自治系统中的 PCE发送路径计算请求消 息, 其中携带目的节点地址和本次路径计算的标识序号; 用于接收本自 治系统中的 PCE返回的消息。  In FIG. 5, the PCC is configured to send a path calculation request message to the PCE in the autonomous system, where the destination node address and the identification number of the current path calculation are carried; and the message for receiving the return of the PCE in the autonomous system is received.
PCC所在自治系统中的 PCE, 用于在接收到路径计算请求消息后, 转发给自身相邻下游自治系统的 PCE; 用于在接收到自身相邻下游自治 系统中的 PCE返回的自身相邻下游自治系统中的入口节点地址后,计算 本自治系统内的路径, 并向 PCC返回本自治系统内的路径计算结果、 自 身相邻下游自治系统中的 PCE 的地址以及自身相邻下游自治系统中的 入口节点的地址。 中间自治系统中的 PCE, 用于在接收到路径计算请求消息后, 转发 给自身相邻下游自治系统的 PCE; 用于在接收到自身相邻下游自治系统 中的 PCE返回的自身相邻下游自治系统中的入口节点地址后,计算本自 治系统内的路径, 保存本自治系统内的路径计算结果、 所述标识序号、 自身相邻下游自治系统中 PCE 的地址以及自身相邻下游自治系统中入 口节点的地址,向自身相邻上游自治系统中 PCE返回所述标识序号和本 自治系统内路径计算结果中的入口节点地址。 The PCE in the autonomous system in which the PCC is located is used to forward the path calculation request message to the PCE of the neighboring downstream autonomous system; and to receive the neighboring downstream of the PCE returned by the neighboring downstream autonomous system. After the ingress node address in the autonomous system, calculate the path in the local autonomous system, and return the path calculation result in the autonomous system to the PCC, the address of the PCE in its neighboring downstream autonomous system, and the neighboring downstream autonomous system. The address of the ingress node. The PCE in the intermediate autonomous system is configured to forward to the PCE of the neighboring downstream autonomous system after receiving the path calculation request message, and is used to receive the neighboring downstream autonomy of the PCE returned by the neighboring downstream autonomous system. After the ingress node address in the system, calculate the path in the local autonomous system, save the path calculation result in the autonomous system, the identification sequence number, the address of the PCE in its neighboring downstream autonomous system, and the entry in its neighboring downstream autonomous system. The address of the node returns the identification sequence number and the entry node address in the path calculation result in the local autonomous system to the PCE in the neighboring upstream autonomous system.
最下游自治系统中的 PCE, 用于在接收到自身相邻上游自治系统中 的 PCE发送的路径计算请求消息后,计算本自治系统内的路径,保存本 自治系统内的路径计算结果和所述标识序号, 并向自身相邻上游自治系 统中 PCE返回所述标识序号和本自治系统内的路径计算结果中的入口 节点地址。  The PCE in the most downstream autonomous system is configured to calculate a path in the local autonomous system after receiving the path calculation request message sent by the PCE in the neighboring upstream autonomous system, and save the path calculation result in the local autonomous system and the The serial number is identified, and the identification number and the entry node address in the path calculation result in the local autonomous system are returned to the PCE in the neighboring upstream autonomous system.
在图 5中, 中间自治系统中的 PCE的个数可以是任意的, 图 5中给 出了只有一个中间自治系统中的 PCE时的情况。  In Fig. 5, the number of PCEs in the intermediate autonomous system can be arbitrary, and the case in Fig. 5 is given when there is only one PCE in the intermediate autonomous system.
图 5所示的系统进一步包括: 中间自治系统中的入口节点和最下游 自治系统中的入口节点, 用于参与 TE路径的建立。  The system shown in Figure 5 further includes: an ingress node in the intermediate autonomous system and an ingress node in the most downstream autonomous system for participating in the establishment of the TE path.
在图 5中, PCC在建立 TE路径时, 用于根据所接收的本自治系统 内的路径计算结果建立本自治系统内的路径, 并根据所接收的相邻下游 自治系统中的入口节点的地址, 将所述标识序号和所接收的自身相邻下 游自治系统中的 PCE 的地址发送给自身相邻下游自治系统中的入口节 点。  In FIG. 5, when establishing a TE path, the PCC is configured to establish a path in the local autonomous system according to the received path calculation result in the local autonomous system, and according to the received address of the ingress node in the adjacent downstream autonomous system. And sending the identification sequence number and the received address of the PCE in the neighboring downstream autonomous system to the ingress node in the neighboring downstream autonomous system.
中间自治系统中的入口节点在建立 TE路径时, 用于根据所接收的 PCE地址和标识序号,从本自治系统中的 PCE获取与所述标识序号对应 的路径计算结果、 自身相邻下游自治系统中的 PCE的地址以及自身相邻 下游自治系统中的入口节点的地址, 根据所获取的路径计算结果建立本 自治系统内的路径, 并根据所获取的自身相邻下游自治系统中的入口节 点的地址, 将所述标识序号和所获取的自身相邻下游自治系统中的 PCE 的地址发送给自身相邻下游自治系统中的入口节点。 The ingress node in the intermediate autonomous system is configured to obtain, according to the received PCE address and the identification sequence number, the path calculation result corresponding to the identification sequence number from the PCE in the local autonomous system, and the neighboring downstream autonomous system. The address of the PCE and the address of the ingress node in its neighboring downstream autonomous system, based on the obtained path calculation result. a path in the autonomous system, and sending the identification sequence number and the acquired address of the PCE in the neighboring downstream autonomous system to the neighboring downstream according to the obtained address of the ingress node in the neighboring downstream autonomous system. An ingress node in an autonomous system.
最下游自治系统中的入口节点在建立 TE路径时, 用于根据所接收 的 PCE地址和标识序号, 从本自治系统中的 PCE获取与所述标识序号 对应的路径计算结果, 根据所获取的路径计算结果建立本自治系统内的 路径。  The ingress node in the most downstream autonomous system obtains the path calculation result corresponding to the identification sequence number from the PCE in the local autonomous system according to the received path, when the TE path is established, according to the received PCE address and the identification sequence number, according to the acquired path. The calculation results establish the path within the autonomous system.
图 6是本发明实施例一种 PCE的结构框图。 如图 6所示该 PCE包 括主处理模块 601、 存储模块 602和查询模块 603。  FIG. 6 is a structural block diagram of a PCE according to an embodiment of the present invention. The PCE includes a main processing module 601, a storage module 602, and a query module 603 as shown in FIG.
在图 6中, 主处理模块 601 , 用于在接收到携带目的节点地址和标 识序号的路径计算请求消息时, 判断目的节点是否在本自治系统中, 如 果是, 则计算本自治系统内的路径, 将本自治系统内的路径计算结果和 所述标识序号发送到存储模块 602, 向相邻上游自治系统中的 PCE发送 本自治系统内的路径计算结果中的入口节点地址和标识序号; 否则, 将 路径计算请求消息转发给相邻下游自治系统中 PCE。  In FIG. 6, the main processing module 601 is configured to: when receiving the path calculation request message carrying the destination node address and the identification sequence number, determine whether the destination node is in the local autonomous system, and if yes, calculate the path in the local autonomous system. And sending the path calculation result and the identification sequence number in the local autonomous system to the storage module 602, and sending the entry node address and the identification sequence number in the path calculation result in the local autonomous system to the PCE in the adjacent upstream autonomous system; otherwise, The path calculation request message is forwarded to the PCE in the adjacent downstream autonomous system.
主处理模块 601 , 还用于在接收到相邻下游自治系统内的 PCE发送 的相邻下游自治系统内的路径计算结果中的入口节点地址和标识序号 时, 判断发起路径计算请求消息的 PCC是否在本自治系统中, 如果是, 则计算本自治系统内的路径,并向 PCC返回本自治系统内的路径计算结 果、相邻下游自治系统中的 PCE的地址以及其相邻下游自治系统中的入 口节点的地址; 否则, 计算本自治系统内的路径, 将本自治系统内的路 径计算结果、所述标识序号、相邻下游自治系统中 PCE的地址以及相邻 下游自治系统中入口节点的地址发送到存储模块 602, 向其相邻上游自 治系统中 PCE返回所述标识序号和本自治系统内路径计算结果中的入 口节点地址。 存储模块 602, 用于保存所述主处理模块 601发送的信息。 The main processing module 601 is further configured to: when receiving the ingress node address and the identification sequence number in the path calculation result in the adjacent downstream autonomous system sent by the PCE in the adjacent downstream autonomous system, determine whether the PCC that initiates the path calculation request message is In the autonomous system, if yes, the path in the local autonomous system is calculated, and the path calculation result in the local autonomous system, the address of the PCE in the adjacent downstream autonomous system, and the neighboring downstream autonomous system are returned to the PCC. The address of the ingress node; otherwise, calculate the path in the local autonomous system, calculate the path result in the local autonomous system, the identification sequence number, the address of the PCE in the adjacent downstream autonomous system, and the address of the ingress node in the adjacent downstream autonomous system. The method is sent to the storage module 602, and returns the identification sequence number and the entry node address in the path calculation result in the local autonomous system to the PCE in the neighboring upstream autonomous system. The storage module 602 is configured to save information sent by the main processing module 601.
查询模块 603, 用于在接收到本自治系统中入口节点的发送的包含 标识序号的查询请求时,从存储模块 602查询与所述标识序号对应信息, 返回给所述入口节点。  The querying module 603 is configured to query, from the storage module 602, information corresponding to the identification sequence number to the ingress node when receiving the query request that includes the identification sequence number sent by the ingress node in the autonomous system.
综上所述, 本发明实施例这种在 TE路径的计算过程中, 每个 PCE 都将本自治系统中的路径计算结果以及相邻下游自治系统中的 PCE地 址和入口节点地址保存在本地, 而只向相邻上游自治系统告知自身的地 址和本自治系统中入口节点地址的技术方案, 使得一个自治系统中的 PCE的地址只限于被相邻上游自治系统所知, 而不会扩散到所有上游自 治系统中, 从而有效地提高了 PCE地址的安全性。  In summary, in the calculation process of the TE path, each PCE saves the path calculation result in the local autonomous system and the PCE address and the ingress node address in the adjacent downstream autonomous system locally. The technical solution of only informing the neighboring upstream autonomous system of its own address and the address of the ingress node in the autonomous system makes the address of the PCE in an autonomous system limited to be known by the adjacent upstream autonomous system, and does not spread to all. In the upstream autonomous system, the security of the PCE address is effectively improved.
以上所述, 仅为本发明的较佳实施例而已, 并非用于限定本发明的 保护范围, 凡在本发明的精神和原则之内所做的任何修改、 等同替换、 改进等, 均应包含在本发明的保护范围之内。  The above is only the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modifications, equivalents, improvements, etc., which are made within the spirit and principles of the present invention, should be included. It is within the scope of the invention.

Claims

权利要求书 Claim
1、 一种计算流量工程路径的方法, 其特征在于, 该方法包括以下步 骤:  A method for calculating a traffic engineering path, the method comprising the steps of:
目的节点所在的最下游自治系统中的路径计算设备 PCE计算本自 治系统内的路径, 并保存所计算出的本自治系统内的路径计算结果, 向 自身相邻上游自治系统中 PCE发送所计算出的本自治系统内的路径计 算结果中的入口节点地址;  The path calculation device PCE in the most downstream autonomous system in which the destination node is located calculates the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system, and sends the calculated result to the PCE in its neighboring upstream autonomous system. The entry node address in the path calculation result in the local autonomous system;
中间自治系统中的 PCE, 计算本自治系统内的路径, 并保存所计算 出的本自治系统内的路径计算结果以及自身相邻下游自治系统的入口 节点地址和 PCE地址, 向自身相邻上游自治系统中 PCE发送所计算出 的本自治系统内的路径计算结果中的入口节点地址;  The PCE in the intermediate autonomous system calculates the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system and the ingress node address and PCE address of the adjacent downstream autonomous system, and is adjacent to its own upstream autonomy. The PCE in the system sends the calculated entry node address in the path calculation result in the local autonomous system;
客户端设备所在自治系统中的 PCE, 计算本自治系统内的路径, 并 向客户端设备发送所计算出的本自治系统内的路径计算结果以及自身 相邻下游自治系统的入口节点地址和 PCE地址。  The PCE in the autonomous system where the client device is located calculates the path in the local autonomous system, and sends the calculated path calculation result in the local autonomous system and the ingress node address and PCE address of the neighboring downstream autonomous system to the client device. .
2、 如权利要求 1所述的方法, 其特征在于, 在所述最下游自治系统 中的 PCE计算本自治系统内的路径之前进一步包括:  2. The method according to claim 1, wherein before the PCE in the most downstream autonomous system calculates a path in the local autonomous system, the method further comprises:
客户端设备向本自治系统中的 PCE发送携带目的节点地址的路径 计算请求消息; 客户端设备所在自治系统中的 PCE根据目的节点的地 址, 将路径计算请求消息转发给自身相邻下游自治系统中的 PCE; 所述中间自治系统中的 PCE接收到相邻上游自治系统中的 PCE发 送的路径计算请求消息后, 根据目的节点的地址, 将路径计算请求消息 转发给自身相邻下游自治系统中的 PCE, 如此, 直至路径计算请求消息 到达目的节点所在的最下游自治系统中的 PCE。  The client device sends a path calculation request message carrying the destination node address to the PCE in the autonomous system; the PCE in the autonomous system where the client device is located forwards the path calculation request message to the neighboring downstream autonomous system according to the address of the destination node. After receiving the path calculation request message sent by the PCE in the adjacent upstream autonomous system, the PCE in the intermediate autonomous system forwards the path calculation request message to the neighboring downstream autonomous system according to the address of the destination node. PCE, in this way, until the path computation request message arrives at the PCE in the most downstream autonomous system where the destination node is located.
3、如权利要求 1或 2所述的方法, 其特征在于, 在所述客户端设备 所在自治系统中的 PCE, 向客户端设备返回本自治系统内的路径计算结 果以及自身相邻下游自治系统的入口节点地址和 PCE地址之后进一步 包括: 3. The method of claim 1 or 2, wherein at the client device After the PCE in the autonomous system returns the path calculation result in the autonomous system and the ingress node address and PCE address of the neighboring downstream autonomous system to the client device, the PCE further includes:
客户端设备根据所接收的路径计算结果建立本自治系统内的路径, 将所接收的 PCE地址发送给所接收的入口节点地址所指示的入口节点; 所述中间自治系统中的入口节点从所接收 PCE地址所指示的 PCE 获取路径计算结果以及相邻下游自治系统中的 PCE地址和入口节点地 址, 根据所获取的路径计算结果建立本自治系统内的路径, 将所获取的 PCE地址发送给所获取的入口节点地址所指示的入口节点;  The client device establishes a path in the local autonomous system according to the received path calculation result, and sends the received PCE address to the ingress node indicated by the received ingress node address; the ingress node in the intermediate autonomous system receives from the received node The PCE obtains the path calculation result and the PCE address and the ingress node address in the adjacent downstream autonomous system, and establishes the path in the local autonomous system according to the obtained path calculation result, and sends the acquired PCE address to the acquired The entry node indicated by the entry node address;
最下游自治系统中的入口节点从所接收的 PCE地址所指示的 PCE 获取路径计算结果, 根据所获取的路径计算结果建立本自治系统内的路 径。  The ingress node in the most downstream autonomous system obtains the path calculation result from the PCE indicated by the received PCE address, and establishes the path in the local autonomous system according to the obtained path calculation result.
4、 如权利要求 3所述的方法, 其特征在于,  4. The method of claim 3, wherein
所述路径计算请求消息中进一步携带本次路径计算的标识序号; 所述目的节点所在的最下游自治系统中的 PCE 以及中间自治系统 中的 PCE, 在保存所计算出的本自治系统内的路径计算结果和相邻下游 自治系统的入口节点地址和 PCE地址的同时, 进一步保存所述标识序 号;并向自身相邻上游自治系统中 PCE返回所计算出的本自治系统内的 路径计算结果中的入口节点地址同时, 返回所述标识序号;  The path calculation request message further carries the identification number of the current path calculation; the PCE in the most downstream autonomous system where the destination node is located and the PCE in the intermediate autonomous system save the calculated path in the local autonomous system The calculation result is further saved with the ingress node address and the PCE address of the adjacent downstream autonomous system, and the identification sequence number is further saved; and the PCE in the neighboring upstream autonomous system is returned to the calculated path calculation result in the local autonomous system. At the same time, the ingress node address returns the identification sequence number;
所述客户端设备所在自治系统中的 PCE, 向客户端设备返回所计算 出的本自治系统内的路径计算结果和自身相邻下游自治系统的入口节 点地址和 PCE地址的同时, 返回所述标识序号;  The PCE in the autonomous system where the client device is located returns the calculated path calculation result in the local autonomous system and the ingress node address and PCE address of the neighboring downstream autonomous system to the client device, and returns the identifier. Serial number
所述客户端设备和所述中间自治系统中的入口节点, 将所接收的 PCE地址发送给所接收的入口节点地址所指示的入口节点的同时, 发送 所述标识序号; 所述入口节点获取本自治系统中的路径计算结果以及相邻下游自治 系统中的 PCE地址和入口节点地址包括: The client device and the ingress node in the intermediate autonomous system send the received serial number while transmitting the received PCE address to the ingress node indicated by the received ingress node address; The ingress node obtains the path calculation result in the local autonomous system and the PCE address and the ingress node address in the adjacent downstream autonomous system, including:
入口节点向所接收的 PCE地址所指示的 PCE发送携带所述标识序 号的查询信息;接收到查询信息的 PCE将自身保存的与标识序号对应的 路径计算结果、相邻下游自治系统中的 PCE的地址以及入口节点的地址 返回给发送查询信息的入口节点。  The ingress node sends the query information carrying the identification sequence number to the PCE indicated by the received PCE address; the path calculation result corresponding to the identification sequence number saved by the PCE receiving the query information, and the PCE in the adjacent downstream autonomous system The address and the address of the ingress node are returned to the ingress node that sent the query information.
5、 一种计算流量工程路径的系统, 其特征在于, 该系统包括: 客户 端设备, 客户端设备所在自治系统中的 PCE, 目的节点所在的最下游自 治系统中的 PCE , 中间自治系统中的 PCE, 其中,  A system for calculating a traffic engineering path, the system comprising: a client device, a PCE in an autonomous system where the client device is located, a PCE in a most downstream autonomous system where the destination node is located, and an intermediate autonomous system PCE, where,
最下游自治系统中的 PCE, 用于计算本自治系统内的路径, 并保存 所计算出的本自治系统内的路径计算结果, 向自身相邻上游自治系统中 PCE发送所计算出的本自治系统内的路径计算结果中的入口节地址; 中间自治系统中的 PCE, 用于计算本自治系统内的路径, 并保存所 计算出的本自治系统内的路径计算结果以及相邻下游自治系统中 PCE 地址和入口节点地址,向自身相邻上游自治系统中 PCE发送所计算出的 本自治系统内的路径计算结果中的入口节点地址;  The PCE in the most downstream autonomous system is used to calculate the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system, and sends the calculated local autonomous system to the PCE in its neighboring upstream autonomous system. The entry node address in the path calculation result; the PCE in the intermediate autonomous system is used to calculate the path in the local autonomous system, and saves the calculated path calculation result in the local autonomous system and the PCE in the adjacent downstream autonomous system. The address and the ingress node address are sent to the PCE in the neighboring upstream autonomous system to calculate the ingress node address in the path calculation result in the local autonomous system;
客户端设备所在自治系统中的 PCE,用于计算本自治系统内的路径, 并向客户端设备发送所计算出的本自治系统内的路径计算结果以及自 身相邻下游自治系统中的 PCE地址和入口节点地址;  The PCE in the autonomous system where the client device is located is used to calculate the path in the local autonomous system, and sends the calculated path calculation result in the local autonomous system and the PCE address in the adjacent downstream autonomous system to the client device. Ingress node address;
客户端设备, 用于接收本自治系统中的 PCE返回的信息。  The client device is configured to receive information returned by the PCE in the autonomous system.
6、 如权利要求 5所述的系统, 其特征在于,  6. The system of claim 5 wherein:
所述客户端设备,进一步用于向本自治系统中的 PCE发送携带目的 节点地址的路径计算请求消息;  The client device is further configured to send a path calculation request message carrying a destination node address to a PCE in the local autonomous system;
所述客户端设备所在自治系统中的 PCE, 进一步用于在接收到路径 计算请求消息后, 根据目的节点的地址将路径计算请求转发给自身相邻 下游自治系统中的 PCE; The PCE in the autonomous system where the client device is located is further configured to: after receiving the path calculation request message, forward the path calculation request to the neighbor according to the address of the destination node. PCE in the downstream autonomous system;
所述中间自治系统中的 PCE, 进一步用于在接收到路径计算请求消 息后, 根据目的节点的地址将路径计算请求转发给自身相邻下游自治系 统中的 PCE;  The PCE in the intermediate autonomous system is further configured to: after receiving the path calculation request message, forward the path calculation request to the PCE in the neighboring downstream autonomous system according to the address of the destination node;
最下游自治系统中的 PCE, 用于在接收到路径计算请求消息后, 再 计算本自治系统内的路径, 保存本自治系统内的路径计算结果, 并向自 身相邻上游自治系统中 PCE发送本自治系统内的入口节地址。  The PCE in the most downstream autonomous system is configured to calculate the path in the local autonomous system after receiving the path calculation request message, save the path calculation result in the local autonomous system, and send the original to the PCE in the neighboring upstream autonomous system. The address of the entry section within the autonomous system.
7、如权利要求 5或 6所述的系统,其特征在于,该系统进一步包括: 中间自治系统中的入口节点和最下游自治系统中的入口节点, 其中, 所述客户端设备, 用于根据所接收的路径计算结果建立本自治系统 内的路径,将所接收的 PCE的地址发送给所接收的入口节点地址所指示 的入口节点;  The system of claim 5 or claim 6, wherein the system further comprises: an ingress node in the intermediate autonomous system and an ingress node in the most downstream autonomous system, wherein the client device is configured to The received path calculation result establishes a path in the local autonomous system, and sends the received address of the PCE to the ingress node indicated by the received ingress node address;
中间自治系统中的入口节点,用于从所接收 PCE地址所指示的 PCE 获取路径计算结果以及相邻下游自治系统中的 PCE地址和入口节点地 址, 根据所获取的路径计算结果建立本自治系统内的路径, 将所获取的 PCE的地址发送给所获取的入口节点地址所指示的入口节点;  An ingress node in the intermediate autonomous system is configured to obtain a path calculation result and a PCE address and an ingress node address in the neighboring downstream autonomous system from the PCE indicated by the received PCE address, and establish an internal autonomous system according to the obtained path calculation result. Path, sending the acquired address of the PCE to the ingress node indicated by the acquired ingress node address;
最下游自治系统中的入口节点,用于从所接收的 PCE地址所指示的 PCE获取路径计算结果, 根据所获取的路径计算结果建立本自治系统内 的路径。  The ingress node in the most downstream autonomous system is configured to obtain a path calculation result from the PCE indicated by the received PCE address, and establish a path in the local autonomous system according to the obtained path calculation result.
8、 如权利要求 7所述的系统, 其特征在于,  8. The system of claim 7 wherein:
所述客户端设备,进一步用于在向本自治系统中的 PCE发送的路径 计算请求消息中携带本次路径计算的标识序号;  The client device is further configured to carry the identifier number of the current path calculation in the path calculation request message sent to the PCE in the local autonomous system;
所述目的节点所在的最下游自治系统中的 PCE 以及中间自治系统 中的 PCE, 用于保存所计算出的本自治系统内的路径计算结果和相邻下 游自治系统的入口节点地址和 PCE地址的同时,进一步用于保存所述标 识序号;用于向自身相邻上游自治系统中 PCE返回所计算出的本自治系 统内的路径计算结果中的入口节点地址同时, 进一步用于向自身相邻上 游自治系统中 PCE返回所述标识序号; The PCE in the most downstream autonomous system in which the destination node is located and the PCE in the intermediate autonomous system are used to save the calculated path calculation result in the local autonomous system and the ingress node address and PCE address of the adjacent downstream autonomous system. At the same time, further used to save the target The serial number is used to return the calculated ingress node address in the path calculation result in the local autonomous system to the PCE in the neighboring upstream autonomous system, and is further used to return the identifier to the PCE in the neighboring upstream autonomous system. Serial number
所述客户端设备所在自治系统中的 PCE, 用于向客户端设备返回所 计算出的本自治系统内的路径计算结果以及自身相邻下游自治系统的 入口节点地址和 PCE地址的同时,进一步用于向客户端设备返回所述标 识序号;  The PCE in the autonomous system where the client device is located is used to return the calculated path calculation result in the local autonomous system and the ingress node address and the PCE address of the neighboring downstream autonomous system to the client device, and further use Returning the identification serial number to the client device;
所述客户端设备和所述中间自治系统中的入口节点, 用于将所接收 的相邻下游自治系统中的 PCE地址发送给相邻下游自治系统中的入口 节点的同时, 进一步用于将所述标识序号发送给相邻下游自治系统中的 入口节点;  The client device and the ingress node in the intermediate autonomous system are configured to send the PCE address in the received adjacent downstream autonomous system to the ingress node in the adjacent downstream autonomous system, and further The identification sequence number is sent to an ingress node in an adjacent downstream autonomous system;
所述中间自治系统中的入口节点和最下游自治系统中的入口节点, 用于向所接收的 PCE地址所指示的 PCE发送携带所述标识序号的查询 信息; 接收到查询信息的 PCE, 用于将自身保存的与标识序号对应的路 径计算结果、相邻下游自治系统中的 PCE的地址以及入口节点的地址返 回给发送查询信息的入口节点。  The ingress node in the intermediate autonomous system and the ingress node in the most downstream autonomous system are configured to send, to the PCE indicated by the received PCE address, the query information carrying the identification sequence number; the PCE that receives the query information, The path calculation result corresponding to the identification sequence number saved by itself, the address of the PCE in the adjacent downstream autonomous system, and the address of the ingress node are returned to the ingress node that sends the query information.
9、 一种路径计算设备 PCE, 其特征在于, 该 PCE包括主处理模块 和存储模块, 其中,  A path computing device (PCE), wherein the PCE includes a main processing module and a storage module, where
主处理模块用于:  The main processing module is used to:
在接收到携带目的节点地址和标识序号的路径计算请求消息时, 判 断目的节点是否在本自治系统中,如果是,则计算本自治系统内的路径, 并将所计算出的本自治系统内的路径计算结果和所述标识序号发送到 存储模块,向相邻上游自治系统中的 PCE发送所计算出的本自治系统内 的路径计算结果中的入口节点地址和标识序号; 否则, 将路径计算请求 消息转发给相邻下游自治系统中 PCE; 在接收到相邻下游 PCE发送的相邻下游自治系统内的入口节点地 址和标识序号时, 计算本自治系统内的路径, 判断发起路径计算请求消 息的客户端设备是否在本自治系统中, 如果是, 则向客户端设备返回所 计算出的本自治系统内的路径计算结果以及相邻下游自治系统中的 PCE 地址和入口节点地址; 否则, 将所计算出的本自治系统内的路径计算结 果、所述标识序号、相邻下游自治系统中 PCE地址和入口节点地址发送 到存储模块,向其相邻上游自治系统中 PCE返回所述标识序号和所计算 出的本自治系统内的路径计算结果中的入口节点地址; When receiving the path calculation request message carrying the destination node address and the identification sequence number, determining whether the destination node is in the local autonomous system, and if so, calculating the path in the local autonomous system, and calculating the calculated internal The path calculation result and the identification sequence number are sent to the storage module, and the calculated entry node address and the identification sequence number in the path calculation result in the local autonomous system are sent to the PCE in the neighboring upstream autonomous system; otherwise, the path calculation request is performed. The message is forwarded to the PCE in the adjacent downstream autonomous system; When the ingress node address and the identification sequence number in the adjacent downstream autonomous system sent by the neighboring downstream PCE are received, the path in the local autonomous system is calculated, and the client device that initiates the path calculation request message is determined to be in the local autonomous system. If yes, the calculated path calculation result in the local autonomous system and the PCE address and the ingress node address in the adjacent downstream autonomous system are returned to the client device; otherwise, the calculated path calculation result in the local autonomous system is calculated. The identification sequence number, the PCE address and the ingress node address in the adjacent downstream autonomous system are sent to the storage module, and the identification number and the calculated path calculation result in the local autonomous system are returned to the PCE in the adjacent upstream autonomous system. Ingress node address in ;
存储模块, 用于保存所述主处理模块发送的信息。  a storage module, configured to save information sent by the main processing module.
10、 如权利要求 9所述的 PCE, 其特征在于, 该 PCE进一步包括查 询模块, 用于在接收到本自治系统中入口节点的发送的包含标识序号的 查询请求时, 从所述存储模块查询与所述标识序号对应信息, 返回给所 述入口节点。  The PCE according to claim 9, wherein the PCE further comprises a query module, configured to query from the storage module when receiving a query request including an identifier serial number sent by an ingress node in the autonomous system Information corresponding to the identification sequence number is returned to the ingress node.
PCT/CN2007/070227 2006-09-07 2007-07-03 A traffic engineering path computation method, a system and a path computation element WO2008031337A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2006100625427A CN101141376B (en) 2006-09-07 2006-09-07 Method to establish TE path, path computation equipment and system
CN200610062542.7 2006-09-07

Publications (1)

Publication Number Publication Date
WO2008031337A1 true WO2008031337A1 (en) 2008-03-20

Family

ID=39183386

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/070227 WO2008031337A1 (en) 2006-09-07 2007-07-03 A traffic engineering path computation method, a system and a path computation element

Country Status (2)

Country Link
CN (1) CN101141376B (en)
WO (1) WO2008031337A1 (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8358662B2 (en) * 2008-08-30 2013-01-22 Futurewei Technologies, Inc. Creating and maintaining traffic engineered database for path computation element
CN101662424B (en) * 2009-08-18 2012-04-25 杭州华三通信技术有限公司 Traffic engineering mapping table automatic collocation method and device therefor
CN103532615B (en) * 2012-07-06 2017-11-07 中兴通讯股份有限公司 A kind of path calculation method, the node and path-calculating element for realizing this method
CN102970222B (en) * 2012-11-20 2015-08-12 中兴通讯股份有限公司 A kind of management method of cross-domain route, system and device
WO2014139356A1 (en) * 2013-03-15 2014-09-18 Huawei Technologies Co., Ltd. Method of communicating for establishing path and network apparatus
US20160294673A1 (en) * 2013-11-27 2016-10-06 Nec Corporation Communication system, communication method, network information combination apparatus, and network information combination program
WO2015131703A1 (en) * 2014-03-06 2015-09-11 Huawei Technologies Co., Ltd. Method and apparatus for path selecting
CN104092611B (en) * 2014-07-17 2018-05-15 新华三技术有限公司 Determine the method and device of trans-regional affined label switched path
CN106230721B (en) * 2016-07-25 2019-04-05 中国联合网络通信集团有限公司 The method and device of control business transmission

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060039391A1 (en) * 2004-01-29 2006-02-23 Cisco Technology, Inc. Computing inter-autonomous system MPLS traffic engineering LSP paths
US20060120288A1 (en) * 2004-12-02 2006-06-08 Jean-Philippe Vasseur Inter-domain TE-LSP selection
US20060171320A1 (en) * 2005-02-02 2006-08-03 Jean-Philippe Vasseur Inter-domain path computation technique

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1315294C (en) * 2003-05-07 2007-05-09 华为技术有限公司 Method for realizing universal multi-protocol mark exchange in network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060039391A1 (en) * 2004-01-29 2006-02-23 Cisco Technology, Inc. Computing inter-autonomous system MPLS traffic engineering LSP paths
US20060120288A1 (en) * 2004-12-02 2006-06-08 Jean-Philippe Vasseur Inter-domain TE-LSP selection
US20060171320A1 (en) * 2005-02-02 2006-08-03 Jean-Philippe Vasseur Inter-domain path computation technique

Also Published As

Publication number Publication date
CN101141376A (en) 2008-03-12
CN101141376B (en) 2010-04-14

Similar Documents

Publication Publication Date Title
EP3429141B1 (en) Segment routing label switched path for non-segment routing enabled routers
WO2008031337A1 (en) A traffic engineering path computation method, a system and a path computation element
EP2140626B1 (en) Virtual connection route selection apparatus and techniques
EP1885081B1 (en) Method, system and path computation element for processing distributed path computation requests
WO2009043256A1 (en) Method, system and device for obtaining label switched path
US20080198751A1 (en) Method for implementing cross-domain constraint routing
US20110022728A1 (en) Link state routing protocols for database synchronization in gmpls networks
CN102308519A (en) System and method for point to multi-point inter-domain multi-protocol label switching traffic engineering path calculation
US11743166B2 (en) Provisioning non-colored segment routing label switched paths via segment routing policies in border gateway protocol
WO2006122506A1 (en) A method and apparatus for computing a path in a network domain
WO2007079667A1 (en) A method for traffic engineering computation between the areas and a system, an equipment, a storage media thereof
KR101050681B1 (en) Method and apparatus for calculating route in label switched network
CN101155119B (en) Method and device for confirming boundary node of autonomous system and its path computing method
WO2008131660A1 (en) Domain traffic engineering path computation method and path computation element
WO2008098452A1 (en) A method, system and network device for performing path computation between autonomous systems
WO2010034225A1 (en) Method for generating item information of transfer table, label switching router and system thereof
WO2008154848A1 (en) Method for acquiring ability information of net node between domains, net node and communication system
WO2008000125A1 (en) A method, system and apparatus for discovering path computation element
CN109150716A (en) Change in topology response method, path calculating client and path computing system
CN102480406B (en) Method and system for building cross-domain end-to-end two-way label switching path
CN105684362B (en) Interworking between a first protocol entity of a stream reservation protocol and a second protocol entity of a routing protocol
US11824763B2 (en) Filtering topologies for path computation in massively scaled networks
WO2012079421A1 (en) Method for processing inter-domain link state information and path computation element
US8798050B1 (en) Re-optimization of loosely routed P2MP-TE sub-trees
WO2016065635A1 (en) Network path optimization apparatus and method

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07764156

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 07764156

Country of ref document: EP

Kind code of ref document: A1