Throughput-competitive on-line routing
Authors:
- B. AwerbuchBAB. Awerbuch
- Y. AzarYAY. Azar
- S. PlotkinSPS. Plotkin
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 32-40
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Fast approximation algorithms for fractional packing and covering problems2002
- Online load balancing of temporary tasks1993
- Call preemption in communication networks1992
- On-line load balancing1992
- Fast approximation algorithms for multicommodity flow problems1991
- Distributed control for PARIS1990
- The maximum concurrent flow problemJournal of the ACM, 1990
- Paris: An approach to integrated high‐speed private networksInternational Journal of Communication Systems, 1988
- Blocking probabilities in large circuit-switched networksAdvances in Applied Probability, 1986
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985