Combining fairness with throughput: Online routing with multiple objectives

DOI10.1006/jcss.2001.1755zbMath0984.68004OpenAlexW2021474514MaRDI QIDQ5952452

Ashish Goel, Serge A. Plotkin, Adam Meyerson

Publication date: 14 May 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1ea27af011bd09ce990471f06df0b17d0d4b9eb3

zbMATH Keywords

online algorithmsroutingbandwidth allocation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Bicriteria Online Matching: Maximizing Weight and Cardinality ⋮ Fair online load balancing ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ Fair resource allocation for different scenarios of demands ⋮ Simultaneous approximation of multi-criteria submodular function maximization ⋮ Pricing for fairness: distributed resource allocation for multiple objectives ⋮ Simultaneous approximation ratios for parallel machine scheduling problems ⋮ Price-based protocols for fair resource allocation

Cites Work

• Optimal flows in networks with multiple sources and sinks
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item