Optimal routeing in two-queue polling systems
From MaRDI portal
Publication:4555299
DOI10.1017/JPR.2018.59zbMATH Open1402.60117arXiv1608.03070OpenAlexW2963439198WikidataQ128986820 ScholiaQ128986820MaRDI QIDQ4555299FDOQ4555299
Authors: Vidyadhar G. Kulkarni, Nelson Lee, Ivo Adan, E. Lefeber 
Publication date: 19 November 2018
Published in: Journal of Applied Probability (Search for Journal in Brave)
Abstract: We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a Poisson process. We study the control problem of how arrivals should be routed to the two queues in order to minimize expected waiting costs and characterize individually and socially optimal routing policies under three scenarios of available information at decision epochs: no, partial and complete information. In the complete information case, we develop a new iterative algorithm to determine individually optimal policies, and show that such policies can be described by a switching curve. We conjecture that a linear switching curve is socially optimal, and prove that this policy is indeed optimal for the fluid version of the two-queue polling system.
Full work available at URL: https://arxiv.org/abs/1608.03070
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Individual versus Social Optimization in Exponential Congestion Systems
- Dynamic programming and optimal control. Vol. 1.
- Solutions of ordinary differential equations as limits of pure jump markov processes
- Title not available (Why is that?)
- To queue or not to queue: equilibrium behavior in queueing systems.
- Equilibrium customer strategies in a single server Markovian queue with setup times
- Mathematical methods to study the polling systems
- Time-Sharing Service Systems. I
- A queueing network with a single cyclically roving server
- Sojourn times in vacation and polling systems with Bernoulli feedback
- Waiting times in queueing networks with a single shared server
- A polling model with smart customers
- Efficient visit frequencies for polling tables: Minimization of waiting cost
- On polling systems with large setups
- Individual equilibrium and learning in processor sharing systems
- Dynamic visit-order rules for batch-service polling
- Optimal control of a deterministic multiclass queuing system for which several queues can be served simultaneously
- Mean value analysis for polling systems
- Time-Sharing Service Systems. II
- Production scheduling in a flexible manufacturing system under random demand
- AN MDP DECOMPOSITION APPROACH FOR TRAFFIC CONTROL AT ISOLATED SIGNALIZED INTERSECTIONS
Cited In (9)
- Strategic behavior of customers and optimal control for batch service polling systems with priorities
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
- ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS
- Optimal routing parameters for queueing networks: their determination methods
- Strategic behaviour in a tandem queue with alternating server
- Optimal routing into two heterogeneous service stations with delayed information
- Workload analysis of a two-queue fluid polling model
- OPTIMAL BERNOULLI ROUTING IN AN UNRELIABLE M/G/1 RETRIAL QUEUE
- Strategic customer behavior in an \(M/M/1\) feedback queue
This page was built for publication: Optimal routeing in two-queue polling systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4555299)
