Combining fairness with throughput: online routing with multiple objectives

DOI10.1145/335305.335400MaRDI QIDQ3192040zbMATH OpenOpenAlexFDO

Authors Ashish Goel, Adam Meyerson, Serge Plotkin

Publication date 26 September 2014

Published in Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/335305.335400

Mathematics Subject Classification ID

Distributed systems (68M14) Online algorithms; streaming algorithms (68W27)

Recommendations

• Combining fairness with throughput: Online routing with multiple objectives
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Fairness in routing and load balancing
• To be fair or efficient or a bit of both
• Upward max-min fairness

Cited in

(11)

• A randomized online algorithm for bandwidth utilization
• Tight bounds for bandwidth allocation on two links
• Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
• Upward max-min fairness
• Maximum throughput network routing subject to fair flow allocation
• scientific article; zbMATH DE number 2043490 (Why is no real title available?)
• Simultaneously load balancing for every p-norm, with reassignments
• An online throughput-competitive algorithm for multicast routing and admission control
• scientific article; zbMATH DE number 2119708 (Why is no real title available?)
• Maximizing throughput in minimum rounds in an application-level relay service
• Combining fairness with throughput: Online routing with multiple objectives

This page was built for publication: Combining fairness with throughput: online routing with multiple objectives

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