期刊文献+

一种改进路由算法的设计与仿真

Design and Simulation of A Improved Routing Algorithm
下载PDF
导出
摘要 研究网络资源提高调度效率问题,在网络资源的利用率上,尽量避免数据过大,引起资源不均衡。当网络中接入大量数据,流量变大的时候,数据流量的突变性增大会造成通信链路拥塞,导致网络不能有效调度,网络资源利用率下降的问题。为了解决大量数据接入可能会导致的链路拥塞的问题,提出一种改进的多路径流量分配路由算法,通过提高计算链路在网络中承载的关键性,以链路的关键性为主要指标,把链路关键性和网络剩余容量转化为网络传输成本,以最小化网络传输成本为目标函数来设计解决网络拥塞问题。仿真结果表明,改进后的算法能更有效提高网络的负载均衡性和资源利用率,避免网络拥塞。 Research network resources scheduling problem and improve the utilization rate of network resources. For when network access of large quantities of data, the flow of the larger data flow, the increase of axonal degenera- tion can cause a communications link congestion, lead to the network can not effectively scheduling, the network re- sources utilization of the decline of the problem. In order to improve large data access may cause congestion problem of the link, the article puts forward an improved muhipath flow distribution routing algorithms, improve the calcula- tion link in the network, the key to carry the key link for the main index, the key link of the residual capacity and network into network transmission cost, so as to minimize the network transmission cost for target function to design the improvement-LCTB routing algorithm. The experiment results show that the improved algorithm can even improve the load balance, support network access, avoid more business network congestion.
机构地区 徐州工程学院
出处 《计算机仿真》 CSCD 北大核心 2012年第7期199-201,286,共4页 Computer Simulation
基金 江苏省高校自然基金项目(09KJD120005)
关键词 路由算法 链路关键性 负载均衡 路由仿真 Routing algorithm Link-criticality Load-balance Routing algorithm simulation
  • 相关文献

参考文献7

  • 1EricOsborne著,张辉,卢炜译.基于MPLS的流量工程[M].北京:人民邮电出版社,2003.
  • 2韦绥线,黄胜华.一种快速规避拥塞的路由算法[J].计算机仿真,2007,24(4):136-138. 被引量:3
  • 3Kartik Gopalan, Tzi-cker Chiueh and Lin Yow-Jian. Laod balan- cing routing algorithm with bandwidth-delay guarantees[ J]. IEEE Communications Magazines, 2004,42 ( 6 ).
  • 4唐治果,李乐民,虞红芳.针对MPLS网络流量工程的链路关键性路由算法[J].电子与信息学报,2007,29(5):1187-1190. 被引量:13
  • 5R Ahuja, T Magnanti, J Odin. Network Flows [ M ]. Prentice Hall, 1993.
  • 6A Shaikh, et al. An OSPF Topology Server:Design and Evaluation [J] . IEEE Journal on Selected Areas in Communications, 2002, 20(4) :746-755.
  • 7M Dzida, M Zagozdzon, M Pioro, A Tomaszewski. Optimization of The Shortest-Path Routing with Equal-Cost Multi-Pathl-oad Bal- ancing [ C ] . Transparent Optical Networks, 2006 International Conference on. 2006,3:9-12.

二级参考文献14

  • 1韦绥线,黄胜华.一种仿Dijkstra的蚂蚁算法[J].计算机应用,2005,25(12):2908-2910. 被引量:4
  • 2S Floyd,K Fall.Promoting the use of end-to-end congestion control in internet[J].IEEE/ACM Transactions on Networking,1999,7(4):458-472.
  • 3R Schoonderwoerd,et al Ant-based load balancing in telecommunications networks[J].Adaptive Behavior,1996,5(2):169-207.
  • 4Van Jacobson.Congestion avoidance and control[J].ACM Computer Communication Review,1988,18(4):314-329.
  • 5Guerin R,Orda A,and Williams D.QoS routing mechanisms and OSPF extensions.proc.of IEEE GLOBECOM'97,phoenix,AZ,Nov.1997,Vol.3:1903-1908.
  • 6Kodialam M S and Lakshman T V.Minimum interference routing with applications to MPLS traffic engineering.Proc.of IEEE INFOCOM,2000,Vol.2:884-893.
  • 7Suri Subhash,Waldvogel Marcel,Bauer Daniel,and Warkhede Priyank Ramesh.Profile-based routing and traffic engineering.Computer Communications,2003,26(4):351-365.
  • 8Gopalan Kartik,Chiueh Tzi-cker,and Lin Yow-jian.Load balancing routing algorithm with bandwidth-delay guarantees.IEEE Communications Magazine,2004,42(6):108-113.
  • 9Katz D,Yeung D,and Kompella K.Traffic engineering extensions to OSPF.Work in progress,Internet Draft,draft-katz-yeung-ospf-traffic-05.txt,2001.
  • 10Li T and Smit H.IS-IS extensions for traffic engineering.Work in progress,Internet Draft,draft-ietf-isis-traffic-04.txt,2001.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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