首页 | 官方网站   微博 | 高级检索  
     

多协议标签交换网络中最小干扰路由算法的研究
引用本文:许富龙,徐洁,刘英锋.多协议标签交换网络中最小干扰路由算法的研究[J].计算机应用,2006,26(4):942-944.
作者姓名:许富龙  徐洁  刘英锋
作者单位:1. 电子科技大学,计算机科学与工程学院,四川,成都,610054
2. 煤炭科学研究总院,水文地质研究所,陕西,西安,710054
摘    要:在最小干扰路由(MIR)算法基础上,提出一种改进的MIR算法。该算法结合了基于多商品流理论的流量描述路由(PBR)算法将节点对带宽预测作为路由信息的优点,以及MIR算法的核心思想,给出了节点对的权值计算公式,并说明了如何在现有MIR算法中利用节点对的权值。改进后的算法能更好地适应实际网络路由需要,提高网络资源利用率和吞吐量。

关 键 词:流量工程  多协议标签交换  最小干扰路由  最大网络流  入出口节点对
文章编号:1001-9081(2006)04-0942-03
收稿时间:2005-10-10
修稿时间:2005-10-102005-12-20

Minimum interference routing algorithm for multi-protocol label switching network
XU Fu-long,XU Jie,LIU Ying-feng.Minimum interference routing algorithm for multi-protocol label switching network[J].journal of Computer Applications,2006,26(4):942-944.
Authors:XU Fu-long  XU Jie  LIU Ying-feng
Abstract:An improved Minimum Interference Routing(MIR) algorithm was proposed. It adopted the idea of Profile-Based Routing(PBR) algorithm which used the flow-prediction of ingress-egress nodes as routing information. Based on this idea, ingress-egress nodes' weight formula was provided, and how to use the formula in minimum interference routing algorithm was discussed. The improved algorithm can not only meet the practical routing needs better but also heighten the resources usage and throughput of network.
Keywords:traffic engineering  Multi-protocol Label Switching(MPLS)  minimum interference routing  maximum network flow  ingress-egress node
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号