We investigate a gated polling system with semi-linear feedback and Markovian routing. We thereby relax the classical independence assumption on the walking times; the walking times constitute a sequence of stationary ergodic random variables. It is shown that the dynamics of this polling system can be described by semi-linear stochastic recursive equations in a Markovian environment. We obtain expressions for the first and second order moments of the workload and queue content at polling instants and for the mean queue content and workload at random instants
We consider a polling system where a group of an infinite number of servers visits sequentially a se...
We consider a class of two-queue polling systems with exhaustive service, where the order in which t...
An ergodic semi-Markov process with the structure represented by the full graph with loops, which si...
We investigate a gated polling system with semi-linear feedback and Markovian routing. We thereby re...
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalize...
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalize...
This study is devoted to a queueing analysis of polling systems with a probabilistic server routing ...
The polling network considered here consists of a finite collection of stations visited successively...
AbstractThe polling network considered here consists of a finite collection of stations visited succ...
Motivated by an application in wireless random-access networks, we study a class of polling systems ...
Abstract We consider polling systems in which a single server visits stations in cyclic order and se...
We devise an approximation of the marginal queue length distribution in discrete-time polling system...
We consider a polling system where a group of an infinite number of servers visits sequentially a se...
We consider a class of two-queue polling systems with exhaustive service, where the order in which t...
An ergodic semi-Markov process with the structure represented by the full graph with loops, which si...
We investigate a gated polling system with semi-linear feedback and Markovian routing. We thereby re...
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalize...
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalize...
This study is devoted to a queueing analysis of polling systems with a probabilistic server routing ...
The polling network considered here consists of a finite collection of stations visited successively...
AbstractThe polling network considered here consists of a finite collection of stations visited succ...
Motivated by an application in wireless random-access networks, we study a class of polling systems ...
Abstract We consider polling systems in which a single server visits stations in cyclic order and se...
We devise an approximation of the marginal queue length distribution in discrete-time polling system...
We consider a polling system where a group of an infinite number of servers visits sequentially a se...
We consider a class of two-queue polling systems with exhaustive service, where the order in which t...
An ergodic semi-Markov process with the structure represented by the full graph with loops, which si...