• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Computational Science and Engineering >Parallel approximation algorithms for minimum routing cost spanning tree
【24h】

Parallel approximation algorithms for minimum routing cost spanning tree

机译：最小路由成本生成树的并行近似算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

With the popularity of internet, more and more data is transferred in the network. With the enormous information, the network bandwidth is still a bottleneck. The internet must provide high quality of service to ensure that the information can be transferred fluently. There are some common factors that can affect the quality of services, such as delay time, building cost, routing cost, loss probability, and bandwidth. Estimation of some factors, such as building cost, can be solved in polynomial time, but the estimations of other factors, such as finding the minimum routing cost spanning tree (MRCT), are NP-hard problems. In this paper, we focus on improving two MRCT approximation algorithms (2 and 15/8 approximation) with parallel-computing methods and obtain the impressive experiment results with reduced calculation time.
机译：随着互联网的普及，网络中越来越多的数据被传输。拥有大量信息，网络带宽仍然是瓶颈。互联网必须提供高质量的服务，以确保信息能够流畅地传输。有一些会影响服务质量的常见因素，例如延迟时间，建筑成本，路由成本，丢失概率和带宽。可以在多项式时间内解决某些因素（例如建筑成本）的估计，而其他因素（例如找到最小路由成本生成树（MRCT））的估计则是NP难题。在本文中，我们着重于通过并行计算方法改进两种MRCT近似算法（2和15/8近似），并以减少的计算时间获得了令人印象深刻的实验结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号