An efficient VP-packing algorithm in ATM self-healing networks

In ATM self-healing networks, the variety of VP bandwidths and the large number of VP connections cause difficulty which is not encountered in SDH self-healing networks. Without a fast and effective VP-packing algorithm, both the restoration speed and the restoration ratio may reduce. The optimum VP-packing algorithm with the highest packing ratio has an exponential computation complexity. Therefore, a sub-optimum VP-packing algorithm is raised by modifying the optimum VP-packing algorithm, which is proven to have a packing ratio that approximates to the highest with a reduced computation complexity. The sub-optimum VP-packing algorithm is effective for source-destination based self-healing and for pre-planned self-healing. For local-local or local-destination bases self-healing, an efficient VP-packing algorithm is advanced which has a polynomial computation complexity. Both theoretical analysis and computer simulation show that the packing ratio by the efficient VP-packing algorithm is often near the highest.