• DocumentCode
    3756366
  • Title

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

  • Author

    Euclides Pinto Neto;Gustavo Callou

  • Author_Institution
    Dept. of Stat. &
  • fYear
    2015
  • Firstpage
    76
  • Lastpage
    79
  • Abstract
    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.
  • Keywords
    "Bandwidth","Routing","Routing protocols","Optimization","Heuristic algorithms","Algorithm design and analysis"
  • Publisher
    ieee
  • Conference_Titel
    Computing Systems Engineering (SBESC), 2015 Brazilian Symposium on
  • Electronic_ISBN
    2324-7894
  • Type

    conf

  • DOI
    10.1109/SBESC.2015.21
  • Filename
    7423216
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3756366