摘要
针对大多数Q oS路由选择算法所存在的问题,采用多目标规划和业务区分的方法建立了满足多Q oS需求和网络资源利用率的路由选择数学模型,对F a llback+算法作了进一步扩充和改善.提出了一种新的F a llback++算法,它不仅能满足多Q oS约束,而且能高效地利用网络通信资源.分析得出该算法的时间复杂度和空间复杂度均为O(n*N2).仿真实验验证了该模型和算法的有效性和正确性.
Confronted with the problems of most routing algorithms with multiple QoS constrains, the mathematical model of routing is set up by the way of the multiobjective programming and differentiated transactions, which can be met with multiple QoS requirements and network resource utility rate. To extend and improve the Fallback ＋ algorithm further, a new Fallback ＋＋ algorithm has been proposed, which can not only meet with multiple QoS requirements but also utilize network resource efficiently. The time complexity and space complexity of the algorithm are all analyzed as O（n ＊ N^2）. The efficiency and correctness of the model and algorithm are verified by the simulation.
出处
《大连理工大学学报》
EI
CAS
CSCD
北大核心
2006年第4期605-610,共6页
Journal of Dalian University of Technology
基金
辽宁省自然科学基金资助项目(20022148)
关键词
多目标规划
业务区分
多QOS约束
路由算法
仿真
multiobjective programming
differentiated transactions
multiple QoS constrainsrouting algorithm
simulation
