2 citations · 2 across the 4 of their papers we have counts for
7 papers
Threshold-based rerouting and replication for resolving job-server affinity relations
Youri Raaijmakers, Sem Borst, Onno Boxma
We consider a system with several job types and two parallel server pools. Within the pools the servers are homogeneous, but across pools possibly not in the sense that the service…
A Multiplicative Version of the Lindley Recursion
Onno Boxma, Andreas Löpker, Michel Mandjes +1
This paper presents an analysis of the stochastic recursion that can be interpreted as an autoregressive process of order 1, reflected at 0. We start our…
Stability of Redundancy Systems with Processor Sharing
Youri Raaijmakers, Sem Borst, Onno Boxma
We investigate the stability condition for redundancy-d systems where each of the servers follows a processor-sharing (PS) discipline. We allow for generally distributed job sizes,…
Redundancy scheduling with scaled Bernoulli service requirements
Youri Raaijmakers, Sem Borst, Onno Boxma
Redundancy scheduling has emerged as a powerful strategy for improving response times in parallel-server systems. The key feature in redundancy scheduling is replication of a job u…
A single server queue with batch arrivals and semi-Markov services
Abhishek, Marko Boon, Onno Boxma +1
We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical queue with semi-Markov s…
Queues with random back-offs
Niek Bouman, Sem C. Borst, Onno J. Boxma +1
We consider a broad class of queueing models with random state-dependent vacation periods, which arise in the analysis of queue-based back-off algorithms in wireless random-access…