计算机科学 ›› 2015, Vol. 42 ›› Issue (1): 126-128.doi: 10.11896/j.issn.1002-137X.2015.01.030
易猛,陈庆奎,章刚,赵海燕
YI Meng, CHEN Qing-kui, ZHANG Gang and ZHAO Hai-yan
摘要： 目前Internet网络环境下,网络参数的随时变化容易造成路由过期,从而使提供的QoS路由无效,为此提出了一种适合参数动态变化的单播QoS路由算法(DPA),该算法在路径代价随时间不断变化的情况下能够自主地选择最优路由节点,解决多约束QoS单播路由选择不精确的问题。实验表明,本路由算法自适应性和扩展性较好,同时在路由选择方面比传统的路由算法能够提供更好的QoS路由。
| [1] SonT A,An L,Khadraoui D,et al.Solving QoS routing prob-lems by DCA [J].Intelligent Information and Database Systems,2010,5991:460-470 [2] Ridhawi Y,Kandavanam G,Karmouch A.A dynamic hybridservice overlay network for service compositions[C]∥The 2011 World Congress in Computer Science,Computer Engineering,and Applied Computing.Las Vegas,Nevada,2011 [3] 林闯,单志广,任丰原.计算机网络的服务质量(QoS)[M].北京:清华大学出版社,2004 [4] Xu W,He S,Song R,et al.Finding the K shortest paths in a schedule -based transit network,Comput[J].Oper.Res.,2012,39(8):1812-1826 [5] Yang H H,Chen Y L.Finding K shortest looping paths in atraffic-light network[J].Computers & Operations Research,2005,32(3):571-581 (下转第141页)(上接第128页) [6] 郑彦兴,田菁,窦文华.基于Pareto最优的QoS路由算法[J].软件学报,2005,16(8):1484-1489 [7] 陈萍,董天临,石坚,等.一种基于概率的QoS单播路由算法[J].软件学报,2003,14(3):582-584 [8] Korkmaz T,Krunz M.Bandwidth-delay con-strained path selection under inaccurate state information[J].IEEE/ACM Tran-sactions on Networking,2003,11 (3):384-398 [9] Cohen A,Korach E,Last M,et al.A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communi-cation networks[J].Fuzzy Sets and Systems,2005(150):401-417 [10] Narvaez P,Siu K Y,Tzeng H Y.New dynamic SPT algorithm based on a ball-and-string model[J].IEEE ACM Trans.Network,2001,9(6):706-718 [11] 邹亮,徐建闽.基于遗传算法的动态网络中最短路径问题算法[J].计算机应用,2005,25(4):742-744 [12] Chabini I,Shan L.Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks[J].IEEE Intelligent Transportation Systems Society,2002,3(1):60-74 [13] 邹亮,徐建闽.A*算法改进及其在动态最短路径问题中的应用[J].深圳大学学报:理工版,2007,7(1):32-36 [14] Tian Ye,Chiu Yi-chang,Gao Yang.Variable time discretization for a time-dependent shortest path algorithm[C]∥14th International IEEE Conference on Intelligent Transportation Systems (ITSC).2011:588-593 [15] 秦勇,肖文俊.一种基于QoS度量的Pareto并行路由寻优方法[J].计算机学报,2009,2(3):463-472 [16] 雍龙泉,邓方安.极大熵和声搜索算法求解多目标优化[J].计算机应用研究,2011,8(10):3653-3655 [17] Xiao,Cao Jian-nong .An Efficient Algorithm for Dynamic Shortest Path Tree Update in Network Routing[J].Journal of communication and networks,2007,9(4):409-510 |
| No related articles found! |
|
||
首页