activity
20102026
most citedAchieving Rapid Recovery in an Overload Control for Large-Scale Service Systems

1 citations · 2 across the 9 of their papers we have counts for

collaborators

11 papers

cs.IT2026

Stability of Fork-Join Systems with Redundancy and Heterogeneous Servers

Chutong Gao, Seyed Iravani, Ohad Perry

We consider the stability problem of fork-join systems with redundancy (FJR) and heterogeneous servers under both static and dynamic capacity-allocation policies. In an FJR…

math.PR2020

Existence and Approximations of Moments for Polling Systems under the Binomial-Exhaustive Policy

Yue Hu, Jing Dong, Ohad Perry

We establish sufficient conditions for the existence of moments of the steady-state queue in polling systems operating under the binomial-exhaustive policy (BEP). We assume that th…

math.PR2020

Many-Server Heavy-Traffic Limits for Queueing Systems with Perfectly Correlated Service and Patience Times

Lun Yu, Ohad Perry

We characterize heavy-traffic process and steady-state limits for systems staffed according to the square-root safety rule, when the service requirements of the customers are perfe…

math.PR2020★ 1 cited

Asymptotic Optimality of the Binomial-Exhaustive Policy for Polling Systems with Large Switchover Times

Yue Hu, Jing Dong, Ohad Perry

We study an optimal-control problem of polling systems with large switchover times, when a holding cost is incurred on the queues. In particular, we consider a stochastic network w…

math.PR2019

Stability of Parallel Server Systems

Pascal Moyal, Ohad Perry

The fundamental problem in the study of parallel-server systems is that of finding and analyzing `good' routing policies of arriving jobs to the servers. It is well known that, if…

math.PR2015

On the Instability of Matching Queues

Pascal Moyal, Ohad Perry

A matching queue is described via a graph together with a matching policy. Specifically, to each node in the graph there is a corresponding arrival process of items which can e…

math.PR2014

A Switching Fluid Limit of a Stochastic Network Under a State-Space-Collapse Inducing Control with Chattering

Ohad Perry, Ward Whitt

Routing mechanisms for stochastic networks are often designed to produce state space collapse (SSC) in a heavy-traffic limit, i.e., to confine the limiting process to a lower-dimen…

math.PR2013★ 1 cited

Achieving Rapid Recovery in an Overload Control for Large-Scale Service Systems

Ohad Perry, Ward Whitt

We consider an automatic overload control for two large service systems modeled as multi-server queues, such as call centers. We assume that the two systems are designed to operate…

math.PR2010

An ODE for an Overloaded X Model Involving a Stochastic Averaging Principle

Ohad Perry, Ward Whitt

We study an ordinary differential equation (ODE) arising as the many-server heavy-traffic fluid limit of a sequence of overloaded Markovian queueing models with two customer classe…

math.PR2010

Diffusion Approximation for an Overloaded X Model Via a Stochastic Averaging Principle

Ohad Perry, Ward Whitt

In previous papers we developed a deterministic fluid approximation for an overloaded Markovian queueing system having two customer classes and two service pools, known in the call…

math.PR2010

A Fluid Limit for an Overloaded X Model Via a Stochastic Averaging Principle

Ohad Perry, Ward Whitt

We prove a many-server heavy-traffic fluid limit for an overloaded Markovian queueing system having two customer classes and two service pools, known in the call-center literature…