most citedApplications of polling systems

137 citations · 194 across the 8 of their papers we have counts for

collaborators

8 papers

math.PR2016

Networks of fixed-cycle intersections

Marko Boon, Johan van Leeuwaarden

We present an algorithmic method for analyzing networks of intersections with static signaling, with as primary example a line network that allows traffic flow over several interse…

math.PR20163 cited

Heavy traffic analysis of roving server networks

Marko Boon, Rob van der Mei, Erik Winands

This paper studies the heavy-traffic (HT) behaviour of queueing networks with a single roving server. External customers arrive at the queues according to independent renewal proce…

math.PR20144 cited

Queueing networks with a single shared server: light and heavy traffic

Marko Boon, Rob van der Mei, Erik Winands

We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues…

math.PR2014137 cited

Applications of polling systems

Marko Boon, Rob van der Mei, Erik Winands

Since the first paper on polling systems, written by Mack in 1957, a huge number of papers on this topic has been written. A typical polling system consists of a number of queues,…

math.PR201426 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.PR201412 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…