期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

QoS度量帕雷托并行路由快速预计算方法 被引量：2

Fast pre-computing parallel routing using pareto of QoS matrices
原文传递
导出
摘要 针对多重链QoS路由问题,在给出QoS度量的串行寻优算法的基础上,给出一种QoS度量帕雷托并行路由快速预计算方法,此方法为q个QoS度量分配q个处理器,并行计算出满足路由请求约束可行路径的帕雷托子集,在帕雷托子集中综合选择合适的转发路由.实验结果显示该方法能够较好地进行路径寻优,并且算法的复杂度较低,可用于解决有限节点网络的复杂QoS路由问题. The method of pre-computing for parallel computing based on QoS matrices is proposed. To allocate q processors for q QoS metrics. The Pareto subsets of feasible route which satisfy routing request constraints will be taken into parallel compute and the optimum route will be selected among the Pareto subsets. The experimental results show this method can search the optimum path and the complexity is lower. So, it can be used for solving the complex QoS routing problem of network with finite nodes.
作者 秦勇 肖文俊 叶建锋 魏文红
机构地区 茂名学院信息与网络中心 华南理工大学计算机科学与工程学院 太原理工大学计算机与软件学院
出处 《华中科技大学学报（自然科学版）》 EI CAS CSCD 北大核心 2009年第1期100-103,共4页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金 广东省自然科学基金资助项目(05011896) 广东省教育厅自然科学基金资助项目(Z03080)
关键词 路由优化 并行路由搜索 服务质量度量 帕雷托子集 负载平衡 routing optimization qarallel routing search QoS （quality of service） matrices paretosubsets load balancing
分类号 TP393.02 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献12

  • 1崔勇,吴建平,徐恪,徐明伟.互联网络服务质量路由算法研究综述[J].软件学报,2002,13(11):2065-2075. 被引量：73
  • 2Braden B, Clark R, Shenker S. Integrated services in the internet architecture: an overview [R]. RFC 1633, 1994.
  • 3Black D, Carlson M, Davies E, et al. An architecture for differentiated services[R]. RFC 3475, 1998.
  • 4Guerin R, Orda A, Networks with advance reservations: the routing perspective[C]//Proceedings of the IEEE INFOCOM'00. Israel: IEEE Communication Society, 2000: 118-127.
  • 5Wang Z, Crowcroft J. QoS routing for supporting resource reservation[J]. IEEE J SAC, 1996, 14(7): 1 228-1 234.
  • 6Shaikh 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.
  • 7Avadora D. Dallas: dynamic widest path selection for connection admission control in core-stateless networks[J]. IEEE Computer Society, 2004(10): 102- 111.
  • 8Van Mieghem P, Kuipers F A. Concepts of exact QoS routing algorithms [J]. IEEE/ACM Transactions on Networking, 2004, 12(5): 851-864.
  • 9Cui 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.
  • 10Qin Yong, Wang Yukun, Zhao Chenggui. Research on a MCOP algorithm for optimized path[J]. Journal of Information & Computational Science, 2006, 3(4) : 849-860.

二级参考文献46

  • 1Crawley, E., Nair, R., Rajagopalan, B. et al. A framework for QoS-based routing in the Internet. RFC 2386, 1998.
  • 2Lee, W.C., Hluchyi, M.G., Humblet, P.A. Routing subject to quality of service constraints integrated communication networks. IEEE Network, 1995,9(4):46～55.
  • 3Quality of service??glossary of terms. QoS Forum. 1999. http://www.qosforum.com.
  • 4Apostolopoulos, G., Guerin, R., Kamat, S. Implementation and performance measurements of QoS routing extensions to OSPF. In: Doshi, B., ed. Precedings of the IEEE INFOCOM'99. New York, NY: IEEE Communication Society, 1999. 680～688.
  • 5Orda, A., Sprintson, A. QoS routing: the precomputation perspective. In: Sidi, M., ed. Proceedings of the IEEE INFOCOM 2000. Israel: IEEE Communication Society, 2000. 128～136.
  • 6Garey, M.S., Johnson, D.S. Computers and intractability: a guide to the theory of NP-completeness. Oxford: Freeman, W.H., 1979.
  • 7Hao, F., Zegura, E.W. On scalable QoS routing: performance evaluation of topology aggregation. In: Sidi, M., ed. Proceedings of the IEEE INFOCOM 2000. IEEE Communication Society, 2000. 147～156.
  • 8Shaikh, A., Rexford, J., Shin, K.G. Evaluating the impact of stale link state on quality-of-service routing. IEEE/ACM Transactions on Networking, 2001,9(2):162～176.
  • 9Chen, S., Nahrstedt, K. An overview of quality-of-service routing for next-generation high-speed networks: problems and solutions. IEEE Network, 1998,12(6):64～79.
  • 10Wang, B., Hou, J.C. Multicast routing and its QoS extension: problems, algorithms, and protocols. IEEE Network, 2000,14(1): 22～36.

共引文献88

同被引文献8

  • 1Qin Yong, Wang Yukun, Zhao Chenggui. Research on a MCOP Algorithm for Optimized Path [ J ]. Journal of Information & Computational Science. 2006,3 (4) :849 - 860.
  • 2Peterson L L, Davie B S. Computer Network : A System Approach [ M ]. 2nd edition. Morgan Kaufmann Publisher, Inc,2000:454 - 457.
  • 3Pitsillides 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.
  • 4Cui Y, Xu K, Wu J P. Precomputation for multi-constrained QoS routing in high-speed networks [ A ]. IEEE INFOCOM [ C ] ,2003, ( 2 ) : 1414 - 1424.
  • 5Pitsillides A, Stylianou G. Bandwidth allocation for virtual paths (BAVP), investigation of performance of classical constrained and genetic algorithm base optimization techniques [ A ]. Proceedings of IEEE Infocom 2000 [ C ]. TelAviv: The IEEE Infocom 2000, 2000. 1379 - 1387.
  • 6Bernard M W. Routing of multipoint connections[ J]. IEEE Journal on Selected Areas in Communications, 1988, 6(9) : 1617 - 1622.
  • 7冯径,周润芳,顾冠群,冯 径.一种分类预计算QoS路由算法[J].软件学报,2002,13(4):591-600. 被引量：20
  • 8喻建平,李汉兵,程时端,谢维信.点度精确的随机网络模型[J].计算机工程与应用,2002,38(18):172-175. 被引量：1

引证文献2

华中科技大学学报（自然科学版）
2009年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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