期刊文献+

多重链路网络分区与QoS度量两级并行QoSR算法

TWO LEVEL PARALLEL QOSR ALGORITHM BASED ON NETWORK PARTITION
下载PDF
导出
摘要 在多重链路上联网络环境下,采用并行路由搜索的思想寻找最优路径,能够获得较好的路径寻优结果,并且算法的时间复杂度较低。给出一种两级并行QoSR算法,将多重链路环境按一定规则划分为若干分区,为每个分区分配一定数量的QoS度量并行处理器和1个分区处理器,在各个分区分别采用QPAS算法,由QoS度量并行处理器并行计算出各分区内的QoS度量Pareto最佳路径,最终由分区处理器调用最短路径并行算法完成分区间代价最小路径的计算。 In this paper, we provide a two level parallel QoS routing algorithm based on network partition, which divides multiple links network into several route divisions according to connection rules and allocates QoS metrics processors and partitioning processors to each division. Then, we use QPAS algorithm in each division to find respectively the Pareto optimal path of QoS metrics in every division by parallel computing with QoS metrics processors. The result of experiment shows, parallel Pareto route searching can get lower time complexity and better result of routing optimization.
出处 《计算机应用与软件》 CSCD 2009年第4期204-207,共4页 Computer Applications and Software
基金 广东省自然科学基金(05011896) 广东省高校自然科学研究项目(Z03080)
关键词 多重链路网络 并行路由搜索 两级并行 QOS度量 Network partition Pareto route searching Tow level parallel QoS route
  • 相关文献

参考文献7

  • 1秦勇,肖文俊,叶建锋,魏文红.QoS度量帕雷托并行路由快速预计算方法[J].华中科技大学学报(自然科学版),2009,37(1):100-103. 被引量:2
  • 2Qin Yong, Wang Yukun, Zhao Chenggui. Research on a MCOP Algorithm for Optimized Path [ J ]. Journal of Information & Computational Science. 2006,3 (4) :849 - 860.
  • 3Peterson L L, Davie B S. Computer Network : A System Approach [ M ]. 2nd edition. Morgan Kaufmann Publisher, Inc,2000:454 - 457.
  • 4Pitsillides A, Stylianou G, et al. Bandwidth allocation for virtual paths (BAVP) ,investigation of performance of classical constrained and genetic algorithm base optimization techniques[A]. In IEEE INFOCOM 2000[ C]. TelAviv ,2000:1379 - 1387.
  • 5Cui Y, Xu K, Wu J P. Precomputation for multi-constrained QoS routing in high-speed networks [ A ]. IEEE INFOCOM [ C ] ,2003, ( 2 ) : 1414 - 1424.
  • 6冯径,周润芳,顾冠群,冯 径.一种分类预计算QoS路由算法[J].软件学报,2002,13(4):591-600. 被引量:20
  • 7喻建平,李汉兵,程时端,谢维信.点度精确的随机网络模型[J].计算机工程与应用,2002,38(18):172-175. 被引量:1

二级参考文献14

  • 1王朝瑞.图论[M].人民教育出版社,1982..
  • 2Van Mieghem P, Kuipers F A. Concepts of exact QoS routing algorithms [J]. IEEE/ACM Transactions on Networking, 2004, 12(5): 851-864.
  • 3Cui Y, Xu K, Wu J P. Precomputation for multi-constrained QoS routing in high-speed networks [J]. IEEE Infocom, 2003, (2): 1 414-1 424.
  • 4Qin Yong, Wang Yukun, Zhao Chenggui. Research on a MCOP algorithm for optimized path[J]. Journal of Information & Computational Science, 2006, 3(4) : 849-860.
  • 5Zegura E, Calvert K L, Bhattacharjee S. How to model an internetwork [C]// Proceedings of the IEEE Infoeom'96. San Francisco: IEEE Computer Society Press, 1996: 594-602.
  • 6Braden B, Clark R, Shenker S. Integrated services in the internet architecture: an overview [R]. RFC 1633, 1994.
  • 7Black D, Carlson M, Davies E, et al. An architecture for differentiated services[R]. RFC 3475, 1998.
  • 8Guerin R, Orda A, Networks with advance reservations: the routing perspective[C]//Proceedings of the IEEE INFOCOM'00. Israel: IEEE Communication Society, 2000: 118-127.
  • 9Wang Z, Crowcroft J. QoS routing for supporting resource reservation[J]. IEEE J SAC, 1996, 14(7): 1 228-1 234.
  • 10Shaikh A, Rexford J, Shin K G. Evaluating the impact of stale link state on quality-of-service routing [J]. IEEE/ACM Transactions on Networking, 2001(9) : 162-176.

共引文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部