摘要： 为满足新一代互联网上各业务的服务质量(QoS)要求,设计一种多约束剪枝QoS 路由算法PF-MCP,采用 剪枝算法思想,综合考虑带宽、时延和抖动多重QoS 约束,引入惩罚因子进行综合评价找出多条有效路径并从中选 取最优路径。采用固定和随机网络层拓扑进行仿真实验,结果表明,与合成优先权值路由算法相比,PF-MCP 算法 在QoS 满意度、服务节点计算能力及时间复杂度方面性能较优,具有路由运算量小、网络恢复能力强及选取的最优 路径可信性高的特点,并且在覆盖网QoS 路由方面适用范围广。
关键词:
覆盖网,
服务质量路由,
多约束,
剪枝算法,
惩罚因子,
网络拓扑
Abstract: In order to fulfill the various Quality of Service(QoS) requirements of new services on the next generation
Internet,this paper proposes a novel overlay QoS routing algorithm,which is named Penalty Factors-Multiple Constraint Pruning(PF-MCP) algorithm. The idea of pruning is applied by PF-MCP to handle multiple QoS constraint,such as bandwidth,delay and jitter. In order to select the optimal solution, penalty factor is introduced by PF-MCP to comprehensively evaluate the effective paths. Simulation experimental results by using fixed and random network layer topology shows that PF-MCP algorithm has higher QoS satisfaction rate,service node computation capability equilibrium and time complexity compared with Synthesize Priority Weight Routing(SPWR) algorithm,it has characteristics of small amount of routing calculation,strong network recovery capability and the optimal path selecting is credible. In summary,PFMCP can effectively fulfill its overlay QoS routing.
Key words:
overlay network,
Quality of Service(QoS) routing,
multiple constraint,
pruning algorithm,
penalty factor,
network topology
中图分类号: