A discrete-time queueing network
Author:
- Jean WalrandJWJean Walrand
- 1 December 1983
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 20 (4) , 903-909
Abstract
A discrete-time network with multiple transitions is defined. It is characterized by the independence of the service processes at different nodes. That network is shown to have the familiar quasi-reversibility properties.Keywords
This publication has 4 references indexed in Scilit:
- A probabilistic look at networks of quasi-reversible queuesIEEE Transactions on Information Theory, 1983
- The doubly stochastic server: A time-sharing modelMathematical Methods of Operations Research, 1981
- Interconnections of Markov chains and quasi-reversible queuing networksStochastic Processes and their Applications, 1980
- On Discrete-Time Processes in a Packetized Communication System1975