activity
20112023
most citedClosed-Form Waiting Time Approximations for Polling Systems

26 citations · 219 across the 27 of their papers we have counts for

collaborators
Showing 2014Show all

11 papers · 1 filter

math.PR2014★ 23 cited

Joint queue length distribution of multi-class, single server queues with preemptive priorities

Andrei Sleptchenko, Jori Selen, Ivo Adan +1

In this paper we analyze an queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between c…

math.PR2014★ 21 cited

A Polling Model with Multiple Priority Levels

Marko Boon, Ivo Adan, Onno Boxma

In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which custome…

math.PR2014★ 13 cited

Delays at signalised intersections with exhaustive traffic control

Marko Boon, Ivo Adan, Erik Winands +1

In this paper we study a traffic intersection with vehicle-actuated traffic signal control. Traffic lights stay green until all lanes within a group are emptied. Assuming general r…

math.PR2014★ 26 cited

Closed-Form Waiting Time Approximations for Polling Systems

Marko Boon, Erik Winands, Ivo Adan +1

A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focusses on Poisson arrivals,…

math.PR2014★ 12 cited

A Polling Model with Smart Customers

Marko Boon, Sandra van Wijk, Ivo Adan +1

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…

math.PR2014

A Two-Queue Polling Model with Two Priority Levels in the First Queue

Marko Boon, Ivo Adan, Onno Boxma

In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. T…