activity
20192022
most citedInduced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms

8 citations · 9 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2022

Asymptotic optimality of switched control policies in a simple parallel server system under an extended heavy traffic condition

Rami Atar, Eyal Castiel, Marty Reiman

This paper studies a 2-class, 2-server parallel server system under the recently introduced extended heavy traffic condition, which states that the underlying 'static allocation' l…

math.PR2022★ 1 cited

Scheduling in the high uncertainty heavy traffic regime

Rami Atar, Eyal Castiel, Yonatan Shadmi

We propose a model uncertainty approach to heavy traffic asymptotics that allows for a high level of uncertainty. That is, the uncertainty classes of underlying distributions accom…

math.OC2022

Parallel server systems under an extended heavy traffic condition: A lower bound

Rami Atar, Eyal Castiel, Martin I. Reiman

The standard setting for studying parallel server systems (PSS) at the diffusion scale is based on the heavy traffic condition (HTC), which assumes that the underlying static alloc…

math.PR2020

Fluid limits for Queue-based CSMA with polynomial rates, homogenization and reflection

Eyal Castiel

We study in this paper a variation of the acclaimed CSMA random access protocol. We will focus on the case where back-off rates at each node is polynomial in the size of the queue.…

math.PR2019★ 8 cited

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…