7 papers
Fork-join and redundancy systems with heavy-tailed job sizes
Youri Raaijmakers, Sem Borst, Onno Boxma
We investigate the tail asymptotics of the response time distribution for the cancel-on-start (c.o.s.) and cancel-on-completion (c.o.c.) variants of redundancy- scheduling and t…
Reinforcement learning for Admission Control in 5G Wireless Networks
Youri Raaijmakers, Silvio Mandelli, Mark Doll
The key challenge in admission control in wireless networks is to strike an optimal trade-off between the blocking probability for new requests while minimizing the dropping probab…
Comparison of the FCFS and PS discipline in Redundancy Systems
Youri Raaijmakers
We consider the c.o.c. redundancy system with parallel servers where incoming jobs are immediately replicated to servers chosen uniformly at random (without replacement). A…
Achievable Stability in Redundancy Systems
Youri Raaijmakers, Sem Borst
We consider a system with parallel servers where incoming jobs are immediately replicated to, say, servers. Each of the servers has its own queue and follows a FCFS dis…
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…
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,…