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.

[1]  Raphael Rom,et al.  Analysis of multi-path routing , 1999, TNET.

[2]  João Pedro Hespanha,et al.  Enhancing security via stochastic routing , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[3]  J. Hespanha,et al.  Game Theoretic Stochastic Routing for Fault Tolerance on Computer Networks , 2007 .

[4]  Christos Bouras,et al.  Enhancing the DiffServ architecture of a simulation environment , 2002, Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications.

[5]  Edward W. Knightly,et al.  Opportunistic traffic scheduling over multiple network paths , 2004, IEEE INFOCOM 2004.

[6]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[7]  Gary Scott Malkin.  RIP Version 2 Protocol Analysis , 1993, RFC.

[8]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[9]  Ariel Orda,et al.  Multipath routing algorithms for congestion minimization , 2007, IEEE/ACM Trans. Netw..

[10]  Srihari Nelakuditi,et al.  On Selection of Paths for Multipath Routing , 2001, IWQoS.

[11]  David Griffin,et al.  A management system for load balancing through adaptive routing in multi-service ATM networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[12]  Tohru Kikuno,et al.  A routing protocol for finding two node-disjoint paths in computer networks , 1995, Proceedings of International Conference on Network Protocols.

[13]  Desmond P. Taylor,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 2007 .

[14]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[15]  Hiroshi Suzuki,et al.  Fast bandwidth reservation scheme with multi-link and multi-path routing in ATM networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[16]  Saewoong Bahk,et al.  Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network , 1992, SIGCOMM 1992.

[17]  T. Ishida,et al.  Fairness and Utilization in Multipath Network Flow Optimization , 2006, 2006 4th IEEE International Conference on Industrial Informatics.

[18]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  T. Yakoh,et al.  End-to-end delay evaluation on multipath routing IP network , 2004, The 8th IEEE International Workshop on Advanced Motion Control, 2004. AMC '04..

[20]  João Pedro Hespanha,et al.  Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.