Patent ID: 8345538
Filing Date: 2013-01-01
Classification: H04J,H04L,H04Q

Abstract:
1. An apparatus for finding a pair of disjoint paths in a network, comprising: topology information including, for each link connecting a pair of nodes in the network, a link identifier identifying the pair of nodes, a link-cost assigned to the each link, and direction of data transmission; a first search unit configured to find a first path having the minimum total link-cost by searching, based on the topology information, a plurality of paths passing from a source node to a destination node in the network; port information including, for each restricted node along the first path, one or more restriction conditions on connectivity among ports within the each restricted node, the each restricted node being a node in which the one or more restriction conditions are imposed on connectivity among ports within the node; a topology change unit configured to change the topology information so that the first path is not searched for as a path having the minimum total link-cost among the plurality of paths; a port change unit configured to change the port information based on a port connectivity change rule; a second search unit configured to find a second path having the minimum total link-cost by searching the plurality of paths, based on the changed port information and the changed topology information; and a disjoint path reconfiguring unit configured to reconfigure a pair of link-disjoint paths that do not share a link with each other and satisfy the one or more restriction conditions imposed on connectivity among ports within the restricted node, by removing a link shared by both the first and second paths from the original topology information.