Max-min fairness in multi-commodity flows

DOI10.1016/J.COR.2006.03.020MaRDI QIDQ2384908zbMATH OpenOpenAlexFDO

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

Publication date 10 October 2007

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2006.03.020

zbMATH Keywords

fairnessmulti-commodity flowsload-balancingNetwork

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• Linear max-min fairness in multi-commodity flow networks
• Fairness in routing and load balancing
• Maximum throughput network routing subject to fair flow allocation
• Upward max-min fairness
• A maximum multicommodity flow problem with global fair met rate

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 1489809 (Why is no real title available?)
• scientific article; zbMATH DE number 2150800 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A queueing analysis of max-min fairness, proportional fairness and balanced fairness
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• Bandwidth sharing and admission control for elastic traffic
• Column Generation
• Fairness in routing and load balancing
• Lexicographically Minimum and Maximum Load Linear Programming Problems
• Network flows. Theory, algorithms, and applications.
• Rate control for communication networks: shadow prices, proportional fairness and stability

Cited in

(18)

• Impact of utility function to service center location in public service system
• A maximum multicommodity flow problem with global fair met rate
• Lexicographically Minimum and Maximum Load Linear Programming Problems
• Quantitative analysis of flow distributions in a multiuser telecommunication network
• Inequity averse optimization in operational research
• A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals
• Fair division of indivisible items between two players: design parameters for contested pile methods
• Heterogeneous flow distribution at the peak load in the multiuser network
• An approximation algorithm for the facility location problem with lexicographic minimax objective
• Estimate of resource distribution with the shortest paths in the multiuser network
• Linear max-min fairness in multi-commodity flow networks
• An approximation to max min fairness in multi commodity networks
• A general branch-and-bound algorithm for fair division problems
• Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network
• Maximum throughput network routing subject to fair flow allocation
• Proportional and maxmin fairness for the sensor location problem with chance constraints
• Fair optimization and networks: a survey
• Upward max-min fairness

This page was built for publication: Max-min fairness in multi-commodity flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384908)