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

• Euclides Pinto Neto UFRPE
• Gustavo Callou UFRPE

Resumo

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.

Palavras-chave: Bandwidth, Routing, Routing protocols, Optimization, Heuristic algorithms, Algorithm design and analysis, Networking, Ford-Fulkerson, maximum Graph-Flow