Related papers: On open problems in polling systems
Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i=1,2) finds the server busy, it is blocked and routed to a separate type-i…
The paper analyzes the performance of tandem network of polling queue with setups. For a system with two-products and two-stations, we propose a new approach based on a partially-collapsible state-space characterization to reduce…
We study an optimal-control problem of polling systems with large switchover times, when a holding cost is incurred on the queues. In particular, we consider a stochastic network with a single server that switches between several buffers…
We consider a polling system with two queues, where a single server is attending the queues in a cyclic order and requires non-zero switching times to switch between the queues. Our aim is to identify a fairly general and comprehensive…
We consider a service system with two Poisson arrival queues. A server chooses which queue to serve at each moment. Once a queue is served, all the customers will be served within a fixed amount of time. This model is useful in studying…
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this…
We study a two-stage tandem service queue attended by two servers. Each job-server pair must complete both service phases together, with the server unable to begin a new job until the current one is fully processed after two stages.…
We present an example of a single-server polling system with two queues and an adaptive service policy where the stability region depends on the expected values of all the primitives and also on a certain exponential moment of the…
In this paper, we analyze a polling system on a circle with. Random batches of customers arrive at a circle, where each customer, independently, obtains a location according to a general distribution. A single server cyclically travels over…
We consider a discrete time parallel queue, which is two-queue network, where at each time-slot there is a the same batch arrival to both queues and at each queue there is a random service available. The service law at each time-slot for…
A special customer must complete service from two servers in series, in either order, each with an M/M/1 queueing system. It is assumed that the two queueing system lengths are independent with initial numbers of customers a and b at the…
The paper studies a closed queueing network containing two types of node. The first type (server station) is an infinite server queueing system, and the second type (client station) is a single server queueing system with autonomous…
We study a model of a polling system, that is, a collection of $d$ queues with a single server that switches from queue to queue. The service time distribution and arrival rates change randomly every time a queue is emptied. This model is…
The paper considers a queueing system with limited processor sharing. No more than n jobs may be served simultaneously. This system may be used for modeling bandwidth sharing in wireless communication systems and processes of service in…
This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system is represented in terms of a process that describes the…
The models studied in the steady state involve two queues which are served either by a single server whose speed depends on the number of jobs present, or by several parallel servers whose number may be controlled dynamically. Job service…
In this paper we study a two-queue polling model with zero switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$, $i=1,2$) in each queue. The arrival processes at the two queues are…
The queue system,with Poisson arrivals,constant service time and infinite servers, busy period distribution is intensively studied because, due to its probability density function quite easy interpretation, it may serve as a clue to…
A heterogeneous closed network with one-server queues with finite capacity and one infinite-server queue is studied. A target application is bike-sharing systems. Heterogeneity is taken into account through clusters whose queues have the…
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalizes the classical Markovian polling model, in the sense that two routing matrices are involved, the choice being made according to the state…