基于路径缓存的并发扩散式服务质量路由算法

Path Caching Based Concurrent Flooding QoS Routing

服务质量路由算法是一种多约束多目标的优化问题 ,该问题属于计算复杂度完全类 ( NP-Complete)问题 .基于一些扩散式服务质量路由算法 ,提出了一种基于路径缓存的并发扩散式服务质量路由算法 ( PCB- CFQR) ,该算法是一种分布式算法 ,它将资源预留、接纳控制和路由选择进行有效的结合 ,能同时完成多个请求的路径建立 ,大大提高路由算法的效率 .分析和仿真结果表明 ,PCB- CFQR算法具有较强的稳定性和实时性 ,与最短最宽 ( WSP)路由算法相比 ,它无须进行路由信息的定时刷新 ,却具有较低的呼叫阻塞率 .

QoS routing is a multi-constraints and multi-objectives optimization problem, which is NP complete. This paper analyzed some flooding QoS routing algorithms and proposed a path caching based concurrent flooding QoS routing algorithm (PCB-CFQR), which combines resource reservation, admission control and QoS path selection together. The PCB-CFQR algorithm can make path selection for multi-requests simultaneously. The simulation results show that PCB-CFQR algorithm is stable and effective, and has lower call blocking rate than WSP routing algorithm.