首页>
外国专利>
Heuristic multiple paths computation for label switched paths
Heuristic multiple paths computation for label switched paths
展开▼
机译:标签交换路径的启发式多路径计算
展开▼
页面导航
摘要
著录项
相似文献
摘要
In some examples, a path computation device is configured to compute, for a network of routers interconnected by a plurality of links in a network topology and based on a network topology model for the network topology, a first path that is a shortest path of the network topology model between a pair of nodes of the network topology model that represent a pair of the routers; increase, based on the first path, respective metrics for one or more links in the network topology model by respective finite values to obtain a modified network topology model; compute a second path that is a shortest path of the modified network topology model between the pair of nodes; and output data for at least one path of the first path and the second path to the network for programming a label switched path in the network on the at least one path.
展开▼