Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 44 (12), 1371-1382
- https://doi.org/10.1109/12.477243
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- A numerically stable algorithm for two server queue modelsQueueing Systems, 1991
- The shortest queue model with jockeyingNaval Research Logistics (NRL), 1990
- Two Parallel Queues with Dynamic RoutingIEEE Transactions on Communications, 1986
- Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing ModelsIEEE Journal on Selected Areas in Communications, 1986
- The shortest queue problemJournal of Applied Probability, 1985
- Transient and steady state results for two parallel queuesOmega, 1980
- A simple dynamic routing problemIEEE Transactions on Automatic Control, 1980
- Two queues in parallelCommunications on Pure and Applied Mathematics, 1977
- Two Similar Queues in ParallelThe Annals of Mathematical Statistics, 1961
- A Proof for the Queuing Formula: L = λWOperations Research, 1961