Obtaining a Feasible Path with Maximum Flow Rate in a Network

Abstract: This research work proposes an algorithm to find a path which has the maximum allowed flow rate for data, between source and destination in a network. Unlike max-flow and min-cut theorem, algorithm is selecting single path for data transmission. To find a path in a network there are multiple techniques. Prim’s technique is used recursively in our proposed algorithm to find different paths between source and destination. The maximum allowed flow rate for each of those paths is calculated and finally we take the maximum of those calculated flow rates.

Keywords: Maximum flow rate; max-flow and min-cut theorem; Prim’s algorithm.