首页> 外文会议>Brazilian Symposium on Computing Systems Engineering >An Approach Based on Ford-Fulkerson Algorithm to Optimize Network Bandwidth Usage
【24h】

An Approach Based on Ford-Fulkerson Algorithm to Optimize Network Bandwidth Usage

机译:基于Ford-Fulkerson算法的网络带宽使用优化方法

获取原文

摘要

Ford-Fulkerson algorithm is widely used to solve maximum Graph-Flow problems and it can be applied to a range of different areas, including networking. This paper proposes an approach based on Ford-Fulkerson algorithm to maximize the flow (bandwidth usage) of computer network. Such method mitigates congestion problems and increases network utilization. In order to show the applicability of the proposed approach, this paper presents the analysis of different network scenarios.
机译:Ford-Fulkerson算法被广泛用于解决最大的Graph-Flow问题,并且可以应用于包括网络在内的许多不同领域。本文提出了一种基于Ford-Fulkerson算法的方法来最大化计算机网络的流量(带宽使用)。这种方法减轻了拥塞问题并提高了网络利用率。为了显示该方法的适用性,本文对不同的网络场景进行了分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号