公开(公告)号：US20050237950A1

公开(公告)日：2005-10-27

申请号：US11114564

申请日：2005-04-25

申请人： Shengli Yuan ,  Jason Jue

发明人： Shengli Yuan ,  Jason Jue

IPC分类号： H04J1/16 ,  H04J3/14 ,  H04J14/02 ,  H04L1/00 ,  H04L12/26 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04J14/0283 ,  H04J3/14 ,  H04J14/0227 ,  H04J14/0241 ,  H04J14/0284 ,  H04J14/0291 ,  H04L45/00 ,  H04L45/124 ,  H04L45/22 ,  H04L45/28

摘要： The present invention provides a system, method and apparatus for dynamic path protection in networks by finding two paths between a source node and a destination node in a network having multiple nodes and multiple links. A first path is found between the source node and the destination node using a routing algorithm and a model of the network. Each link has a cost and at least one risk identifier. The cost of the links having one or more risk identifiers that occur more than once in the network model are increased. The model is modified by removing all links in the first path and all links having one or more risk identifiers in common with any of the risk identifiers of the links in the first path. The second path is found between the source node and the destination node using the routing algorithm and the modified model.

摘要翻译： 本发明通过在具有多个节点和多个链路的网络中找到源节点和目的节点之间的两条路径来提供一种用于网络中动态路径保护的系统，方法和装置。 使用路由算法和网络模型，在源节点和目标节点之间找到第一条路径。 每个链路都具有成本和至少一个风险标识符。 具有在网络模型中出现多于一次的一个或多个风险标识符的链路的成本增加。 通过删除第一路径中的所有链接和具有与第一路径中的链接的任何风险标识符相同的一个或多个风险标识符的所有链接来修改该模型。 使用路由算法和修改的模型，在源节点和目的节点之间找到第二条路径。