We consider a continuous polling system in heavy traffic. Using the relationship between such systems and age-dependent branching processes, we show that the steady-state number of waiting customers in heavy traffic has approximately a gamma distribution. Moreover, given their total number, the configuration of these customers is approximately deterministic
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We c...
In this paper, we study a two-queue polling model with zero switchover times and k-limited service (...
We study an asymmetric cyclic polling system with Poisson arrivals, general service-time and switch-...
We consider a continuous polling system in heavy traffic. Using the relationship between such system...
For a broad class of polling models the evolution of the system at specific embedded polling instant...
We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-ti...
We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-ti...
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We c...
We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-ti...
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We c...
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We c...
In this paper, we study a two-queue polling model with zero switchover times and k-limited service (...
We study an asymmetric cyclic polling system with Poisson arrivals, general service-time and switch-...
We consider a continuous polling system in heavy traffic. Using the relationship between such system...
For a broad class of polling models the evolution of the system at specific embedded polling instant...
We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-ti...
We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-ti...
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We c...
We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-ti...
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We c...
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We c...
In this paper, we study a two-queue polling model with zero switchover times and k-limited service (...
We study an asymmetric cyclic polling system with Poisson arrivals, general service-time and switch-...