| 摘要 |
A method of controlling data path routing in a network comprises assigning to a path a priority for connection, reconnection and holding; calculating a route for the path as a series of links between nodes (A to G); allocating resources to the path at each link that it traverses, taking the resources from lower priority paths if required; monitoring for failure of any link and disconnecting any path using the link resulting in path failure according to the holding priority of the path or monitoring for a connect request according to connect priority of the new path; on occurrence of a failure or connect request, searching for a suitable route with free capacity; if no suitable route has free capacity, then searching for a route which has sufficient capacity allocated to paths with a lower holding priority than the reconnect priority of the path where the link has failed, or the connect priority of the new path; taking over at each link the resources of the path with the lower priority, such that the path is re-connected or the new path is connected; and checking that a path with a lower priority whose resources are taken has the lowest holding priority of any such path on each link. <IMAGE> |
