Combining fairness with throughput: Online routing with multiple objectives

DOI10.1006/JCSS.2001.1755zbMATH Open0984.68004OpenAlexW2021474514MaRDI QIDQ5952452FDOQ5952452

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

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

zbMATH Keywords

online algorithmsroutingbandwidth allocation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Optimal flows in networks with multiple sources and sinks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (17)

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