72 citations · 515 across the 50 of their papers we have counts for
4 papers · 1 filter
Crossover times in bipartite networks with activity constraints and time-varying switching rates
Sem Borst, Frank den Hollander, Francesca Nardi +1
In this paper we study the performance of a bipartite network in which customers arrive at the nodes of the network, but not all nodes are able to serve their customers at all time…
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,…
Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
Eyal Castiel, Sem Borst, Laurent Miclo +2
We examine a queue-based random-access algorithm where activation and deactivation rates are adapted as functions of queue lengths. We establish its heavy traffic behavior on a com…
Hyper-Scalable JSQ with Sparse Feedback
Mark van der Boor, Sem Borst, Johan van Leeuwaarden
Load balancing algorithms play a vital role in enhancing performance in data centers and cloud networks. Due to the massive size of these systems, scalability challenges, and espec…