Combining fairness with throughput: Online routing with multiple objectives

Journal of Computer and System Sciences

Volumn 63, Issue 1, 2001, Pages 62-79

  Goel, Ashish ^a   Meyerson, Adam ^b   Plotkin, Serge ^b  

^a University of Southern California ^*  (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; FREQUENCY ALLOCATION; QUEUEING NETWORKS; ROUTERS; THROUGHPUT;

COMPETITIVE ALGORITHMS; ONLINE ROUTING; WEIGHTED FAIR QUEUEING;

ONLINE SYSTEMS;

EID: 0035415941     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1755     Document Type: Article

References (13)

1. Convergence complexity of optimistic rate based flow control algorithms
2. Phantom: A simple and effective flow control scheme
3. On-line load balancing with applications to machine scheduling and virtual circuit routing
4. Throughput competitive online routing
5. Converging to approximated max-min flow fairness in logarithmic time
6. Global optimization using local information with applications to flow control
7. Fast fair and frugal bandwith allocation in atm networks
8. Data networks
9. Analysis and simulation of a fair queueing algorithm
10. Routing and admission control in general topology networks with poisson arrivals
11. Fairness in routing and load balancing
12. Optimal flows in networks with sources and sinks
13. A generalized processor sharing approach to flow control in integrated services networks - The single node case