Combining fairness with throughput: online routing with multiple objectives

Authors:
Ashish Goel;Adam Meyerson;Serge Plotkin
Affiliations:
Department of Computer Science, University of Southern California, Los Angeles, CA;Department of Computer Science, Stanford University, CA;Stanford University
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

Data networks

Data networks
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
On-line load balancing with applications to machine scheduling and virtual circuit routing

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Convergence complexity of optimistic rate based flow control algorithms (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Phantom: a simple and effective flow control scheme

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Routing and admission control in general topology networks with Poisson arrivals

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast, fair, and frugal bandwidth allocation in ATM networks

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Global Optimization Using Local Information with Applications to Flow Control

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Fairness in Routing and Load Balancing

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Approximate majorization and fair online load balancing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Using approximate majorization to characterize protocol fairness

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On Multicriteria Online Problems

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Computing optimal max-min fair resource allocation for elastic flows

IEEE/ACM Transactions on Networking (TON)
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation

IEEE/ACM Transactions on Networking (TON)
On the bicriteria k-server problem

ACM Transactions on Algorithms (TALG)
Online stochastic packing applied to display ad allocation

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
The Price of Fairness

Operations Research

Hi-index	0.00