Finite-Buffer Polling Systems with Threshold-Based Switching Policy - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles TOP Year : 2016

Finite-Buffer Polling Systems with Threshold-Based Switching Policy


We consider a system of two separate finite-buffer M/M/1 queues served by a single server, where the switching mechanism between the queues is threshold-based, determined by the queue which is not being served. Applications may be found in data centers, smart traffic-light control and human behavior. Specifically, whenever the server attends queue $i (Q i)$ and the number of customers in the other queue, $Q j (i, j = 1, 2; j = i)$, reaches its threshold level, the server immediately switches to $Q j$ whenever $Q i$ is below its threshold. When a served $Q i$ becomes empty we consider two scenarios: (i) non-work-conserving; and (ii) work-conserving. We present occasions where the non-work-conserving policy is more economical than the work-conserving policy when high switching costs are involved. An intrinsic feature of the process is an oscillation phenomenon: when the occupancy of $Q i$ decreases the occupancy of the other queue increases. This fact is illustrated and discussed. By formulating the system as a three-dimensional continuous-time Markov chain we provide a probabilistic analysis of the system and investigate the effects of buffer sizes and arrival rates, as well as service rates, on the system's performance. Numerical examples are presented and extreme cases are investigated.
Fichier principal
Vignette du fichier
FiniteBufferFinalVerKA.pdf (1.18 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01402886 , version 1 (25-11-2016)



Konstantin Avrachenkov, Efrat Perel, Uri Yechiali. Finite-Buffer Polling Systems with Threshold-Based Switching Policy. TOP, 2016, 24 (3), pp.541 - 571. ⟨10.1007/s11750-015-0408-6⟩. ⟨hal-01402886⟩


72 View
143 Download



Gmail Facebook X LinkedIn More