Max–min fairness in multi-commodity flows-Reference-Cited by-同舟云学术

Max–min fairness in multi-commodity flows

Published:2008-02 Issue:2 Volume:35 Page:557-573
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Nace Dritan,Nhat Doan Linh,Klopfenstein Olivier,Bashllari Alfred

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference27 articles.

1. Nace D, Orlin JB. Lexicographically minimum and maximum load linear programming problems. Operations Research, to appear.

2. Data networks;Bertsekas,1992

3. Fairness in routing and load balancing;Kleinberg,1999

4. Nace D. A linear programming based approach for computing optimal splittable fair routing. In: Proceedings of the seventh IEEE symposium on computers and communications 2002, ISCC’2002. Taormine, Italy; July 2002. p. 468–74.

5. Routing, flow and capacity design in communication and computer networks;Pioro,2004

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Approximation Methods for Lexicographic Max-Min Optimization;Journal of Telecommunications and Information Technology;2024-02-13

2. Anticipatory Resource Allocation for ML Training;Proceedings of the 2023 ACM Symposium on Cloud Computing;2023-10-30

3. Quantitative Analysis of Flow Distributions in a Multiuser Telecommunication Network;Journal of Computer and Systems Sciences International;2023-04

4. Quantitative Analysis of Flow Distributions in a Multiuser Telecommunication Network;Известия Российской академии наук. Теория и системы управления;2023-03-01

5. Analysis of the Load Distribution and Internodal Flows under Different Routing Strategies in a Multiuser Network;Journal of Computer and Systems Sciences International;2022-12