Networks of queues in discrete time
From MaRDI portal
Cites work
- A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
- Analysis of A time‐shared processor
- Closed Queuing Systems with Exponential Servers
- Controlled queueing systems
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- Insensitive average residence times in generalized semi-Markov processes
- Networks of queues
- On the relation between customer and time averages in queues
- On the response time distribution in a discrete round-robin queue
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Passage times for overtake-free paths in Gordon–Newell networks
- Sojourn times and the overtaking condition in Jacksonian networks
- Sojourn Times in Queueing Networks
- The doubly stochastic server: A time-sharing model
- Time-shared Systems
Cited in
(10)- Insensitivity in discrete time queues with a moving server
- An approximate solution and error bound for a discrete time queue with simultaneous servicing
- Features of some discrete-time cyclic queueing networks
- Decomposability in queues with background states
- Open queueing networks in discrete time -- some limit theorems
- Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
- Product form in networks of queues with batch arrivals and batch services
- Mathematical theory of queueing networks
- Closed queueing networks with batch services
- On Kelly networks with shuffling
This page was built for publication: Networks of queues in discrete time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3037098)
