期刊文献+

基于带宽利用率的指数函数调制路由算法

Routing Algorithm with Exponential Function Modulation Based on Bandwidth Utilization
下载PDF
导出
摘要 带宽利用率是网络传输能力评价的核心指标,其值过高节点会出现拥塞现象,导致网络性能急剧下降。为此,基于该指标提出一种指数函数调制的路由算法EBURM。构建一个目标函数模型,给出目标函数中传输效率、带宽利用率和步长因子的理论值和计算公式,并在当前主流园区网架构基础上,利用仿真工具对OSPF经典路由机制和EBURM路由机制进行验证比较。实验结果表明,EBURM在控制路径条数目为5以内的条件下,具有优良的线性特征,可最大限度调节网络中源节点的流量发送策略,降低流量传输的代价。 Bandwidth utilization is a core index in network transmission capability evaluation.Too large bandwidth utilization will cause node congestion and make the performance of the network drop dramatically.Aiming at this problem,based on bandwidth utilization,a bandwidth utilization routing algorithm with exponential function is proposed,named EBURM.It firstly puts forward an objective function in mathematics,then studies and calculated several key elements and factors in the objective function,and gives the the theoretical values and calculation formula of transmission of efficiency,bandwith utilzation and step factor.In the current popular enterprise intranet network architecture,EBURM is compared with classical OSPF routing mechanism by using simulation tools.Experimental result shows that the EBURM has excellent linear characteristics under the condition and the number of EBURM path is less than five.EBURM can adjust the traffic transmission strategy of the source node in the network to reduce the cost in the traffic transmission.
作者 翟永 李宁 王晓飞 ZHAI Yong,LI Ning,WANG Xiaofei(Nanjing Research Institute of Electronics Technology,Nanjing 210039,Chin)
出处 《计算机工程》 CAS CSCD 北大核心 2018年第6期93-99,103,共8页 Computer Engineering
基金 国家部委基金
关键词 传输代价 可用带宽 迭代算法 指数函数 路由算法 transmission cost available bandwidth iterative algorithm exponential function routing algorithm
  • 相关文献

参考文献8

二级参考文献134

  • 1邓志东,孙增圻.利用线性再励的自适应变步长快速BP算法[J].模式识别与人工智能,1993,6(4):319-323. 被引量:37
  • 2王玉峰,王文东,袁刚,程时端.Ad Hoc网络中基于Vickrey拍卖的协作激励机制的研究[J].北京邮电大学学报,2005,28(4):50-53. 被引量:6
  • 3Maille P, Tuffin B. Muhi-bid auctions for bandwidth allocation in communication networks[ C ] // IEEE INFOCOM 2004. Hong Kong: [s.n. ], 2004: 7-11.
  • 4Maille P, Tuffin B. Pricing the Internet with muhibid auctions [ J]. IEEE/ACM Trans on Networking, 2006, 14(5) : 992-1004.
  • 5Jain R, Walrand J. An efficient mechanism for network bandwidth auction [ C ]//IEEE NOMS Workshops 2008. Salvador da Bahia: [ s. n. ] , 2008 : 227-234.
  • 6Zhu Ji, Wei Yu, Ray Liu K J. A game theoretical frame- work for dynamic pricing-based routing in self-organized MANETs [ J]. IEEE J on Selected Areas in Comm, 2008, 26(7) : 1204-1217.
  • 7Su Xueyuan, Chan S, Peng Gang. Auction in multi-path muhi-hop routing [ J ]. IEEE Communications Letters, 2009, 13(2): 154-156.
  • 8Wu Fan, Zhong Sheng, Liu Jiqiang. Cost-effective traffic assignment for multipath routing in selfish networks [ C ]// GLOBECOM 2007. Washington : [ s. n. ] , 2007 : 453-457.
  • 9Boyd S, Vandenberghe L. Convex optimization [ M]. Cambridge: Cambridge University Press, 2004: 1074- 1079.
  • 10赖炎连.最速下降法的一些性质.应用数学学报,:106-116.

共引文献79

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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