Distributed Admission Control, Scheduling, and
Routing with Stale Information
Ashish Goel and Adam Meyerson and Serge
Plotkin
Extended abstract in SODA 2001
Approximate Majorization and Fair Online Load Balancing
Ashish Goel and Adam Meyerson and Serge
Plotkin
Extended abstract in SODA 2001
Combining Fairness with Throughput: Online Routing with Multiple
Objectives
Ashish Goel and Adam Meyerson and Serge
Plotkin
To appear in JCSS, special issue
on Internet Algorithms (Invited Paper)
Extended abstract in STOC 2000
Scheduling Data Transfers in a Network and the Set Scheduling
Problem
A. Goel and M. Henzinger and S. Plotkin and E.
Tardos
Extended abstract in STOC 1999
Online Throughput-Competitive Algorithm for Multicast Routing and
Admission Control
A. Goel and M. Henzinger
and S.
Plotkin
Extended abstract in SODA 1998
Approximating a finite metric by a small number of tree metrics
M. Charikar and C. Chekuri and A. Goel and S. Guha and S.
Plotkin
Extended abstract in FOCS 1998
Routing and Admission Control
in General Topology Networks
with Poisson Arrivals.
O. Palmon, A. Kamath, and S.
Plotkin.
Extended abstract in SODA 1996.
Competitive Routing of
Virtual Circuits in ATM networks.
Survey, invited paper to IEEE J. Selected Areas in
Communications.
Routing and Admission Control
in General Topology Networks .
R. Gawlick, A. Kamath, S. Plotkin, and K.
Ramakrishnan
Stanford Technical Report STAN-CS-TR-95-1548.
Competitive Routing of
Virtual Circuits with Unknown Durations .
B. Awerbuch, Y. Azar, S. Plotkin, and O.
Waarts.
Preliminary version appeared in SODA 1994.
Throughput competitive on-line
routing.
B. Awerbuch, Y. Azar, and S.
Plotkin.
In FOCS 1993.
On-line load balancing of
temporary tasks.
Y. Azar, B.
Kalyanasundaram, S. Plotkin, K. Pruhs,
and O. Waarts.
J. Algorithms version. Prelim. vers. in WADS 1993.
On-line machine scheduling
with applications to load balancing
and virtual circuit routing.
J. Aspnes, Y. Azar, A. Fiat, S.
Plotkin, and O. Waarts.
Full version of the STOC 1993 paper.