Abstract
In this paper we present a max flow multipath routing algorithm (MFMP) with congestion mechanism that is designed to reduce latency, provide high throughput and reduce packet loss. The congestion mechanism used, reduces overhead by limiting congestion information to local nodes. Together with Ford-Fulkerson algorithm used to determine a set of paths that are disjoints or virtually disjoint, MFMP is able to perform better than the usual Equal Cost Multipath (ECMP) protocol.