The diversity of VP bandwidths and the large number of VP connections bring about the difficulty which isn’ t met in SDH self-healing networks. Without a fast and effective VP-packing algorithm

both the restoration speed and restoration ratio may reduce. The optimal VP-packing algorithm is discovered unpractical due to its exponential computation complexity. Therefore an efficient VP-packing algorithm is proposed

which has a polynomial computation complexity and comes to an end in short time. Both theoretical analysis and computer simulation show that the difference between its packing ratio and the maximum packing ratio is slight in general.