有时延约束的路由算法研究
STUDY OF ROUTING ALGORITHMS SUBJECT TO DELAY CONSTRAINT
-
摘要: 高速多媒体网络中的路由问题是有 Qo S约束的路由问题 ,满足一个或多个约束的路由问题是 NP-完全问题 .BG算法是一种有效的启发式算法 ,适用于单约束问题 ,可以得到问题的次优解 .将 BG算法与多标号算法相结合 ,提出了两种改进的多标号算法 .仿真证明文中的算法可以有效地缩小多标号算法搜索范围 ,从而降低算法的复杂度 ,具有一定的实际意义Abstract: In multimedia network the routing problem is subject to QoS constraints. These problems are NP complete. BG heuristic algorithm can find sub optimal paths with one QoS constraint. In this paper improved multi lable algorithms are proposed, which combine the BG algorithm with the multi label algorithm. By reducing the search region of the multi label algorithm, these algorithms can lower the complexity of multi label algorithms.
下载: