首页> 中文期刊> 《计算机应用》 >用于MPLS流量工程的最小延时和最小干扰路由算法

用于MPLS流量工程的最小延时和最小干扰路由算法

         

摘要

借鉴最小干扰路由算法(MIRA)的思想,提出一种最小延时和最小干扰路由算法MDMI,以实现用于多协议标签交换(MPLS)流量工程的服务质量(QoS)路由方案.该算法首先选择k条最小时延备选路由,然后通过网络流计算避开关键链路选路.该算法在实现负载均衡、提高网络资源利用效率的同时提供了一种延时控制方式.仿真结果表明,该算法以k倍时间复杂度提升为代价,在满足标签转发路径(LSP)请求和资源利用率方面能达到较好的性能.%Based on the idea of Minimum Interference Routing Algorithm (MIRA), a Minimum Delay Minimum Interference (MDMI) routing algorithm was proposed to implement QoS-based routing scheme for Multi-Protocol Label Switch (MPLS) traffic engineering.The algorithm firstly calculated k minimum-delay candidate routes, selected optimal route and avoided critical resource through computing network flow.The algorithm can balance overall load, improve resource utilization efficiency and offer a delay-constrained routing mechanism at the same time.The simulation results show that the new algorithm works better at decreasing Label Switched Path (LSP) rejection rate and increase network throughput, however at the cost of k times multiplication of time complexity.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号