期刊文献+

一个有效的延迟费用受限的多路径算法 被引量:2

An Efficient Algorithm for Multiple Shortest Path under Delay and Cost Constraints
在线阅读 下载PDF
导出
摘要 在集成网络中 ,服务质量 (QoS)的一个重要方面是寻找满足端到端约束的可行路径 ,从而有效利用网络资源。考虑端到端的延迟约束和传输费用 ,对宽度优先算法 (BFS)进行扩展 ,提出了满足延迟约束多路径算法K_DCP,并对其进行改进 ,得到多路径算法K_EDCP。仿真结果显示 。 In integrated network,a crucial aspect of Quality of Service(QoS)is to find multiple shortest feasible paths that meet end to end delay and cost constraints.This paper expands Breadth First Search(BFS) algorithm,and proposes a multiple feasible paths algorithm under delay constraints(KDCP).The KDCP algorithm is then extended as KEDCP to get paths under delay and cost constraints.Simulation result shows the two algorithms have well performance compared with other mimetic algorithms.
出处 《计算机应用研究》 CSCD 北大核心 2004年第7期222-224,共3页 Application Research of Computers
关键词 服务质量 路由 延迟约束 多媒体 Quality of Service(QoS) Routing Delay Constraints Multimedia
  • 相关文献

参考文献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.

同被引文献14

  • 1杨勇,王雪晶,陈良臣.QoS在IP中的研究和应用[J].计算机技术与发展,2007,17(5):33-36. 被引量:10
  • 2WANG Zheng, CROWCROFT J. Quality-of-service routing for supporting multimedia applications [ J] . IEEE Journal on Selected Areas in Communications, 1996 , 14 ( 7) : 1228 -1234 .
  • 3COSTA L, FDIDA S, DUARTE O. Developing scalable protocols for three-metric QoS routing[ J] . Comp uter Networks, 2002, 39 ( 6 ) :713- 727 .
  • 4COSTA L, FDIDA S, DUARTE O. A scalable algorithmfor link-state QoS-based routing with three metrics[ C] / /Proc of IEEE ICC. 2001:2603- 2607 .
  • 5GOODRIDGE 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.
  • 6GOODRIDGE 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.
  • 7LI 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.
  • 8CUI 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 .
  • 9KORKMAZ 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.
  • 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.

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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