首页> 外文会议>International Conference on Advanced in Control Engineering and Information Science >Research on Routing Arithmetic basing on Scale-Free Centrality in Betweenness networks
【24h】

Research on Routing Arithmetic basing on Scale-Free Centrality in Betweenness networks

机译:路由算术基于网络之间无垢中心的路由算术基础

获取原文

摘要

Based on shortest path routing algorithm, a new algorithm (simply called BORA) is proposed, which optimizes node weight and changes the routing between nodes. The purpose of the algorithm is to reduce network congestions and advance network capacity .Based on Barabfisi-Albert algorithm, a scale-free networks model which has been improved on by BORA is designed. It is showed that BORA advances several abilities of network such as system delay, throughput and fairness efficiently after numbers of discursions and simulations under this new model.
机译:基于最短路径路由算法,提出了一种新的算法(简称Bora),其优化节点权重并改变节点之间的路由。该算法的目的是减少网络拥塞和预先网络容量。基于Barabfisi-Albert算法,设计了一个无缝的网络模型,由Bora进行了改进。结果表明,在这个新模型下,有效地将诸如系统延迟,吞吐量和公平等网络的多种能力提前了解了系统延迟,吞吐量和公平性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号