Linear max-min fairness in multi-commodity flow networks

DOI10.1007/978-3-319-56829-4_1zbMATH Open1380.90068OpenAlexW2665566002MaRDI QIDQ3133350FDOQ3133350

Authors: Hamoud S. Bin Obaid, Theodore B. Trafalis 

Publication date: 14 February 2018

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56829-4_1

Recommendations

• Max-min fairness in multi-commodity flows
• Upward max-min fairness
• A maximum multicommodity flow problem with global fair met rate
• Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
• Maximum throughput network routing subject to fair flow allocation

Mathematics Subject Classification ID

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

Cited In (5)

• Fairness in resource allocation: foundation and applications
• Channel coordination under fairness concerns and nonlinear demand
• Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well
• Max-min fairness in multi-commodity flows
• Title not available (Why is that?)

This page was built for publication: Linear max-min fairness in multi-commodity flow networks

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