Dynamic server allocation to parallel queues with randomly varying connectivity
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (2) , 466-478
- https://doi.org/10.1109/18.212277
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Minimum weight paths in time‐dependent networksNetworks, 1991
- Meteor burst communicationsIEEE Communications Magazine, 1990
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- Cellular packet communicationsIEEE Transactions on Communications, 1990
- A queuing model for meteor burst packet communication systemsIEEE Transactions on Communications, 1989
- Minimum‐delay routing in continuous‐time dynamic networks with Piecewise‐constant capacitiesNetworks, 1988
- K competing queues with geometric service requirements and linear costs: The μc-rule is always optimalSystems & Control Letters, 1985
- The cμ rule revisitedAdvances in Applied Probability, 1985