Combining fairness with throughput: Online routing with multiple objectives

DOI10.1006/JCSS.2001.1755MaRDI QIDQ5952452zbMATH OpenOpenAlexFDO

Authors Ashish Goel, Adam Meyerson, Serge Plotkin

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)

Recommendations

• Combining fairness with throughput: online routing with multiple objectives
• Fairness in routing and load balancing
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• scientific article; zbMATH DE number 2043490
• Upward max-min fairness

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 1256723 (Why is no real title available?)
• scientific article; zbMATH DE number 1305396 (Why is no real title available?)
• scientific article; zbMATH DE number 871923 (Why is no real title available?)
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Optimal flows in networks with multiple sources and sinks

Cited in

(17)

• Fairness in routing and load balancing
• Simultaneous approximation ratios for parallel machine scheduling problems
• Price-based protocols for fair resource allocation, convergence time analysis and extension to Leontief utilities
• Bicriteria online matching: maximizing weight and cardinality
• Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis
• Fair online load balancing
• Combining fairness with throughput: online routing with multiple objectives
• Tight bounds for bandwidth allocation on two links
• Simultaneous approximation of multi-criteria submodular function maximization
• A randomized online algorithm for bandwidth utilization
• Fair resource allocation for different scenarios of demands
• Fair and efficient allocation with few agent types, few item types, or small value levels
• scientific article; zbMATH DE number 2043490 (Why is no real title available?)
• An online throughput-competitive algorithm for multicast routing and admission control
• Maximum throughput network routing subject to fair flow allocation
• Pricing for fairness: distributed resource allocation for multiple objectives
• Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems

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 Q5952452)