Throughput-competitive on-line routing
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 32-40
- https://doi.org/10.1109/sfcs.1993.366884
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Fast approximation algorithms for fractional packing and covering problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Online load balancing of temporary tasksLecture Notes in Computer Science, 1993
- Call preemption in communication networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- On-line load balancingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Fast approximation algorithms for multicommodity flow problemsPublished by Association for Computing Machinery (ACM) ,1991
- Distributed control for PARISPublished by Association for Computing Machinery (ACM) ,1990
- 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