Waiting times in queueing networks with a single shared server
From MaRDI portal
Abstract: We study a queueing network with a single shared server that serves the queues in a cyclic order. External customers arrive at the queues according to independent Poisson processes. After completing service, a customer either leaves the system or is routed to another queue. This model is very generic and finds many applications in computer systems, communication networks, manufacturing systems, and robotics. Special cases of the introduced network include well-known polling models, tandem queues, systems with a waiting room, multi-stage models with parallel queues, and many others. A complicating factor of this model is that the internally rerouted customers do not arrive at the various queues according to a Poisson process, causing standard techniques to find waiting-time distributions to fail. In this paper we develop a new method to obtain exact expressions for the Laplace-Stieltjes transforms of the steady-state waiting-time distributions. This method can be applied to a wide variety of models which lacked an analysis of the waiting-time distribution until now.
Recommendations
- Network of single-server queues with dependent service times
- Technical Note—A Note on Waiting Times in Single Server Queues
- Some comparability results for waiting times in single- and many-server queues
- scientific article; zbMATH DE number 3939067
- Single server tandem queues and queueing networks with non-correlated successive service times
- ON THE RELAXATION TIME FOR SINGLE SERVER QUEUES
- Single server queueing networks with varying sevice times and renewal input
- scientific article; zbMATH DE number 19789
Cites work
- scientific article; zbMATH DE number 3858807 (Why is no real title available?)
- scientific article; zbMATH DE number 845596 (Why is no real title available?)
- A cyclic service tandem queueing model with parallel queues in the first stage
- A polling model with smart customers
- A queueing network with a single cyclically roving server
- A queuing model with feedback
- A service system with two stages of waiting and feedback of customers
- A single server tandem queue
- An M/G/1 queue with multiple types of feedback and gated vacations
- File and Work Transfers in Cyclic Queue Systems
- Polling systems and multitype branching processes
- Polling systems in heavy traffic: a Bessel process limit
- Polling systems with periodic server routeing in heavy traffic: distribution of the delay
- Polling systems with periodic server routing in heavy traffic: renewal arrivals
- Polling systems with permanent and transient jobs
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- Queue lengths and workloads in polling systems
- Queues with Periodic Service and Changeover Time
- Sojourn times in vacation and polling systems with Bernoulli feedback
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- Towards a unifying theory on branching-type polling systems in heavy traffic
- Two Queues in Tandem Attended by a Single Server
Cited in
(10)- A queueing network with a single cyclically roving server
- An asymptotic property of branching-type overloaded polling networks
- scientific article; zbMATH DE number 19789 (Why is no real title available?)
- Single server queueing networks with varying sevice times and renewal input
- scientific article; zbMATH DE number 431647 (Why is no real title available?)
- The analysis of batch sojourn-times in polling systems
- Optimal routeing in two-queue polling systems
- Queue-length balance equations in multiclass multiserver queues and their generalizations
- Heavy traffic analysis of roving server networks
- scientific article; zbMATH DE number 932424 (Why is no real title available?)
This page was built for publication: Waiting times in queueing networks with a single shared server
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364620)
