Mean sojourn times in Markov queueing networks: Little's formula revisited
- 1 March 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 29 (2) , 233-241
- https://doi.org/10.1109/tit.1983.1056638
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The Relation between Customer and Time Averages in QueuesOperations Research, 1980
- Mean-Value Analysis of Closed Multichain Queuing NetworksJournal of the ACM, 1980
- The insensitivity of stationary probabilities in networks of queuesAdvances in Applied Probability, 1978
- Product Form and Local Balance in Queueing NetworksJournal of the ACM, 1977
- Queueing Models for Computer Communications System AnalysisIEEE Transactions on Communications, 1977
- Networks of queues with customers of different typesJournal of Applied Probability, 1975
- On the relation between customer and time averages in queuesJournal of Applied Probability, 1971
- A Simple Proof of: L = λWOperations Research, 1967
- Markov ChainsPublished by Springer Nature ,1967
- Jobshop-Like Queueing SystemsManagement Science, 1963