发明名称 DISJOINT PATH COMPUTATION FOR ARBITRARY DIRECTED GRAPH
摘要 Systems and methods for accessing network configuration data identifying one or more working path(s) configured to transport data between source and destination nodes, wherein multiple working paths are prioritized, and including at least one first diversity weight of a first value indicative of at least one communication link in the working path(s), and at least one second diversity weight of a second value indicative of at least one communication link outside of the working path(s); calculating a disjoint protection path with the network configuration data, the first diversity weight, and the second diversity weight; the disjoint protection path including at least the source node and the destination node and at least one communication link that is mutually exclusive from the at least one communication link of the first set; and outputting at least one setup signal to configure the disjoint protection path within the mesh network.
申请公布号 US2015095466(A1) 申请公布日期 2015.04.02
申请号 US201314040912 申请日期 2013.09.30
申请人 Infinera Corp. 发明人 Pithewan Khuzema;Yaaseen Muhammad;Ramamoorthy Rajkumar Pennadam;Misra Mohit
分类号 H04L12/24;H04L12/947 主分类号 H04L12/24
代理机构 代理人
主权项 1. A computer-readable medium, comprising: at least one non-transient memory storing instructions that, when executed by one or more processors, cause the one or more processors to: access network configuration data indicative of a network topology of a mesh network comprising a plurality of nodes and a plurality of communication links configurable to provide optical paths between a source node of the plurality of nodes and a destination node of the plurality of nodes, the network configuration data identifying a working path configured to transport data between the source node and the destination node, the working path having a first set of at least the source node and the destination node of the plurality of nodes and at least one communication link of the communication links, the network configuration data also including at least one first diversity weight of a first value indicative of at least one communication link in the working path, and at least one second diversity weight of a second value indicative of at least one communication link outside of the working path; calculate a disjoint protection path for the working path with the network configuration data indicative of the network topology of the mesh network, the at least one first diversity weight, and the at least one second diversity weight; the disjoint protection path having a second set of (a) nodes including at least the source node and the destination node and (b) at least one communication link that is mutually exclusive from the at least one communication link of the first set; and output at least one setup signal to configure the disjoint protection path within the mesh network.
地址 Annapolis Junction MD US