skip to main content


Title: Rapid 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 paper, 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 compute clusters. Several efficient new algorithms are developed for this problem, including a parallel algorithm that can take advantage of multi-core and shared-memory architectures. Using these algorithms, we demonstrate that 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 show improvement in orders of magnitude over the previously best known method. Finally, we further demonstrate a new application of max-min fair rate allocation that is only computationally feasible using our new algorithms.
ORCiD logo [1] ;  [1] ;  [2] ;  [2]
  1. Florida State Univ., Tallahassee, FL (United States). Dept. of Computer Science
  2. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Publication Date:
Report Number(s):
Journal ID: ISSN 1045-9219; TRN: US1800905
Grant/Contract Number:
Accepted Manuscript
Journal Name:
IEEE Transactions on Parallel and Distributed Systems
Additional Journal Information:
Journal Volume: 29; Journal Issue: 1; Journal ID: ISSN 1045-9219
Research Org:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org:
USDOE National Nuclear Security Administration (NNSA), Office of Defense Programs (DP) (NA-10)
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; resource management; topology; fats; network topology; routing; vegetation; bandwidth; max-min fairness; fat-tree topology; high-performance computing; data center networks
OSTI Identifier: