An approximation to max min fairness in multi commodity networks

DOI10.1007/S10287-018-0336-7MaRDI QIDQ2183560zbMATH OpenOpenAlexFDO

Authors Hamoud S. Bin Obaid, Theodore B. Trafalis

Publication date 27 May 2020

Published in Computational Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10287-018-0336-7

zbMATH Keywords

goal programmingload balancingmax min fairnesstraffic engineering

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Max-min fairness in multi-commodity flows
• Linear max-min fairness in multi-commodity flow networks
• Fairness in routing and load balancing
• Upward max-min fairness
• Multi-criteria bandwidth allocation

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• Max-min fairness in multi-commodity flows
• Maximum throughput network routing subject to fair flow allocation
• Optimal flows in networks with multiple sources and sinks

Cited in

(6)

• Minimizing maximum risk for fair network connection with interval data
• A fairness relation based on the asymmetric Choquet integral and its application in network resource allocation problems
• scientific article; zbMATH DE number 2088538 (Why is no real title available?)
• A two‐commodity sharing problem on networks
• Boundedness, hierarchy of fairness, and communication networks with delay
• Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well

Describes a project that uses

Uses Software

• SNDlib

This page was built for publication: An approximation to max min fairness in multi commodity networks

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