Broadband ISDN resource management: the role of virtual paths
IEEE Communications Magazine
| Hi-index | 0.02 |
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 exponential computation complexity. Therefore, a sub- optimum VP-Packing algorithm is raised by modifying the optimum VP-Parking algorithm, which is proven to have a packing ratio approximate to the highest with a reduced computation compiexity. The sub-optimum VP- Packing algorithm is affective for source-destination based self-healing and for pre-planned self-healing. For local-local or local-destination based self-healing. an efficient VP-Packing algorithm is advanced which has a polynomia computation complexity. Both theoretical analysis and computer simulation show that the packing ratio by the efficient VP-Packing algorithm is often near the highest.