Fast Calculation of Max-Min Fair Rates for Multi-commodity Flows in Fat-Tree Networks

Max-min fairness is often used in the performance modeling of interconnection networks. Existing methods to compute max-min fair rates for multi-commodity flows have high complexity and are computationally infeasible for large networks. In this work, we show that by considering topological features, this problem can be solved efficiently for the fat-tree topology that is widely used in data centers and high performance computing clusters. Using two new algorithms that we developed, we demonstrate it is possible to find the max-min fair rate allocation for multi-commodity flows in fat-tree networks that support tens of thousands of nodes. We evaluate the run-time performance of the proposed algorithms and demonstrate an application.

[1]  Torsten Hoefler,et al.  Optimized Routing for Large-Scale InfiniBand Networks , 2009, 2009 17th IEEE Symposium on High Performance Interconnects.

[2]  Mohan Kumar,et al.  On generalized fat trees , 1995, Proceedings of 9th International Parallel Processing Symposium.

[3]  Nimrod Megiddo,et al.  Advances in Economic Theory: On the complexity of linear programming , 1987 .

[4]  Mateo Valero,et al.  Oblivious routing schemes in extended generalized Fat Tree networks , 2009, 2009 IEEE International Conference on Cluster Computing and Workshops.

[5]  Xin Yuan,et al.  LFTI: A New Performance Metric for Assessing Interconnect Designs for Extreme-Scale HPC Systems , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.

[6]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[7]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[8]  Eitan Zahavi.  Fat-tree routing and node ordering providing contention free traffic for MPI global collectives , 2012, J. Parallel Distributed Comput..

[9]  Amin Vahdat,et al.  PortLand: a scalable fault-tolerant layer 2 data center network fabric , 2009, SIGCOMM '09.

[10]  Laxmikant V. Kalé,et al.  Maximizing Throughput on a Dragonfly Network , 2014, SC14: International Conference for High Performance Computing, Networking, Storage and Analysis.

[11]  Howard Paul Hayden,et al.  Voice flow control in integrated packet networks , 1981 .

[12]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[13]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[14]  L. Dagum,et al.  OpenMP: an industry standard API for shared-memory programming , 1998 .

[15]  Dritan Nace,et al.  Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial , 2008, IEEE Communications Surveys & Tutorials.

[16]  Dritan Nace,et al.  Max-min fairness in multi-commodity flows , 2008, Comput. Oper. Res..