论文部分内容阅读
在ATM网中，VP带宽的多样性以及一条链上VP数目的大量性，都给ATM自愈网带来了SDH自愈网中未曾遇到过的困难若没有一个快捷而又具有高填塞率的VP－Packing算法，自愈网速度将减慢，恢复率将降低本文指出了最佳VP-Packing算法具有指数组的计算复杂性，进而提出了实用VP-Packing算法，该算法具有多项式的计算复杂性，在极短时间里就可以停止，理论分析和计算机模拟实验结果显示，该算法的填塞率与最大填塞率常常十分接近。
In the ATM network, the diversity of the VP bandwidth and the large number of VPs in a chain all bring difficulties to the ATM self-healing network that have not been encountered in the SDH self-healing network. If there is not a quick but high packing rate VP-Packing algorithm, the speed of self-healing network will be slowed and the recovery rate will be reduced. This paper points out the computational complexity of the VP-Packing algorithm with exponential group, and then put forward a practical VP-Packing algorithm, which has polynomial calculation The complexity can be stopped in a very short period of time. Theoretical analysis and computer simulation results show that the packing ratio and the maximum packing ratio are often very close.