Networking Investigate

A Comparative Study Between Max Flow Multipath, Multi Shortest Path and Single Shortest Path

Download now Free registration required

Executive Summary

In this paper, the authors present a Max Flow MultiPath routing algorithm (MFMP) that is designed to reduce latency, provide high throughput and balance traffic load. The max flow multipath algorithm is based on a Ford-Fulkerson algorithm .It consists of determining a set of disjoints path that are loop free with maximum flow, then splitting network traffic among those paths on a round robin fashion. Through simulation they show that their algorithm performs well than a Multi Shortest Path (MSP) and a Single Shortest Path (SSP).

  • Format: PDF
  • Size: 1509.4 KB