ATM自愈网中高效VP—Packing算法

在ＡＴＭ网中，ＶＰ带宽的多样性及一条链上ＶＰ数目的大量性，都给ＡＴＭ自佤网带来了ＳＤＨ自愈网中未曾遇到过的困难，若没有一个快捷面又具有高填塞率的ＶＰ＝Ｐａｃｋｉｎｇ算法，自愈网速度将减慢，恢复率将降低，本文指出了最佳ＶＰ＝Ｐａｃｋｉｎｇ算法具有指数级的计算复杂性，进而提出了实用ＶＰ＝Ｐａｃｋｉｎｇ算法，该算法具有多项式的计算复杂性，在极短时间里就可以停止，理论分析和计算机模拟实验结果显示，该算法的

An Efficient VP-Packing Algorithm in ATM Self-Healing Networks

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.