摘要: 研究了多限制路径选择问题,提出了一种基于选择性探通术的分布式的、启发式的服务质量路由算法。算法采用探测包并行地搜索可行路径,并使用启发式函数随机选择下一跳节点。计算机仿真表明算法是有效的、可扩展的,并能提供满意的呼叫阻塞性能。
关键词:
服务质量路由;多限制路径;分布式;启发式;选择性探通术
Abstract: This paper discusses the NP-complete multi-constrained path problem, and a distributed heuristic algorithm based on selective probing is presented. This algorithm employs probes to search feasible paths in parallel, and uses heuristic functions to randomly select a suitable next node.Simulation results indicate that the presented solution is efficient, scaleable, and can provide satisfying call block performance
Key words:
QoS routing; Multi-constrained path; Distribute; Heuristic; Selective probing
金 鑫,刘贤德,肖诗源. 基于选择性探通术的多限制路径路由算法[J]. 计算机工程, 2006, 32(10): 89-90,104.
JIN Xin, LIU Xiande, XIAO Shiyuan. A Routing Algorithm Based on Selective Probing for Multi-constrained Path[J]. Computer Engineering, 2006, 32(10): 89-90,104.