期刊文献+

基于流量工程的网络改进算法 被引量:1

Network Improvement Algorithm Based on Traffic Engineering
下载PDF
导出
摘要 针对计算机网络规模滞后、服务类型单一和服务质量没有保证等问题,将网络规划(网络改进)与流量工程作为有机整体为网络业务流量提供QoS服务,并在此基础上提出基于流量工程的新型网络改进算法.算法运用构造Harafy图和网络扩充启发式算法保证拓扑约束,基于多QoS约束路由算法满足流量工程约束;并使用改进遗传算法策略全局寻求改进费用最小网终及容量分配.仿真结果表明:算法实现最小化新增链路,使改进后拓扑仅略大于理想拓扑(Harary拓扑),88%的流量通过少跳数传输,且各链路带宽分配均匀(均方差σ=1.1).从而使算法在满足各网络约束的同时能够有效地均衡网络负载,避免链路拥塞,提高网络运行性能. In order to solve the network' s service problems, such as narrowness of its scale, singleness of service types and no guarantee for quality of service (QoS) , network planning (network improvement) and traffic engineering(TE) were integrated together to respond to traffic' s QoS requirements. A network improvement algorithm based on TE was proposed. Constructing Harary topology and heuristic algorithm of network augmentation were used in the algorithm to satisfy the topological constraint, and the static routing algorithm based on multi-QoS requirements was used to satisfy the TE constraint. Then improved genetic algorithm was used to globally search the network of minimum improvement cost and its capacity of rational allocation. The simulation analyses show that the algorithm can minimize the incremental links, by which the improved topology is slightly bigger than the ideal one ( Harary topology). Moreover, 88 % traffics are transmitted by few hops, and all link bandwidth is approximately uniform ( mean-variance σ = 1.1 ). So, the network improvement algorithm can balance traffic, avoid link blocking and enhance the network behavior efficiently.
出处 《天津大学学报》 EI CAS CSCD 北大核心 2005年第10期865-868,共4页 Journal of Tianjin University(Science and Technology)
基金 教育部博士学科点基金资助项目(20030056007).
关键词 流量工程 网络改进 服务质量 遗传算法 可靠性 traffic engineering network improvement quality of service genetic algorithm reliability
  • 相关文献

参考文献8

  • 1Xiao Xipeng. Providing Quality of Service in the Internet[D]. Department of Computer Science and Engineering,Michigan State University, USA,2000. 被引量:1
  • 2Xu Yingxiao, Zhang Gendu. Models and algorithms of QoS-based routing with MPLS traffic engineering [ A ]. In: 5th IEEE International Conference on High Speed Networks and Multimedia Communications [ C ]. Jeju Island, Korea,2002. 128-132. 被引量:1
  • 3Gaw M R, Johnson J S. Computers and Intractability: A Guide to the Theory of NP-Completeness [ M ]. San Francisco: W H Freeman and Company,1979, 238-240. 被引量:1
  • 4Reichelt Dirk, Rothlauf Franz. Designing reliable communication networks with a genetic algorithm using a repair heuristic [ A ]. In:Proceedings of the dth European Conference on Evolutionary Computation in Combinatorial Optimization[C]. Coimbra, Portugal, 2004. 165-176. 被引量:1
  • 5Apostolopoulos George, Cost and performance trade-offs of quality of service routing[ D]. Department of Computer Science, University of Maryland, Annapolis, USA, 1999. 被引量:1
  • 6Provan J S, Ball M O. The complexity of counting cuts and of computing the probability that a graph is connected [ J ].SIAM Journal of Computing, 1983,12 ( 4 ) : 777-788. 被引量:1
  • 7Orda A. Routing with end-to-end QoS guarantees in broadband networks [ J ]. IEEE/ACM Transactions on Networking,1999, 7(3) : 365-374. 被引量:1
  • 8Bollobas B. Modern Graph Theory [ M ]. New York : Springer, 2001. 73-85. 被引量:1

同被引文献12

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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