首页>
外国专利>
METHOD AND APPARATUS FOR SELECTING MAXIMALLY DISJOINT SHORTEST PATHS IN A NETWORK
METHOD AND APPARATUS FOR SELECTING MAXIMALLY DISJOINT SHORTEST PATHS IN A NETWORK
展开▼
机译:网络中最大不连续最短路径的选择方法和装置
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method for selecting two maximally disjoint shortest paths between a source node and destination node in a network is provided. The method comprises determining a first explicit route between the source and destination nodes by using an original link cost for each link in the network, transforming the network by introducing conditional link costs, determining a second explicit route between the source and destination nodes in the transformed network taking into account the conditional link costs, and determining the two maximally disjoint shortest paths between the source and destination nodes by coalescing the first and second explicit routes. Beneficially, the step of introducing conditional link costs comprises adding additional parameters to links in the network and determining the conditional link costs depending on the position of each link relative to the first explicit route. Corresponding method for determining "N" maximally disjoint paths in a network, wherein "N" is equal or greater than two, is also provided.
展开▼