A polling model with smart customers
From MaRDI portal
Abstract: In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this model we study the joint queue length distribution at polling epochs and at server's departure epochs. We also study the marginal queue length distribution at arrival epochs, as well as at arbitrary epochs (which is not the same in general, since we cannot use the PASTA property). A generalised version of the distributional form of Little's law is applied to the joint queue length distribution at customer's departure epochs in order to find the waiting time distribution for each customer type. We also provide an alternative, more efficient way to determine the mean queue lengths and mean waiting times, using Mean Value Analysis. Furthermore, we show that under certain conditions a Pseudo-Conservation Law for the total amount of work in the system holds. Finally, typical features of the model under consideration are demonstrated in several numerical examples.
Recommendations
Cites work
- A polling model with reneging at polling instants
- A single server queue with arrival rate dependent on server breakdowns
- scientific article; zbMATH DE number 47258 (Why is no real title available?)
- scientific article; zbMATH DE number 953818 (Why is no real title available?)
- Lévy-driven polling systems and continuous-state branching processes
- Mathematical methods to study the polling systems
- Mean value analysis for polling systems
- Mixed gated/exhaustive service in a polling model with priorities
- On polling systems with large setups
- On Stochastic Decomposition in M/G/1 Type Queues with Generalized Server Vacations
- Optimal Entering Rules for a Customer with Wait Option at an M/G/1 Queue
- Polling Models With and Without Switchover Times
- Polling systems and multitype branching processes
- Polling systems with breakdowns and repairs.
- Polling systems with station breakdowns
- Pseudo-conservation laws in cyclic-service systems
- Queues with Periodic Service and Changeover Time
- Queuing analysis of polling models
- Stochastic bounds for a polling system
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- Two queues with alternating service and server breakdown
- Working vacations queueing model with multiple types of server breakdowns A new hybrid-Trefftz triangular and quadrilateral plate elements
Cited in
(10)- A polling model with an autonomous server
- A new look at a smart polling model
- On a 2-class polling model with reneging and \(k_i\)-limited service
- A polling model with reneging at polling instants
- Relating polling models with zero and nonzero switchover times
- Waiting times in queueing networks with a single shared server
- A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers
- Polling Models With and Without Switchover Times
- A POLLING MODEL WITH RETRIAL CUSTOMERS
- Optimal routeing in two-queue polling systems
This page was built for publication: A polling model with smart customers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607629)
