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

一个效率可观的启发式多约束QoS路由算法 被引量：2

Efficient heuristic multi-constrained QoS routing
下载PDF
导出
摘要 提出的MWA_MCP(maximal weightamputation for multi-constrained problem)算法,充分利用了BFS(breadfirst search)算法计算复杂度简单的特点,使用BFS搜索QoS路径。MWA_MCP在搜索过程中有选择地去掉QoS性能差的边,即权重较大的边将在搜索中有策略地被去掉。与仿真的几个算法相比,MWA_MCP体现了较高的路由性能。 MWA_MCP advanced took full advantage of the simplicity of BFS. It adopted the policy of forward BFS and backward BFS. In order to search for different paths next time, MWA_MCP memorized special values of QoS measures or any other values of link states which might affect routing.
作者 王宇 许都 王宏 李乐民
机构地区 电子科技大学宽带光纤传输与通信网技术教育部重点实验室
出处 《计算机应用研究》 CSCD 北大核心 2008年第2期345-347,358,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(60372011)
关键词 服务质量 服务质量路由 多约束服务质量路由 QoS QoS routing multi-constrained QoS routing
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献10

  • 1WANG Zheng, CROWCROFT J. Quality-of-service routing for supporting multimedia applications [ J] . IEEE Journal on Selected Areas in Communications, 1996 , 14 ( 7) : 1228 -1234 .
  • 2COSTA L, FDIDA S, DUARTE O. Developing scalable protocols for three-metric QoS routing[ J] . Comp uter Networks, 2002, 39 ( 6 ) :713- 727 .
  • 3COSTA L, FDIDA S, DUARTE O. A scalable algorithmfor link-state QoS-based routing with three metrics[ C] / /Proc of IEEE ICC. 2001:2603- 2607 .
  • 4GOODRIDGE W, ROBERTSON W, PHILLIPS W J, et al. Heuristic constraint-path routing decision system[ C] / /Proc of the 3rd Annual Communication Networks and Services Research Conference ( CNSR ’05 ) . 2005.
  • 5GOODRIDGE W, ROBERTSON W, PHILLIPS W J, et al. Traffic driven multiple constraint optimization for QoS routing[ J] . International Journal of Internet Protocol Technology, 2005, 1( 1) : 19- 29.
  • 6LI Zhen-jiang, GARCIA-LUNA-ACEVES J J. Solving the multi-constrained path selection problem by using depth first search[ C] / /Proc of the 2nd Int’l Conf on Quality of Service in Heterogeneous Wired/Wireless Networks( QShine’05 ) . 2005.
  • 7CUI Yong, XU Ke, WU Jian-ping. Adjustable multi-constrained routing with a novel evaluation method[ C] / / Proc of IPCCC’03. Phoenix: [ s. n. ] , 2003: 141-148 .
  • 8KORKMAZ T, KRUNZ M. A randomized algorithm for finding a path subject to multiple QoS requirements[ J] . Computer Networks, 2001, 3 6( 2 /3) : 251- 268.
  • 9余健,陈琳,杨志云,徐正全.一个有效的延迟费用受限的多路径算法[J].计算机应用研究,2004,21(7):222-224. 被引量：2
  • 10CASETTI C, CIGNO R L, MELLIA M, et al. A new class of QoS routing strategies based on network graph reduction[ J] . Computer Networks, 2003 , 41( 4) : 475- 487.

二级参考文献8

  • 1Turgay Korkmaz,Marwan Krunz.A Randomized Algorithm for Finding a Path Subject to Multiple QoS Requirements[J].Computer Networks,2001,36:251-268.
  • 2Turgay Korkmaz,Marwan Krunz,Spyros Tragoudas.An Efficient Algorithm for Finding a Path Subject to Two Additive Constraints[J].Computer Communications,2002,25:225-238.
  • 3V P Kompella,J C Pasquale,G C Polyzos.Multicast Routing for Multimedia Communication[J].IEEE/ACM Transactions on Networking,1993,1(3):286-292.
  • 4Q Zhu,M Parsa,J J Garcial-Luna-Aceves.A Source-based Algorithm for Delay-Constrained Minimum-cost Multicasting[C].IEEE INFOCOMO,1995.377-385.
  • 5A L Roginsky,K J Christensen B,V Srinivasan.New Methods for Shortest Path Selection for Multimedia Traffic with Two Delay Constraints[J].Computer Communications,1999,22:1531-1539.
  • 6X Yuan,A Saifee.Path Selection Methods for Localized Quality of Service Routing[R].TR-010801.Dept.of Computer Science,Florida State University,2001.
  • 7Jzau-sheng Lin,Ming-shou Liu,Nen-fu Huang.The Shortest Path Computation in MOSPF Protocol Using an Annealed Hopfield Neural Network with a New Cooling Schedule[J].Information Science,2000,129:17-30.
  • 8Chor Ping Low.Loop-free Multicast Routing with End-to-end Delay Constraint[J].Computer Communications,1999,22:181-192.

共引文献1

同被引文献12

引证文献2

二级引证文献1

计算机应用研究
2008年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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