An optimal end-to-end bypass configuration algorithm for self-heating VP-based ATM networks

We consider a semi-dynamic self-healing scheme for asynchronous transfer mode (ATM) networks. In order for this scheme to be effective, backup virtual paths (VPs) must have enough bandwidth for bandwidth capturing when VP failure occurs. We propose a bypass construction algorithm to set up a backup structure for a given virtual channel connection (VCC) in order to maximize the success probability of performing a rapid restoration. We have also considered sequential and parallel implementations of the algorithm. Both guarantee optimal bypass configurations if there is no limit on the search time for backup VPs. If there is a search limit, the time complexities for sequential and parallel implementations are O(h/sup 2/) and O(h) respectively for a VCC of h VPs. If the limits are sufficiently large, the time complexities are O(n/sup 2/h/sup 2/) and O(n/sup 2/h) for a VCC of h VPs and network of n nodes.