MFMP: Max Flow Multipath Routing Algorithm

摘要

In this paper we present a max flow multipath routing algorithm 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 disjoint paths that are loop free with maximum flow, then splitting network traffic among those paths on a round robin fashion. Through simulation we show that our algorithm performs well than a multi shortest path.