Allocating bandwidth for bursty connections

SIAM Journal on Computing

Volumn 30, Issue 1, 2000, Pages 191-217

  Kleinberg, J ^a   Rabani, Y ^a   Tardos, E ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Approximation algorithms; Combinatorial optimization; Effective bandwidth; Statistical multiplexing

Indexed keywords

ALGORITHMS; BANDWIDTH; CHANNEL CAPACITY; CONGESTION CONTROL (COMMUNICATION); MATHEMATICAL MODELS; MULTIPLEXING; OPTIMIZATION; RANDOM PROCESSES; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

APPROXIMATION ALGORITHMS; BANDWITHD ALLOCATION; BURSTY CONNECTIONS; COMBINATORIAL OPTIMIZATION; EFFECTIVE BANDWIDTH; HIGH SPEED NETWORKS;

APPROXIMATION THEORY;

EID: 0034456340     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797329142     Document Type: Article

References (20)

1. On-line load balancing with applications to machine scheduling and virtual circuit routing
2. Throughput-competitive online routing
3. New algorithms for an ancient scheduling problem
4. Effective bandwidth of general Markovian traffic sources and admission control of high speed networks
5. On-line routing for permanent virtual circuits
6. Effective bandwidths for the multi-type UAS channel
7. Bounds for certain multiprocessing anomalies
8. Bounds on multiprocessing anomalies
9. Using dual approximation algorithms for scheduling problems: Theoretical and practical results
10. Resource allocation for broadband networks
11. Effective bandwidths at multi-class queues
12. Notes on effective bandwidths
13. Scheduling jobs with exponential processing times on parallel machines
14. Competitive routing in ATM networks
15. Randomized rounding: A technique for provably good algorithms and algorithmic proofs
16. Effective bandwidths: Call admission, traffic policing and filtering for ATM networks
17. Approximation results in parallel machines stochastic scheduling
18. A tutorial in stochastic scheduling