Upward Max Min Fairness

Often one would like to allocate shared resources in a fair way. A common and well studied notion of fairness is Max-Min Fairness, where we first maximize the smallest allocation, and subject to that the second smallest, and so on. We consider a networking application where multiple commodities compete over the capacity of a network. In our setting each commodity has multiple possible paths to route its demand (for example, a network using MPLS tunneling). In this setting, the only known way of finding a max-min fair allocation requires an iterative solution of multiple linear programs. Such an approach, although polynomial time, scales badly with the size of the network, the number of demands, and the number of paths. More importantly, a network operator has limited control and understanding of the inner working of the algorithm. Finally, this approach is inherently centralized and cannot be implemented via a distributed protocol.

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

[2]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[3]  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.

[4]  Tibor Cinkler,et al.  Fairness in Capacitated Networks: A Polyhedral Approach , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[6]  Arjun Singh,et al.  A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering , 2012, 2012 Proceedings IEEE INFOCOM.

[7]  Yefim Dinitz,et al.  Dinitz' Algorithm: The Original Version and Even's Version , 2006, Essays in Memory of Shimon Even.

[8]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[9]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[10]  M. Allalouf,et al.  Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation , 2008, IEEE/ACM Transactions on Networking.

[11]  Jochen Könemann,et al.  Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems , 2007, SIAM J. Comput..

[12]  Jean-Yves Le Boudec,et al.  A unified framework for max-min and min-max fairness with applications , 2007, TNET.

[13]  Ning Wang,et al.  An overview of routing optimization for internet traffic engineering , 2008, IEEE Communications Surveys & Tutorials.