CAJ | 학술논문

为满足新一代互联网上各业务的服务质量( QoS)要求,设计一种多约束剪枝QoS路由算法PF-MCP,采用剪枝算法思想,综合考虑带宽、时延和抖动多重QoS约束,引入惩罚因子进行综合评价找出多条有效路径并从中选取最优路径。采用固定和随机网络层拓扑进行仿真实验,结果表明,与合成优先权值路由算法相比,PF-MCP算法在QoS满意度、服务节点计算能力及时间复杂度方面性能较优,具有路由运算量小、网络恢复能力强及选取的最优路径可信性高的特点,并且在覆盖网QoS路由方面适用范围广。
위만족신일대호련망상각업무적복무질량( QoS)요구,설계일충다약속전지QoS로유산법PF-MCP,채용전지산법사상,종합고필대관、시연화두동다중QoS약속,인입징벌인자진행종합평개조출다조유효로경병종중선취최우로경。채용고정화수궤망락층탁복진행방진실험,결과표명,여합성우선권치로유산법상비,PF-MCP산법재QoS만의도、복무절점계산능력급시간복잡도방면성능교우,구유로유운산량소、망락회복능력강급선취적최우로경가신성고적특점,병차재복개망QoS로유방면괄용범위엄。
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,PF-MCP can effectively fulfill its overlay QoS routing.