An approximation to the response time for shortest queue routing
- 1 April 1989
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 17 (1), 181-189
- https://doi.org/10.1145/75372.75392
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Approximate analysis of fork/join synchronization in parallel queuesIEEE Transactions on Computers, 1988
- Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer ContentIEEE Transactions on Communications, 1987
- A note on waiting times in systems with queues in parallelJournal of Applied Probability, 1987
- The shortest queue problemJournal of Applied Probability, 1985
- The autostrada queueing problemJournal of Applied Probability, 1984
- A simple dynamic routing problemIEEE Transactions on Automatic Control, 1980
- A Basic Dynamic Routing Problem and DiffusionIEEE Transactions on Communications, 1978
- Optimality of the shortest line disciplineJournal of Applied Probability, 1977
- Two queues in parallelCommunications on Pure and Applied Mathematics, 1977