期刊文献+

结合网络资源开销估算的QoS改进路由算法 被引量:1

An Improved QoS Routing Algorithm with Respect to the Cost of Network Resource
下载PDF
导出
摘要 本文根据网络的实际运作环境 ,提出了两个衡量网络资源利用情况的函数 ,并将之结合到 Qo S理论路由算法中 ,改进后的算法较好地考虑了带宽资源利用和网络负荷的均衡度 . In this paper, Two functions are defined that can be used to weigh the cost of bandwidth and the balance of network load. Improved randomized QoS routing algorithms with respect to the cost of resources are proposed. Simulative result indicate the modified algorithm can improve the resource utility and get more balanced use of network.
出处 《小型微型计算机系统》 CSCD 北大核心 2002年第5期521-523,共3页 Journal of Chinese Computer Systems
基金 海外青年学者合作研究基金 (编号 :6992 82 0 1)项目资助
关键词 网络资源开销估算 QOS 路由算法 随机算法 服务质量 计算机网络 QoS Routing randomized algorithm efficiency use of resource
  • 相关文献

参考文献7

  • 1A.Orda,Routing with end to end QoS guarantees in broadband networks[J].IEEE/ACM Transactions on Networking 7,1999 : 365~374
  • 2R.Guerin,A.Orda,D.Williams.QoS routing mechanisms and OSPF extensions[C],Proc.2nd IEEE Global Internet Mini-Conference,(1997),Phoenix,AZ
  • 3R.Guerin ,A.Orda.QoS-based routing in networks with inaccurate information: theory and algorithms[J].IEEE/ACM Transactions on Networking 7,1999 : 350~364
  • 4G.Apostolopoulos,R.Guerin ,S.Kamat ,S.Tripathi .Improving QoS routing performance under inaccurate link state information [C].in Proc.ITC'16,June 1999 : 1351~1362
  • 5Wang Jian-xin,Wang Wei-ping,Chen Jian-er ,Chen Song-qiao.A randomized QoS routing algorithm on networks with inaccurate link-state information[C].Proceeding of ICCT2000
  • 6Anees Shaikh,Jennifer Rexford,Kang G.Shin.Dynamics quality-of-service routing with inaccurate link-state information[R].Technical Report CSE-TR-350-97,Dept.of Electrical Engineering and Computer Science,the University of Michigan,Ann Arbor,MI,Nov.1997
  • 7L.Georgiadis,R.Guerin,V.Peris,R.Rajan.Efficient support of delay and rate guarantees in an internet[C].Sigcomm'96,August 1996,Palo Alto,CA.

同被引文献6

  • 1Garey M R, Johnson D S.Computers and Intractability a Guide to the Theory of NP-completeness. SanFrancisco, CA:Freeman, 1979
  • 2Yuan X. On the Extended Bellman-ford Algorithm to Solve Two- constrained Quality of Service Routing Problems[A].In: Proceedings of the 8th International Conference on Computer Communications and Networks (IC3N9). Boston, MA: IEEE Communication Society, 1999: 304-310
  • 3Crovella M E, Bestavros A. Self-similarity in World Wide Web Traffic: Evidence and Possible Causes[J]. IEEE/ACM Transactions on Networking, 1997, 5(6): 835-846
  • 4Shaikh A, Rexford J, Shin K.Dynamics of Quality- of-Service Routing with Inaccurate Link-state InforMation [D]. Univ. of Michigan, Ann Arbor, Ml, Tech. Rep., CSE-TR-350-97,1997-11
  • 5Orda A. Routing with End-to-end QoS Guarantees in Broadband Networks[J]. IEEE/ACM Transactions on Networking, 1999, 7(3): 365-374
  • 6崔勇,吴建平,徐恪,徐明伟.互联网络服务质量路由算法研究综述[J].软件学报,2002,13(11):2065-2075. 被引量:73

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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