首页> 外文会议>ICCSA 2011;International conference on computational science and its applications >A Speed-Up Technique for Distributed Shortest Paths Computation
【24h】

A Speed-Up Technique for Distributed Shortest Paths Computation

机译:分布式最短路径计算的加速技术

获取原文

摘要

We propose a simple and practical speed-up technique, which can be combined with every distance vector routing algorithm based on shortest paths, allowing to reduce the total number of messages sent by that algorithm. We combine the new technique with two algorithms known in the literature: DUAL, which is part of CISCO'S widely used EIGRP protocol, and the recent DUST, which has been shown to be very effective on networks with power law node degree distribution. We give experimental evidence that these combinations lead to an important gain in terms of the number of messages sent by DUAL and DUST at the price of a little increase in terms of space occupancy per node.
机译:我们提出了一种简单实用的加速技术,该技术可以与基于最短路径的每种距离矢量路由算法结合使用,从而减少该算法发送的消息总数。我们将新技术与文献中已知的两种算法结合在一起:DUAL(它是CISCO广泛使用的EIGRP协议的一部分)和最新的DUST(已证明在具有幂律节点度分布的网络上非常有效)。我们提供了实验证据,这些组合在以DUAL和DUST发送的消息数量方面取得了重要的进步,但每个节点的空间占用率却有所增加。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号