论文部分内容阅读
面向连接的ATM 网络为保证多种用户服务质量,要求建立的连接满足一个或多个约束的同时优化网络资源,这已经被证明是NP完全问题.本文提出了一种改进的多标号算法,用于解决ATM 网络中多个约束条件下的最优路径选择问题.该改进算法可以在多项式级的复杂度内找出任意近似程度的最优路径.对于一个200 个节点的具体网络,实际运算结果表明,本文所提算法的循环次数减小到原始多标号法的1/3 以下.
Connection-oriented ATM networks In order to ensure the service quality of multiple users, the requirement to establish one connection to satisfy one or more constraints while optimizing network resources has proved to be NP-complete. In this paper, an improved multi-label algorithm is proposed to solve the optimal routing problem under multiple constraints in ATM networks. The improved algorithm can find the optimal path of any degree of approximation in polynomial-level complexity. For a specific network with 200 nodes, the actual operation results show that the proposed algorithm reduces the number of cycles to less than 1/3 of the original multi-label method.