WO2009092246A1 - 路径选择方法及网络***、路径计算模块 - Google Patents

路径选择方法及网络***、路径计算模块 Download PDF

Info

Publication number
WO2009092246A1
WO2009092246A1 PCT/CN2008/073607 CN2008073607W WO2009092246A1 WO 2009092246 A1 WO2009092246 A1 WO 2009092246A1 CN 2008073607 W CN2008073607 W CN 2008073607W WO 2009092246 A1 WO2009092246 A1 WO 2009092246A1
Authority
WO
WIPO (PCT)
Prior art keywords
domain
path
optimal service
inter
service path
Prior art date
Application number
PCT/CN2008/073607
Other languages
English (en)
French (fr)
Inventor
Chuanjun Wu
Xiaobing Zi
Original Assignee
Huawei Technologies Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to JP2010520413A priority Critical patent/JP2010536285A/ja
Priority to EP08871218A priority patent/EP2173069A4/en
Publication of WO2009092246A1 publication Critical patent/WO2009092246A1/zh
Priority to US12/819,778 priority patent/US20100260177A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/42—Centralised routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/44—Distributed routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/645—Splitting route computation layer and forwarding layer, e.g. routing according to path computational element [PCE] or based on OpenFlow functionality

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a path selection method, a network system, and a path calculation module.
  • each node can collect the entire network topology and perform path calculation through OSPF-TE (Open the Shortest Path First with TE), and save the entire network at the node.
  • OSPF-TE Open the Shortest Path First with TE
  • CSPF Constrained Shortest Path First
  • the existing solution is to divide the large network into multiple domains, each domain is configured with a PCE (Path Computation Element), and the PCE is responsible for the path calculation of the domain it manages, and the multi-PCE interaction completes the cross-domain optimal.
  • PCE Principal Computation Element
  • the optimal service path is calculated, which is selected according to the sum of the link costs of the paths, that is, the path whose link cost sum is the minimum is selected as the optimal service path.
  • the PCC Path Computation Client
  • PCEP PCE Communication Protocol
  • PCE calculation After an optimal service path is returned to the PCC, the PCC uses the returned path information to establish an LSP. If you need to obtain the optimal service path across multiple domains, you can perform the optimal service path calculation through the PCE corresponding to the corresponding domain (through the PCEP protocol).
  • segmented path calculation which divides the cross-domain path calculation into multiple path segments separately, calculates all possible paths in each segmented path, and finally calculates the plurality of sub-path segments. It is possible to arrange and combine paths to find the optimal business path.
  • the prior art adopts the segmentation path calculation, but the constraint relationship is not considered in the segmentation calculation, so the calculation amount is large It is also difficult to arrange and combine possible paths and find the optimal service path from them, which ultimately leads to lower efficiency in selecting the optimal service path.
  • the technical problem to be solved by the embodiments of the present invention is to provide a path selection and network system and a path calculation module, which can improve the efficiency of selecting an optimal service path.
  • the embodiment of the present invention provides a path selection method, including: the intermediate domain determines, according to the path cost of the inter-domain link sent by the source node domain, the path cost of the inter-domain link of the intermediate domain to the destination node domain, and then sends the path cost Giving a destination node domain; the intermediate domain receiving an optimal service path of the destination node to the destination node determined by the path cost of the inter-domain link sent by the intermediate domain, and receiving the optimal service path according to the received
  • the optimal service path of the intermediate domain to the destination node is determined and sent to the source node domain, so that the source node domain determines the optimal service path from the source node to the destination node according to the optimal service path sent by the intermediate domain.
  • the embodiment of the present invention provides a network system, including: a source node domain where the source node is located, an intermediate domain, and a destination node domain where the destination node is located; and the intermediate domain receives the path cost of the inter-domain link sent by the source node domain, according to the Determining a path cost of the inter-domain link sent by the source node domain, determining a path cost of the inter-domain link of the intermediate domain to the destination node domain, and transmitting the path cost to the destination node domain; and receiving, by the intermediate domain, the destination node domain Returning an optimal service path of the destination node to the destination node determined by the path cost of the inter-domain link sent by the intermediate domain, and determining that the intermediate domain arrives at the destination node according to the received optimal service path
  • the optimal service path is sent to the source node domain, so that the source node domain determines the optimal service path from the source node to the destination node according to the optimal service path sent by the intermediate domain.
  • An embodiment of the present invention provides a path calculation module, including: a receiving unit, configured to receive a path selection request for a path cost of an inter-domain link sent by a previous domain; and a processing unit, configured to receive, according to the domain received by the receiving unit The path cost of the inter-link determines the path generation of the inter-domain link of the domain to the next domain. a sending unit, configured to send a path cost of the inter-domain link determined by the processing unit to the outside. It can be seen from the above technical solution that the embodiment of the present invention determines the optimal service path by using the path cost of the inter-domain link as a constraint condition, and the process is simpler, and it is not necessary to arrange all possible optimal service paths calculated by each domain. The combination is the final optimal service path, which improves the efficiency of selecting the optimal service path across domains.
  • FIG. 1 is a flowchart of a path selection method according to an embodiment of the present invention.
  • FIG. 2 is a schematic structural diagram of an application scenario according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of a path selection method corresponding to FIG. 2 according to an embodiment of the present invention
  • FIG. 4 is a schematic structural diagram of a network system according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a path calculation module according to an embodiment of the present invention.
  • the embodiments of the present invention provide a path selection method, which can improve the efficiency of selecting an optimal service path.
  • the embodiment of the invention adopts a constraint-based domain calculation method.
  • the calculation result of the previous domain (the path cost of the inter-domain link) is used as the constraint condition, and the optimal service path of the domain is calculated, and the calculation result is used as the constraint condition.
  • the last domain determines the only optimal service path to the destination node and returns to the previous domain.
  • the previous domain determines the unique optimal service path of the domain according to the inter-domain link information, and finally the first one.
  • the domain ie, the source node domain
  • FIG. 1 is a flowchart of a path selection method according to an embodiment of the present invention, including the steps:
  • Step 101 The source node domain sends the determined path cost of the inter-domain link to the intermediate domain.
  • the source node domain After receiving the calculation request of calculating the optimal service path from the source node to the destination node, the source node domain calculates each domain to the intermediate domain. All possible optimal service paths of the boundary node, according to the optimal service path, determining an outgoing link to the intermediate domain (for the intermediate domain, the inbound link from the source node domain to the local domain), that is, the source node domain and The path cost of the inter-domain link of the intermediate domain, and carries the path cost of the inter-domain link when forwarding the calculation request to the intermediate domain.
  • the optimal service path is calculated, which is selected according to the sum of the link costs of each path, that is, selection The path whose sum of link costs is the minimum is taken as the optimal service path.
  • Step 102 The intermediate domain determines a path cost of the inter-domain link between the local domain and the destination node domain according to the path cost of the inter-domain link sent by the source node domain, and sends the path cost to the destination node domain.
  • the intermediate domain determines all possible optimal service paths of each boundary node of the domain to the destination node according to the path cost of the inter-domain link sent by the source node domain, and then determines the path cost of the inter-domain link to the destination node domain, and The path cost is sent to the destination node domain.
  • the intermediate domain contains multiple domains, each of which is bounded by the path cost of the inter-domain link, all possible optimal service paths from the local domain to the boundary nodes of the next domain are calculated, and then the next step is determined.
  • the interdomain link cost of the domain is determined.
  • Step 103 The destination node domain determines an optimal service path from the local domain to the destination node according to the path cost of the inter-domain link sent by the intermediate domain, and returns the intermediate service domain to the intermediate domain.
  • Step 104 The intermediate domain receives the optimal service path returned from the destination node domain, determines an optimal service path of the domain to the destination node, and sends the optimal service path to the source node domain.
  • the intermediate domain After the intermediate domain receives the optimal service path returned from the destination node domain, according to the inter-domain link included in the received optimal service path, all possible boundaries from the previously determined local domain to each boundary node of the destination node domain In the optimal service path, a unique optimal service path from the local domain to the destination node in the local domain is determined, and the only optimal service path from the local domain to the destination node is determined in combination with the received optimal service path.
  • Step 105 The source node domain determines an optimal service path from the intermediate domain to the destination node after receiving the optimal service path returned from the intermediate domain.
  • the source node domain After the source node domain receives the optimal service path returned from the intermediate domain, according to the inter-domain link included in the received optimal service path, all possible boundaries from the previously determined local domain to each boundary node of the destination node domain In the optimal service path, the only optimal service path from the local domain to the destination node in the local domain is determined, and the only optimal service path from the local domain to the destination node is determined in combination with the received optimal service path.
  • FIG. 2 is a schematic structural diagram of an application scenario according to an embodiment of the present invention.
  • the network consists of three domains, each of which includes multiple nodes.
  • the link cost between nodes is 1 and the path calculation modules PCE of the three domains are integrated into the nodes respectively.
  • R12/R22/R31 the nodes R11, R12, R13, and R14 are included, where R12 is the PCE1; in the domain 2, the nodes R21 to R28 are included, where R22 is the PCE2; in the domain 3, the nodes R31 to R38 are included, where R31 is PCE3.
  • Step 301 A path calculation module PCE1 of domain 1 receives a calculation request from a PCC through a PCEP protocol, and requests a calculation from R11 to R34.
  • the PCC mentioned here may be node R11 or network management.
  • Step 302 PCE1 determines a PCE sequence participating in the calculation
  • the PCEl source node R11 and the destination node R34 determine the PCE sequence involved in the calculation, i.e., determine which PCEs to interact with.
  • the PCE sequence participating in the calculation can be determined in a pre-configured manner, and the PCE sequence participating in the calculation can also be determined through the network topology relationship.
  • R11 belongs to domain 1
  • R34 belongs to domain 3
  • R11 needs to go through domain 2 to reach R34 of domain 3.
  • the determined PCE sequence is PCE1 of domain 1, PCE2 of domain 2, and PCE3 of domain 3.
  • Step 303 The PCE1 calculates all possible optimal service paths of the management domain.
  • PCE1 calculates all possible optimal service paths for each of the boundary nodes of the PCE2 management domain (i.e., domain 2) that the administrative domain (i.e., domain 1) arrives.
  • the boundary nodes mentioned here can be obtained according to the network topology relationship.
  • the possible optimal service paths in this embodiment are ((Rll, R12, R21), (Rll, R13, R14, R23), (Rll, R13, R14, R26)).
  • the path cost of (Rll, R12, R21) is 3, the path cost of (Rll, R13, R14, R23) is 4, and the path cost of (Rll, R13, R14, R26) is 4.
  • Step 304 The PCE1 sends a calculation request to the PCE2 through the PCEP protocol, where the inbound link (R12->R21, R14->R26, R14->R23) information of the PCE2 management domain and its path cost information are included; the ingress link R12- The path cost of >R21 is 3, that is, according to (Rll, R12, R21), the path cost of the incoming link R14->R26 is 3, that is, according to (R13, R14, R26), the incoming link R14- The path cost of >R23 is 3, which is derived from (R13, R14, R23).
  • the ingress link of the PCE2 management domain (R12->R21, R14->R26, R14->R23), which is the outgoing link of the PCE 1 management domain.
  • Step 305 PCE2 calculates the path cost of the ingress link (R12->R21, R14->R26, R14->R23) as a constraint condition, and calculates that the management domain (ie, domain 2) reaches the PCE3 management domain (ie, domain 3).
  • the management domain ie, domain 2
  • the PCE3 management domain ie, domain 3
  • the boundary nodes of domain 3 can be obtained according to the network topology relationship.
  • the calculation result of this step PCE2 is (( R12, R21 , R22, R31 ), ( R14, R23 , R24, R25, R35 ), ( R14, R26, R27, R28, R35 ) ).
  • Step 306 The PCE2 sends a calculation request to the PCE3 through the PCEP protocol, where the inbound link (R22->R31, R25->R35, R28->R35) information of the PCE3 management domain and its path cost information are included; the ingress link (R22) -> R31, R25->R35, R28->R35)
  • the path costs are: 3, 4,
  • the ingress link of the PCE3 management domain (R22->R31, R25->R35, R28->R35), which is the outgoing link of the PCE2 management domain.
  • Step 307 The PCE3 calculates the unique optimal service path of the destination node R34 in the local domain by using the path cost of the ingress link (R22->R31, R25->R35, R28->R35) as the constraint condition;
  • the path cost of the ingress link is used as the constraint condition, and the only optimal service path to the destination node can be calculated.
  • the calculation result of PCE3 is (R22, R31, R32, R33, R34), and it is also determined that the inbound link information of the optimal service path to the destination node in this domain is (link R22->R31).
  • Step 308 PCE3 returns a unique optimal service path selection result (R22, R31, R32, R33, R34) to PCE2;
  • Step 309 The PCE2 obtains the inbound link information selected by the PCE3 according to the received optimal service path selection result (link R22->R31), and determines the unique optimality in the local area from all the possible optimal service paths determined previously.
  • the service path information (R12, R21, R22, R31) also determines the inbound link information (link R12->R21) of the best service path to the destination node in the local domain, and selects the optimal service path for the local domain.
  • Step 310 The PCE1 determines, according to the received optimal service path selection result, that the inbound link information selected by the PCE2 is (link R12->R21), and determines the unique optimality in the local area from all the possible optimal service paths determined previously.
  • the service path (Rl l , R12, R21 ) is assembled according to the optimal service path information calculated by PCE2 into an optimal service path from the source node R11 to the destination node R34 (R11, R12, R21, R22, R31, R32, R33, R34).
  • PCE1 determines that the optimal service path from R11 to R34 is (Rll, R12, R21, R22, R31, R32, R33, R34), it is sent to the PCC through the PCEP protocol.
  • the embodiment of the present invention determines the optimal service path by using the path cost of the inter-domain link as a constraint condition, and the process is simpler, and does not need to arrange all possible optimal service paths calculated by each domain as in the prior art.
  • the combination is the final optimal service path, which improves the efficiency of selecting the optimal service path across domains.
  • the embodiment of the present invention provides a network system.
  • FIG. 4 is a schematic structural diagram of a network system according to an embodiment of the present invention.
  • the network system includes: a source node domain 41 where the source node is located, an intermediate domain 42, and a destination node domain 43 where the destination node is located.
  • a source node domain 41 where the source node is located
  • an intermediate domain 42 where the destination node is located
  • a destination node domain 43 where the destination node is located.
  • the intermediate domain 42 receives the path cost of the inter-domain link sent by the source node domain 41, and determines the inter-domain link of the intermediate domain 42 to the destination node domain 43 according to the path cost of the inter-domain link sent by the source node domain 41.
  • the path cost is sent to the destination node domain 43.
  • the intermediate domain 42 receives the optimal service path that the destination node domain 43 reaches the destination node determined by the path cost of the inter-domain link sent by the destination domain 43, and is determined according to the received optimal service path.
  • the intermediate domain 42 reaches the optimal service path of the destination node and sends it to the source node domain 41, so that the source node domain 41 determines the optimal service path from the source node to the destination node according to the optimal service path sent by the intermediate domain 42.
  • the source node domain 41 is a path cost of determining an inter-domain link to the intermediate domain 42 after deriving the service path of each boundary node of the local domain and the intermediate domain 42; the intermediate domain 42 is to obtain the domain and the destination.
  • the service path of each border node of the node domain 43 determines the path cost of the inter-domain link to the destination node domain.
  • the intermediate domain 42 determines the service path in the local domain according to the inter-domain link included in the received optimal service path, and determines the optimality of the intermediate domain 42 to reach the destination node in combination with the received optimal service path. Business path.
  • the source node domain 41 is inter-domain included in the optimal service path sent according to the intermediate domain 42.
  • the link determines a service path in the local domain, and determines an optimal service path from the source node to the destination node in combination with the received optimal service path.
  • the embodiment of the invention further provides a path calculation module.
  • FIG. 5 is a schematic diagram of a path calculation module according to an embodiment of the present invention.
  • the path calculation module includes: a receiving unit 500, a processing unit 501, and a transmitting unit 502.
  • the receiving unit 500 is configured to receive a path selection request for carrying a path cost of the inter-domain link sent by the previous domain.
  • the processing unit 501 is configured to determine, according to the path cost of the inter-domain link received by the receiving unit 500, a path cost of the inter-domain link of the local domain to the next domain.
  • the sending unit 502 is configured to send the path cost of the inter-domain link determined by the processing unit 501 to the outside.
  • the processing unit 501 includes: a first processing unit 5011 and a second processing unit 5012.
  • the first processing unit 5011 is configured to obtain, according to the path cost of the inter-domain link received by the receiving unit 500, the service path of the local domain to each boundary node of the next domain.
  • the second processing unit 5012 is configured to determine, according to the service path that is obtained by the first processing unit 5011 and reach each boundary node of the next domain, a path cost of the inter-domain link to the next domain.
  • the embodiment of the present invention determines the optimal service path by using the path cost of the inter-domain link as a constraint condition, and the process is simpler, and it is not necessary to arrange and combine all possible optimal service paths calculated by each domain.
  • the ultimate optimal business path which improves the efficiency of selecting the optimal business path across domains.

Landscapes

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

Description

路径选择方法及网络***、 路径计算模块
本申请要求于 2007 年 12 月 27 日提交中国专利局、 申请号为 200710305089.2、 发明名称为"路径选择方法及网络***、 路径计算模块 "的中 国专利申请的优先权， 其全部内容通过引用结合在本申请中。
技术领域
本发明涉及通信技术领域，具体涉及一种路径选择方法及网络***、路径 计算模块。
背景技术
目前建立网络连接的方法有多种，可以由网管手工配置，也可以通过信令 协议自动配置。 不管采用什么方法配置连接，都存在一个最优业务路径选择问 题。 在网络 ¾f莫不是很大时， 各个节点可以通过 OSPF-TE ( Open the Shortest Path First with TE, 带流量工程的开放式最短路径优先）收集全网拓朴并进行 路径计算，在节点保存有全网拓朴的情况下， 目前已经出现比较成熟的最优业 务路径计算方法（如 CSPF ( Constrained Shortest Path First, 受限的最短路径优 先）等）。
但随着网络规模的不断扩大，各个节点收集全网拓朴并进行路径计算已经 变得不太现实。 现有的解决方案是把大网络划分为多个域， 每个域配置一个 PCE ( Path Computation Element, 路径计算模块）， 由 PCE负责其所管理域的 路径计算， 多 PCE交互完成跨域最优业务路径计算。 一般计算最优业务路径， 是根据各路径的链路代价之和进行选择，即选取链路代价之和为最小值的路径 作为最优业务路径。
当需要建立一条 LSP ( Label Switch Path, 标签交换路径）时， PCC ( Path Computation Client,路径计算客户）通过 PCEP ( PCE Communication Protocol, PCE通信协议 )协议来向 PCE请求计算最优业务路径， PCE计算一条最优业 务路径后再返回给该 PCC, PCC利用返回的路径信息来建立 LSP。 如果需要 得到跨多个域的最优业务路径，则通过相关域对应的 PCE进行交互（通过 PCEP 协议）完成最优业务路径计算。
目前现有技术采用的一种方法是分段路径计算，将跨域路径计算分成多个 路径段分别进行，在每个分段路径计算所有可能路径， 最后将多个分路径段的 可能路径进行排列组合， 从中寻找最优业务路径。
在对现有技术的研究和实践过程中 , 发明人发现现有技术存在以下问题： 现有技术采用分段路径计算， 但在分段计算时没有考虑其中的约束关系 , 这样计算量会很大，对可能路径进行排列组合并从中寻找最优业务路径也会比 较困难， 从而最终导致选择最优业务路径的效率较低。
发明内容
本发明实施例要解决的技术问题是提供一种路径选择及网络***、路径计 算模块， 能够提高选择最优业务路径的效率。
为解决上述技术问题， 本发明所提供的实施例是通过以下技术方案实现 的：
本发明实施例提供一种路径选择方法， 包括： 中间域根据接收的源节点域 发送的域间链路的路径代价，确定中间域到达目的节点域的域间链路的路径代 价后将其发送给目的节点域；中间域接收目的节点域返回的根据中间域发送的 所述域间链路的路径代价确定的目的节点域到达目的节点的最优业务路径，根 据所述接收的最优业务路径确定中间域到达目的节点的最优业务路径并发送 给源节点域，使得源节点域根据中间域发送的所述最优业务路径确定源节点到 目的节点的最优业务路径。
本发明实施例提供一种网络***： 包括源节点所在的源节点域、 中间域和 目的节点所在的目的节点域；中间域接收所述源节点域发送的域间链路的路径 代价，根据所述源节点域发送的域间链路的路径代价，确定中间域到达所述目 的节点域的域间链路的路径代价后将其发送给所述目的节点域；中间域接收所 述目的节点域返回的才 据中间域发送的所述域间链路的路径代价确定的目的 节点域到达所述目的节点的最优业务路径，根据所述接收的最优业务路径确定 中间域到达所述目的节点的最优业务路径并发送给源节点域，使得源节点域才艮 据中间域发送的所述最优业务路径确定所述源节点到目的节点的最优业务路 径。
本发明实施例提供一种路径计算模块， 包括： 接收单元， 用于接收上一域 发送的携带域间链路的路径代价的路径选择请求； 处理单元， 用于根据所述接 收单元接收的域间链路的路径代价确定本域到达下一域的域间链路的路径代 价； 发送单元， 用于将所述处理单元确定的域间链路的路径代价向外发送。 从上述技术方案可以看出，本发明实施例通过将域间链路的路径代价作为 约束条件确定最优业务路径， 过程更为简单， 不需要对各域计算的所有可能最 优业务路径进行排列组合才得到最终的最优业务路径，从而提高了跨域选择最 优业务路径的效率。
附图说明
图 1是本发明实施例路径选择方法流程图；
图 2是本发明实施例应用场景结构示意图；
图 3是本发明实施例对应图 2的路径选择方法流程图；
图 4是本发明实施例网络***结构示意图；
图 5是本发明实施例路径计算模块示意图。
具体实施方式
本发明实施例提供了提供一种路径选择方法，能够提高选择最优业务路径 的效率。
本发明实施例采用基于约束的分域计算方式。网络中划分的每个域计算最 优业务路径时将上一域的计算结果（域间链路的路径代价）作为约束条件， 计 算出本域的最优业务路径，再将计算结果作为约束条件传递给下一域， 最后的 一个域确定到达目的节点唯一最优业务路径后返回给上一域，上一域根据域间 链路信息确定本域的唯一最优业务路径， 最终由第一个域 (即源节点域）确定 从源节点到目的节点的完整的最优业务路径。以下以确定最优业务路径举例说 明但不局限于此。
请参阅图 1， 是本发明实施例路径选择方法流程图， 包括步骤：
步骤 101、 源节点域将确定的域间链路的路径代价发送给中间域； 源节点域接收到计算源节点到目的节点的最优业务路径的计算请求后，计 算本域到中间域的各边界节点的所有可能最优业务路径，根据所述最优业务路 径确定进入中间域的出链路（对于中间域而言，就是源节点域到本域的入链路 ) 也即源节点域和中间域的域间链路的路径代价，并在向中间域转发计算请求时 携带所述域间链路的路径代价。
一般计算最优业务路径，是根据各路径的链路代价之和进行选择， 即选取 链路代价之和为最小值的路径作为最优业务路径。
步骤 102、 中间域根据源节点域发送的域间链路的路径代价确定本域到目 的节点域的域间链路的路径代价， 并将路径代价发送给目的节点域；
中间域根据源节点域发送的域间链路的路径代价确定本域到目的节点域 各边界节点的所有可能最优业务路径，然后确定到达目的节点域的域间链路的 路径代价， 并将路径代价发送给目的节点域。
如中间域含有多个域， 其中的每个域都以域间链路的路径代价为约束条 件，计算本域到下一域各边界节点的所有可能的最优业务路径， 然后确定到达 下一域的域间链路代价。
步骤 103、 目的节点域根据中间域发送的域间链路的路径代价确定本域到 目的节点的最优业务路径， 并返回给中间域；
步骤 104、 中间域接收从目的节点域返回的最优业务路径后确定本域到目 的节点的最优业务路径并发送给源节点域；
中间域接收从目的节点域返回的最优业务路径后，根据所述接收的最优业 务路径中包括的域间链路，从之前已经确定的本域到目的节点域各边界节点的 所有可能的最优业务路径中，确定从本域到目的节点在本域的唯一最优业务路 径，并结合所述接收的最优业务路径确定从本域到目的节点的唯一最优业务路 径。
步骤 105、 源节点域接收从中间域返回的最优业务路径后确定本域到目的 节点的最优业务路径。
源节点域接收从中间域返回的最优业务路径后，根据所述接收的最优业务 路径中包括的域间链路，从之前已经确定的本域到目的节点域各边界节点的所 有可能的最优业务路径中 , 确定从本域到目的节点在本域的唯一最优业务路 径，并结合所述接收的最优业务路径确定从本域到目的节点的唯一最优业务路 径。
以下进一步结合具体应用实施例进行说明。
请参阅图 2, 是本发明实施例应用场景结构示意图。
如图 2所示， 网络由三个域组成， 各域包括多个节点。 为方便计算， 设各 节点间链路代价都为 1 , 三个域的路径计算模块 PCE 分别集成到节点 R12/R22/R31中。 具体为： 域 1中， 包括节点 Rll、 R12、 R13、 R14, 其中 R12 作为 PCE1; 域 2中， 包括节点 R21到 R28, 其中 R22作为 PCE2; 域 3中， 包括节点 R31到 R38, 其中 R31作为 PCE3。此时需要计算从源节点 R11到目 的节点 R34的跨域最优业务路径。
请参阅图 3，是本发明实施例对应图 2的路径选择方法流程图，包括步骤： 步骤 301、 域 1的路径计算模块 PCE1通过 PCEP协议接收到来自 PCC的计算 请求， 请求计算从 R11到 R34的最优业务路径；
这里所说的 PCC, 可能是节点 R11或者是网管。
步骤 302、 PCE1确定参与计算的 PCE序列；
PCEl 源节点 R11和目的节点 R34确定参与计算的 PCE序列， 即确定需 与哪些 PCE进行交互。 可以通过预先配置的方式确定参与计算的 PCE序列， 也 可以通过网络拓朴关系确定参与计算的 PCE序列。 本发明实施例中 R11属于域 1, R34属于域 3， 从 R11需要经过域 2到达域 3的 R34, 确定的参与计算的 PCE序 列为域 1的 PCE1、 域 2的 PCE2和域 3的 PCE3。
步骤 303、 PCE1计算本管理域的所有可能的最优业务路径；
PCE1计算本管理域（即域 1 )到达 PCE2管理域（即域 2 )的各边界节点的 所有可能的最优业务路径。 这里所说的边界节点可以根据网络拓朴关系获取。 本实施例中可能的最优业务路径为 （（Rll, R12, R21 )、 (Rll, R13, R14, R23)、 (Rll, R13, R14, R26))。 (Rll, R12, R21 )的路径代价为 3， (Rll, R13, R14, R23 ) 的路径代价为 4， (Rll, R13, R14, R26 ) 的路径代价为 4。
步骤 304、 PCE1通过 PCEP协议向 PCE2发送计算请求，其中包含 PCE2管理 域的入链路（R12->R21、 R14->R26、 R14->R23 )信息及其路径代价信息； 入链路 R12->R21的路径代价为 3, 即根据（Rll, R12, R21)得出， 入链 路 R14->R26的路径代价为 3， 即根据（R13, R14, R26)得出，入链路 R14->R23 的路径代价为 3， 即根据 (R13, R14, R23 )得出。
PCE2管理域的入链路（R12->R21、 R14->R26、 R14->R23 ), 也就是 PCE 1 管理域的出链路。
步骤 305、 PCE2以入链路（R12->R21、 R14->R26、 R14->R23 )的路径代 价作为约束条件， 计算本管理域（即域 2)到达 PCE3管理域（即域 3) 的各边 界节点的所有可能的最优业务路径信息；
域 3的边界节点可以根据网络拓朴关系获取。 该步骤 PCE2的计算结果为 ( ( R12, R21 , R22, R31 )、 ( R14, R23 , R24, R25, R35 )、 ( R14, R26, R27, R28, R35 ) )。
步骤 306、 PCE2通过 PCEP协议向 PCE3发送计算请求，其中包含 PCE3管理 域的入链路（R22->R31、 R25->R35、 R28->R35 )信息及其路径代价信息； 入链路（R22->R31、 R25->R35、 R28->R35 ) 的路径代价分别为： 3、 4、
4。
PCE3管理域的入链路（R22->R31、 R25->R35、 R28->R35 ), 也就是 PCE2 管理域的出链路。
步骤 307、 PCE3以入链路（R22->R31、 R25->R35、 R28->R35 )的路径代 价作为约束条件， 计算到达在本域的目的节点 R34的唯一最优业务路径；
因为是到达一个节点即目的节点， 所述此时以入链路的路径代价作为约 束条件， 可以计算出到达目的节点的唯一最优业务路径。 PCE3的计算结果为 ( R22, R31 , R32, R33 , R34 )， 同时也确定到达目节点最优业务路径在本域 的入链路信息为 （链路 R22->R31 )。
步骤 308、 PCE3向 PCE2返回唯一最优业务路径选择结果（R22， R31 , R32, R33 , R34 ) ；
步骤 309、 PCE2根据接收的最优业务路径选择结果， 获知 PCE3选择的入 链路信息为 （链路 R22->R31 )， 从之前确定的所有可能最优业务路径中确定本 域内的唯一最优业务路径信息 （R12, R21 , R22, R31 ), 同时也确定了到达 目节点最优业务路径在本域的入链路信息（链路 R12->R21 )， 将本域选择的最 优业务路径和 PCE3计算的最优业务路径组合起来得到最优业务路径结果 ( R12, R21 , R22, R31 , R32, R33 , R34 )， 将该最优业务路径结果作为后 面域的最优业务路径信息上报给 PCE1;
步骤 310、 PCE1根据接收的最优业务路径选择结果， 获知 PCE2选择的 入链路信息为（链路 R12->R21 )，从之前确定的所有可能最优业务路径中确定 本域内的唯一最优业务路径（Rl l , R12, R21 ), 并根据 PCE2计算的最优业 务路径信息一起组装成从源节点 R11到目的节点 R34的最优业务路径为（ R11， R12, R21 , R22, R31 , R32, R33 , R34 )。
当 PCE1确定从 Rll到 R34的最优业务路径为 （Rll , R12, R21 , R22, R31， R32, R33 , R34 )后， 通过 PCEP协议发送给 PCC。
可以发现，本发明实施例通过将域间链路的路径代价作为约束条件确定最 优业务路径， 过程更为简单， 不需要象现有技术那样对各域计算的所有可能最 优业务路径进行排列组合才得到最终的最优业务路径，从而提高了跨域选择最 优业务路径的效率。
上述内容详细介绍了本发明实施例路径选择方法， 相应的， 本发明实施 例提供一种网络***。
请参阅图 4, 是本发明实施例网络***结构示意图。
如图 4所示， 网络***包括： 源节点所在的源节点域 41、 中间域 42和目 的节点所在的目的节点域 43。 以下内容描述以确定最优业务路径举例说明但 不局限于此。
中间域 42接收所述源节点域 41发送的域间链路的路径代价，根据所述源 节点域 41发送的域间链路的路径代价确定中间域 42到达目的节点域 43的域 间链路的路径代价后将其发送给目的节点域 43。
中间域 42接收目的节点域 43返回的根据中间域 42发送的所述域间链路 的路径代价确定的目的节点域 43到达目的节点的最优业务路径 , 根据所述接 收的最优业务路径确定中间域 42到达目的节点的最优业务路径并发送给源节 点域 41 , 使得源节点域 41根据中间域 42发送的所述最优业务路径确定源节 点到目的节点的最优业务路径。
其中，所述源节点域 41是得出本域和中间域 42各边界节点的业务路径后 确定到达中间域 42的域间链路的路径代价；所述中间域 42是得出本域和目的 节点域 43各边界节点的业务路径后确定到达目的地节点域的域间链路的路径 代价。
所述中间域 42是根据所述接收的最优业务路径中包括的域间链路确定在 本域的业务路径 , 并结合所述接收的最优业务路径确定中间域 42到达目的节 点的最优业务路径。
所述源节点域 41是根据中间域 42发送的所述最优业务路径中包括的域间 链路确定在本域的业务路径，并结合所述接收的最优业务路径确定源节点到目 的节点的最优业务路径。
本发明实施例还提供一种路径计算模块。
请参阅图 5， 是本发明实施例路径计算模块示意图。
如图 5所示， 路径计算模块包括： 接收单元 500、 处理单元 501和发送单 元 502。
接收单元 500， 用于接收上一域发送的携带域间链路的路径代价的路径选 择请求。
处理单元 501， 用于根据所述接收单元 500接收的域间链路的路径代价确 定本域到达下一域的域间链路的路径代价。
发送单元 502， 用于将所述处理单元 501确定的域间链路的路径代价向外 发送。
所述处理单元 501包括： 第一处理单元 5011和第二处理单元 5012。 第一处理单元 5011， 用于根据所述接收单元 500接收的域间链路的路径 代价得出本域到达下一域各边界节点的业务路径。
第二处理单元 5012, 用于根据所述第一处理单元 5011得出的到达下一域 各边界节点的业务路径确定到达下一域的域间链路的路径代价。
综上所述，本发明实施例通过将域间链路的路径代价作为约束条件确定最 优业务路径， 过程更为简单， 不需要对各域计算的所有可能最优业务路径进行 排列组合才得到最终的最优业务路径，从而提高了跨域选择最优业务路径的效 率。
以上对本发明实施例所提供的一种路径选择及网络***、路径计算模块进 行了详细介绍， 对于本领域的一般技术人员， 依据本发明实施例的思想， 在具 体实施方式及应用范围上均会有改变之处， 综上所述，本说明书内容不应理解 为对本发明的限制。

Claims

权 利 要 求
1、 一种路径选择方法， 其特征在于， 包括：
中间域根据接收的源节点域发送的域间链路的路径代价，确定中间域到达 目的节点域的域间链路的路径代价后将其发送给目的节点域；
中间域接收目的节点域返回的根据中间域发送的所述域间链路的路径代 价确定的目的节点域到达目的节点的最优业务路径，根据所述接收的最优业务 路径确定中间域到达目的节点的最优业务路径并发送给源节点域，使得源节点 域根据中间域发送的所述最优业务路径确定源节点到目的节点的最优业务路 径。
2、 根据权利要求 1所述的路径选择方法， 其特征在于：
所述中间域接收的源节点域发送的域间链路的路径代价是源节点域得出 本域和中间域各边界节点的业务路径后确定；
所述中间域确定中间域到达目的节点域的域间链路的路径代价是中间域 根据所述源节点域发送的域间链路的路径代价得出本域和目的节点域各边界 节点的业务路径后确定。
3、 根据权利要求 1或 2所述的路径选择方法， 其特征在于：
所述中间域根据所述接收的最优业务路径确定中间域到达目的节点的最 优业务路径具体为：
中间域根据所述接收的最优业务路径中包括的域间链路确定在本域的业 务路径，并结合所述接收的最优业务路径确定中间域到达目的节点的最优业务 路径。
4、 根据权利要求 1或 2所述的路径选择方法， 其特征在于：
所述使得源节点域根据中间域发送的所述最优业务路径确定源节点到目 的节点的最优业务路径具体为：
使得源节点域根据中间域发送的所述最优业务路径中包括的域间链路确 定在本域的业务路径，并结合所述接收的最优业务路径确定源节点到目的节点 的最优业务路径。
5、 根据权利要求 1或 2所述的路径选择方法， 其特征在于：
所述中间域为至少两个域时，中间域的各域根据上一域发送的域间链路的 路径代价确定本域到达下一域的域间链路的路径代价后将其发送给下一域。
6、 根据权利要求 1或 2所述的路径选择方法， 其特征在于：
所述中间域为至少两个域时，中间域中与目的节点域相邻的域根据接收的 目的节点域返回的最优业务路径确定本域到达目的节点的最优业务路径并发 送给上一域， 由上一域确定到达目的节点域的最优业务路径并发送给源节点 域。
7、 一种网络***， 其特征在于：
包括源节点所在的源节点域、 中间域和目的节点所在的目的节点域； 所述中间域接收所述源节点域发送的域间链路的路径代价，根据所述源节 点域发送的域间链路的路径代价，确定中间域到达所述目的节点域的域间链路 的路径代价后将其发送给所述目的节点域；
所述中间域接收所述目的节点域返回的根据中间域发送的所述域间链路 的路径代价确定的目的节点域到达所述目的节点的最优业务路径，根据所述接 收的最优业务路径确定中间域到达所述目的节点的最优业务路径并发送给源 节点域，使得源节点域根据中间域发送的所述最优业务路径确定所述源节点到 目的节点的最优业务路径。
8、 根据权利要求 7所述的网络***， 其特征在于：
所述源节点域得出本域和中间域各边界节点的业务路径后确定到达中间 域的域间链路的路径代价；
所述中间域得出本域和目的节点域各边界节点的业务路径后确定到达目 的地节点域的域间链路的路径代价。
9、 根据权利要求 7或 8所述的网络***， 其特征在于：
所述中间域是根据所述接收的最优业务路径中包括的域间链路确定在本 域的业务路径，并结合所述接收的最优业务路径确定中间域到达目的节点的最 优业务路径。
10、 根据权利要求 7或 8所述的网络***， 其特征在于：
所述源节点域是根据中间域发送的所述最优业务路径中包括的域间链路 确定在本域的业务路径，并结合所述接收的最优业务路径确定源节点到目的节 点的最优业务路径。
11、 一种路径计算模块， 其特征在于， 包括：
接收单元，用于接收上一域发送的携带域间链路的路径代价的路径选择请 求；
处理单元，用于根据所述接收单元接收的域间链路的路径代价确定本域到 达下一域的域间链路的路径代价；
发送单元， 用于将所述处理单元确定的域间链路的路径代价向外发送。
12、 根据权利要求 11所述的路径计算模块， 其特征在于， 所述处理单元 包括：
第一处理单元，用于根据所述接收单元接收的域间链路的路径代价得出本 域到达下一域各边界节点的业务路径；
第二处理单元，用于根据所述第一处理单元得出的到达下一域各边界节点 的业务路径确定到达下一域的域间链路的路径代价。
PCT/CN2008/073607 2007-12-27 2008-12-19 路径选择方法及网络***、路径计算模块 WO2009092246A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
JP2010520413A JP2010536285A (ja) 2007-12-27 2008-12-19 経路選択方法及びネットワークシステム、経路計算要素
EP08871218A EP2173069A4 (en) 2007-12-27 2008-12-19 PATH SELECTION PROCEDURE AND NETWORK SYSTEM, PATH CALCULATION ELEMENT
US12/819,778 US20100260177A1 (en) 2007-12-27 2010-06-21 Path selection method and network system, path computation element

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200710305089.2 2007-12-27
CNA2007103050892A CN101471868A (zh) 2007-12-27 2007-12-27 路径选择方法及网络***、路径计算模块

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/819,778 Continuation US20100260177A1 (en) 2007-12-27 2010-06-21 Path selection method and network system, path computation element

Publications (1)

Publication Number Publication Date
WO2009092246A1 true WO2009092246A1 (zh) 2009-07-30

Family

ID=40829005

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/073607 WO2009092246A1 (zh) 2007-12-27 2008-12-19 路径选择方法及网络***、路径计算模块

Country Status (5)

Country Link
US (1) US20100260177A1 (zh)
EP (1) EP2173069A4 (zh)
JP (1) JP2010536285A (zh)
CN (1) CN101471868A (zh)
WO (1) WO2009092246A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102195869A (zh) * 2010-03-01 2011-09-21 中兴通讯股份有限公司 双向回溯路径计算方法及装置
CN102340840A (zh) * 2011-10-19 2012-02-01 北京握奇数据***有限公司 一种建立路由的方法、装置及节点

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101715149B (zh) * 2009-07-21 2013-01-23 北京邮电大学 一种多层多域分布式光网络并行跨域故障恢复方法和装置
EP2476224B1 (en) * 2009-09-11 2014-10-08 Telefonaktiebolaget L M Ericsson (publ) Method and apparatus for path computation element and routing controller cooperation
CN101902406B (zh) * 2010-08-12 2016-03-30 中兴通讯股份有限公司 一种计算路径的方法及装置
US8654649B2 (en) * 2011-07-27 2014-02-18 Cisco Technology, Inc. Reduced topology routing in shared media communication networks
US10505838B2 (en) * 2013-12-19 2019-12-10 Sandvine Corporation System and method for diverting established communication sessions
CN105227461B (zh) * 2014-06-26 2020-03-10 中兴通讯股份有限公司 获取跨域分离路径的方法、路径计算单元
US9876713B2 (en) * 2014-12-31 2018-01-23 International Business Machines Corporation Cross-domain service request placement in a software defined environment (SDE)
CN108574594B (zh) * 2017-03-14 2020-04-03 华为技术有限公司 一种网络业务传输的方法及***
CN110875824B (zh) * 2018-08-30 2023-10-13 华为技术有限公司 一种故障多层链路恢复方法和控制器
CN109656177A (zh) * 2018-12-28 2019-04-19 成都易慧家科技有限公司 一种智能门窗通信***
CN111385198B (zh) * 2018-12-29 2022-05-10 北京华为数字技术有限公司 路径确定方法、装置及通信***
CN111698454B (zh) * 2019-03-12 2022-12-23 浙江宇视科技有限公司 一种动态选择最优路径的域间资源推送方法及装置
CN111181853B (zh) * 2019-12-30 2022-07-01 布比（北京）网络技术有限公司 一种基于区块链的纯分布式数据交换方法及***
CN111770020B (zh) * 2020-06-24 2022-04-12 三明学院 一种基于最优路径选择的网络感知服务组合算法的方法
US11483210B2 (en) * 2020-10-28 2022-10-25 Nokia Solutions And Networks Oy Interdomain path calculation based on an abstract topology
US11968120B2 (en) 2021-08-03 2024-04-23 Cisco Technology, Inc. Adaptive hierarchical service path selection in dynamic edge computing environments
CN114024876B (zh) * 2021-10-15 2023-06-16 中国联合网络通信集团有限公司 一种网络拨测方法、装置、设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001005102A1 (en) * 1999-07-09 2001-01-18 Madge Networks Limited Interconnecting network domains
US20040190445A1 (en) * 2003-03-31 2004-09-30 Dziong Zbigniew M. Restoration path calculation in mesh networks
CN1756233A (zh) * 2004-09-30 2006-04-05 富士通株式会社 电信网络中的路由选择方法和装置
CN101095311A (zh) * 2004-11-05 2007-12-26 思科技术公司 用于使用路径密钥从路径计算元件中取回计算出的路径的***和方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7599349B2 (en) * 2004-01-29 2009-10-06 Cisco Technology, Inc. Computing inter-autonomous system MPLS traffic engineering LSP paths
JP2005252368A (ja) * 2004-03-01 2005-09-15 Nippon Telegr & Teleph Corp <Ntt> 経路計算システム、経路計算方法、及び通信ノード
US8320255B2 (en) * 2005-02-02 2012-11-27 Cisco Technology, Inc. Inter-domain path computation technique
US7701940B2 (en) * 2007-03-09 2010-04-20 Cisco Technology, Inc. Inter-domain point-to-multipoint path computation in a computer network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001005102A1 (en) * 1999-07-09 2001-01-18 Madge Networks Limited Interconnecting network domains
US20040190445A1 (en) * 2003-03-31 2004-09-30 Dziong Zbigniew M. Restoration path calculation in mesh networks
CN1756233A (zh) * 2004-09-30 2006-04-05 富士通株式会社 电信网络中的路由选择方法和装置
CN101095311A (zh) * 2004-11-05 2007-12-26 思科技术公司 用于使用路径密钥从路径计算元件中取回计算出的路径的***和方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2173069A4 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102195869A (zh) * 2010-03-01 2011-09-21 中兴通讯股份有限公司 双向回溯路径计算方法及装置
CN102340840A (zh) * 2011-10-19 2012-02-01 北京握奇数据***有限公司 一种建立路由的方法、装置及节点

Also Published As

Publication number Publication date
CN101471868A (zh) 2009-07-01
EP2173069A1 (en) 2010-04-07
EP2173069A4 (en) 2010-09-01
JP2010536285A (ja) 2010-11-25
US20100260177A1 (en) 2010-10-14

Similar Documents

Publication Publication Date Title
WO2009092246A1 (zh) 路径选择方法及网络***、路径计算模块
USRE47260E1 (en) System and method for point to multipoint inter-domain MPLS traffic engineering path calculation
RU2541940C2 (ru) Способ применения экземпляра службы к сети mpls (варианты) и сеть mpls
King et al. The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS and GMPLS
Li et al. Routing bandwidth guaranteed paths with local restoration in label switched networks
US20160006614A1 (en) Source Routing Using Path Computation Elements
CN101483539B (zh) 一种获取路径的方法、路径计算单元和***
WO2019134639A1 (zh) 实现无缝最优跨域路径的方法、装置、设备及存储介质
US9571381B2 (en) System and method for inter-domain RSVP-TE LSP load balancing
CN101960801A (zh) 用于确定将根节点链接到多个叶节点的点到多点树的技术
JP4971496B2 (ja) イーサネット・スパニング・ツリープロビジョン
CN106063195A (zh) 具有单独控制设备和转发设备的网络中的控制设备发现
WO2009043256A1 (fr) Procédé, système et dispositif d&#39;obtention de trajets à commutation par étiquette
KR20150036404A (ko) 원격통신 네트워크에서 링크―다이버스 트래픽 경로들을 확립하기 위한 방법 및 관련 장치
WO2017211164A1 (zh) 一种确定跨域标签交换路径隧道的方法、设备和***
CN110099002B (zh) 一种路径计算方法及装置
US7742477B1 (en) Interconnectivity between autonomous systems
WO2019006704A1 (zh) 一种路径计算的方法、装置和***
Fang et al. Interprovider IP-MPLS services: requirements, implementations, and challenges
WO2015024440A1 (zh) 一种获取ip链路的链路开销值的方法及***
Goulamghoss et al. Analysis of traffic engineering and fast reroute on multiprotocol label switching
Lara et al. Inter-domain routing with cut-through switching for the mobilityfirst future Internet architecture
Brandt Auto-bandwidth control in dynamically reconfigured hybrid-SDN MPLS networks
CN103581017B (zh) 路径段信息的传递方法及装置
JP2005210556A (ja) データ転送装置および制御装置

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

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2010520413

Country of ref document: JP

WWE Wipo information: entry into national phase

Ref document number: 2008871218

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE