Combining fairness with throughput: online routing with multiple objectives

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Symposium on the Theory of Computing

• Publication date

  2000-05-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/335305.335400
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast, Fair and Frugal Bandwidth Allocation in ATM Networks

  1999cited by this paper
• Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms

  1999cited by this paper
• Fairness in routing and load balancing

  1999cited by this paper
• Converging to approximated max-min flow fairness in logarithmic time

  1998cited by this paper
• Global optimization using local information with applications to flow control

  1997cited by this paper
• Phantom: a simple and effective flow control scheme

  1996cited by this paper
• Convergence complexity of optimistic rate based flow control algorithms (extended abstract)

  1996cited by this paper
• Routing and admission control in general topology networks with Poisson arrivals

  1995cited by this paper
• On-line load balancing with applications to machine scheduling and virtual circuit routing

  1993cited by this paper
• Throughput-competitive on-line routing

  1993influential reference
• A generalized processor sharing approach to flow control in integrated services networks-the single node case

  1992influential reference
• Analysis and simulation of a fair queueing algorithm

  1989influential reference
• Data Networks

  1986cited by this paper
• Optimal flows in networks with multiple sources and sinks

  1974cited by this paper

• Fair and efficient allocation with few agent types, few item types, or small value levels

  2023cites this paper
• Equalizing Access to Latency-Critical Services Based on In-Network Computing

  2023cites this paper
• Online Utilization Maximization in Resource Allocation with Minimum Service Guarantees

  2023cites this paper
• What Constitutes Fairness in Games? A Case Study with Scrabble

  2021cites this paper
• Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types

  2020cites this paper
• Simultaneous Approximation Ratios for Parallel Machine Scheduling Problems

  2019cites this paper
• Balancing Efficiency and Fairness in On-Demand Ridesourcing

  2019cites this paper
• Implementing the Lexicographic Maxmin Bargaining Solution

  2018cites this paper
• Allocations in Large Markets

  2017cites this paper
• Simultaneously Load Balancing for Every p-norm, With Reassignments

  2017cites this paper
• Multicriteria Analysis in Telecommunication Network Planning and Design: A Survey

  2016cites this paper
• Type- and Workload-Aware Scheduling of Large-Scale Wide-Area Data Transfers

  2015cites this paper
• Online allocation algorithms with applications in computational advertising

  2014cites this paper
• Modeling and Optimizing Large-Scale Wide-Area Data Transfers

  2014cites this paper
• Simultaneous Approximation of Multi-criteria Submodular Function Maximization

  2014cites this paper
• Simultaneous Approximation of Multi-criteria Submodular Function Maximization

  2014cites this paper
• Fair Allocation in Online Markets

  2014cites this paper
• Simultaneous approximation for scheduling problems

  2013cites this paper
• Bicriteria Online Matching: Maximizing Weight and Cardinality

  2013cites this paper
• Fair Recommendations for Online Barter Exchange Networks

  2013cites this paper
• A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering

  2012cites this paper
• Fair resource allocation for different scenarios of demands

  2012cites this paper
• Allocation de ressources et ordonnancement multi-utilisateurs : une approche basée sur l'équité

  2011influential citation
• The Price of Fairness

  2011cites this paper
• On the bicriteria k-server problem

  2010cites this paper
• Online Stochastic Packing Applied to Display Ad Allocation

  2010cites this paper
• Roma , Italy On the bicriteria k-server problem

  2009cites this paper
• Optimal multi-path routing and bandwidth allocation under utility max-min fairness

  2009cites this paper
• The Design of Competitive Online Algorithms via a Primal-Dual Approach

  2009influential citation
• Online Primal-Dual Algorithms for Covering and Packing

  2009cites this paper
• Bi-objective Optimization: An Online Algorithm for Job Assignment

  2009cites this paper
• The Vertex Coloring Problem and its generalizations

  2009cites this paper
• All-Norms and All-L_p-Norms Approximation Algorithms

  2008cites this paper
• Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities

  2008cites this paper
• Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation

  2008cites this paper
• Designing competitive online algorithms via a primal-dual approach

  2008influential citation
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue

  2007cites this paper
• SIMULCASTING USING SLOTTED ALOHA IN AD-HOC NETWORKS

  2006cites this paper
• Pricing for Fairness: Distributed Resource Allocation for Multiple Objectives

  2006cites this paper
• Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs

  2006influential citation
• Fair online load balancing

  2006cites this paper
• Improved bounds for online routing and packing via a primal-dual approach

  2006influential citation
• A Tutorial on Max-Min Fairness and its Applications to Routing, Load-Balancing and Network Design

  2006cites this paper
• Computing Optimal Max-Min Fair Resource Allocation for Elastic Flows

  2006cites this paper
• Pricing for Fairness : Distributed Resource Allocation for Multiple Objectives

  2006cites this paper
• Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput

  2005cites this paper
• Online Primal-Dual Algorithms for Covering and Packing Problems

  2005cites this paper
• A new fairness index for radio resource allocation in wireless networks

  2005cites this paper
• Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives

  2004cites this paper
• Calcul de Routages Equitables dans les Réseaux Internet

  2003cites this paper
• Optimal Link Capacity Dimensioning in Proportionally Fair Networks

  2002cites this paper
• A linear programming based approach for computing optimal fair splittable routing

  2002cites this paper
• Optimization Problems in High-Speed Networks

  2002cites this paper
• On-line end-to-end congestion control

  2002cites this paper
• Link capacity dimensioning and path optimization for networks supporting elastic services

  2002cites this paper
• A polynomial approach to the fair multi-flow problem

  2002cites this paper
• Using approximate majorization to characterize protocol fairness

  2001cites this paper
• Approximate majorization and fair online load balancing

  2001cites this paper
• Fairness measures for resource allocation

  2000cites this paper
• On Multicriteria Online Problems

  2000cites this paper
• Fair and Efficient Bandwidth Allocation with the Reference Point Methodology

  year unknowncites this paper
• MIT Open Access Articles The Price of Fairness

  year unknowncites this paper