论文部分内容阅读
通过线性规划研究在自愈ATM网络中使用虚拟路径分析容量问题和流量分配问题。在给定的恢复要求下 ,要求剩余容量代价最小。提出一种新的基于最小代价路由机制的启发式自愈算法 ,较适用于稀疏ATM网络 ,结果显示启发式自愈算法比较有效
Analyze capacity and traffic allocation issues using virtual paths in self-healing ATM networks through linear programming studies. Given the recovery requirements, the minimum remaining capacity is required. A new heuristic self-healing algorithm based on the least cost routing mechanism is proposed, which is more suitable for sparse ATM networks. The results show that the heuristic self-healing algorithm is more effective