Decomposability in queues with background states
From MaRDI portal
Publication:1915954
DOI10.1007/BF01245329zbMath0847.60079MaRDI QIDQ1915954
Masakiyo Miyazawa, Genji Yamazaki
Publication date: 1 July 1996
Published in: Queueing Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (2)
Generalized product-form stationary distributions for Markov chains in random environments with queueing applications ⋮ Stationary Distributions of Discrete-Time Markov Chains in Random Environment: Exact Computations and Bounds
Cites Work
- Unnamed Item
- A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
- On the response time distribution in a discrete round-robin queue
- Insensitivity in discrete time queues with a moving server
- Networks of queues in discrete time
- The M/M/∞ queue in a random environment
- Two remarks on insensitive stochastic models
- The doubly stochastic server: A time-sharing model
- Insensitivity and product-form decomposability of reallocatable GSMP
This page was built for publication: Decomposability in queues with background states