期刊文献+

电力通信网络中高效的OSPF流量负载均衡协议 被引量:7

Efficient and load balanced open shortest path first protocol in electric power communication network
下载PDF
导出
摘要 针对基于开放式最短路径优先(OSPF)协议的电力通信网络中的流量负载不均衡问题,提出两级优化的OSPF(TSO-OSPF)算法,分别对OSPF区域内和区域间进行流量均衡。算法采用带宽利用率和时延作为链路权重,根据路由器的进出总流量,将流量过大的分支分解到多个路由器,实现最大流最小化,从而解决电力通信网区域内部和边界路由器的流量不均衡问题。仿真实验表明:与OSPF算法相比,TSO-OSPF算法有效均衡了网络的流量,并且降低了10%左右的丢包率。 To solve the traffic load-imbalance problem in electric power communication networks based on Open Shortest Path First (OSPF) protocol, an efficient Two-Step Optimized OSPF Protocol (TSO-OSPF) algorithm was proposed to balance the traffic in intra-area and inter-area of OSPF respectively. The bandwidth utilization and delay were adopted as link weights, the inward and outward traffic of a router was considered, the overloaded branches were decomposed into multiple reuters to minimize the maximum traffic flow, thus the traffic-imbalance problem of internal and boundary router in the electric power communication networks was solved. The simulation results show that the TSO-OSPF algorithm can effectively balance the traffic in the network and reduce the packet loss rate by about 10% compared with the OSPF algorithm.
出处 《计算机应用》 CSCD 北大核心 2017年第7期1873-1876,1882,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(61379130 61672485)~~
关键词 负载均衡 开放最短路径优先协议 智能电网 电力通信网络 load balance Open Shortest Path First (OSPF) protocol smart grid electric power communication network
  • 相关文献

参考文献9

二级参考文献44

  • 1姚婕.一种基于动态负载均衡的路由算法[J].微机发展,2005,15(1):11-13. 被引量:2
  • 2刘建军,尹浩.多路径负载均衡性能仿真分析[J].小型微型计算机系统,2007,28(2):233-236. 被引量:2
  • 3Moy J. OSPF Version 2[S]. RFC 2328, 1998. 被引量:1
  • 4Moy J. OSPF: Anatomy of an Intemet Routing Protocol[M]. New York, USA: Addison-Wesley, 1999. 被引量:1
  • 5Sridharan A, Guerin R, Diot C. Achieving Near-optimal Traffic Engineering Solutions for Current OSPF/IS-IS Networks[J]. IEEE/ACM Transactions on Networking, 2005, 13(2): 234-247. 被引量:1
  • 6Salsano S, Botta A, Iovanna P, et al. Traffic Engineering with OSPF-TE and RSVP-TE: Flooding Reduction Techniques andEvaluation of Processing Cost[J]. Computer Communications, 2006, 29(11): 2034-2045. 被引量:1
  • 7Salles R M, Rolla V G. Efficient Routing Heuristics for Internet Traffic Engineering[J]. Computer Communications, 2007, 30(9): 1942-1952. 被引量:1
  • 8Dzida M, Zagozdzon M, Pioro M, et al. Optimization of the Shortest-path Routing with Equal-cost Multi-path LoadBalancing[C]//Proc. of IEEE International Conference on Transparent Optical Networks. [S. 1.]: IEEE Press, 2006: 9-12. 被引量:1
  • 9Rastogi R, Breitbart Y, Garofalakis M. Optimal Configuration of OSPF Aggregates[J]. IEEE/ACM Transactions on Networking, 2003, 11(2): 181-194. 被引量:1
  • 10Su Bing, Yu Haiyang, Lu Jieru, et al. Traffic Optimization on theDynamic Switching of ABR for OSPF Networks[C]//Proc. of 2009 IEEE International Conference on Information Technologyand Computer Science, [S. 1.]: IEEE Press, 2009: 429-432. 被引量:1

共引文献96

同被引文献83

引证文献7

二级引证文献70

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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