Add to ORKGAbstract. In this paper, we will develop a general framework to analyze polling systems with either the autonomous-server or the time-limited service discipline. We consider Poisson batch arrivals and phase-type service times. It is known that these disciplines do not satisfy the well-known branching property in polling system. Therefore, hardly any exact results exist in the literature. Our strategy is to apply an iterative scheme that is based on relating in closed-form the joint queue-length at the beginning and the end of a server visit to a queue. These kernel relations are derived using the theory of absorbing Markov chains
We consider a polling system of N queues Q1,..., QN, cyclically visited by a single server. Customer...
We consider a polling system where a group of an infinite number of servers visits sequen-tially a s...
AbstractWe study polling systems with Poisson arrival streams and exhaustive service discipline in t...
In this paper, we will develop a general framework to analyze polling systems with either the autono...
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the tim...
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the tim...
In this paper we consider a single-server, cyclic polling system with switch-over times. A distingui...
In the present article, we analyze a class of time-limited polling systems. In particular, we will d...
This paper considers polling systems with an autonomous server that remain at a queue for an exponen...
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson ...
This study is devoted to a queueing analysis of polling systems with a probabilistic server routing ...
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson ...
In the present article, we analyze a class of time-limited polling systems. In particular, we will d...
We consider a cyclic polling system with general service times, general switch-over times, and simul...
We consider a polling system of N queues Q1,..., QN, cyclically visited by a single server. Customer...
We consider a polling system where a group of an infinite number of servers visits sequen-tially a s...
AbstractWe study polling systems with Poisson arrival streams and exhaustive service discipline in t...
In this paper, we will develop a general framework to analyze polling systems with either the autono...
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the tim...
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the tim...
In this paper we consider a single-server, cyclic polling system with switch-over times. A distingui...
In the present article, we analyze a class of time-limited polling systems. In particular, we will d...
This paper considers polling systems with an autonomous server that remain at a queue for an exponen...
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson ...
This study is devoted to a queueing analysis of polling systems with a probabilistic server routing ...
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson ...
In the present article, we analyze a class of time-limited polling systems. In particular, we will d...
We consider a cyclic polling system with general service times, general switch-over times, and simul...
We consider a polling system of N queues Q1,..., QN, cyclically visited by a single server. Customer...
We consider a polling system where a group of an infinite number of servers visits sequen-tially a s...
AbstractWe study polling systems with Poisson arrival streams and exhaustive service discipline in t...