Designing efficient and fair algorithms for sharing multiple resources between heterogeneous demands is becoming increasingly important. Applications include compute clusters shared by multi-task jobs and routers equipped with middleboxes shared by flows of different types. We show that the currently preferred objective of Dominant Resource Fairness has a significantly less favorable efficiency-fairness tradeoff than alternatives like Proportional Fairness and our proposal, Bottleneck Max Fairness. In addition to other desirable properties, these objectives are equally strategyproof in any realistic scenario with dynamic demand.
@article{arxiv.1410.0782,
title = {Multi-resource fairness: Objectives, algorithms and performance},
author = {Thomas Bonald and James Roberts},
journal= {arXiv preprint arXiv:1410.0782},
year = {2014}
}