activity
20132020
most citedNon-Stationary Queues with Batch Arrivals

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

collaborators

5 papers

math.PR2020★ 3 cited

Non-Stationary Queues with Batch Arrivals

Andrew Daw, Brian Fralix, Jamol Pender

Motivated by applications that involve setting proper staffing levels for multi-server queueing systems with batch arrivals, we present a thorough study of the queue-length process…

math.PR2016

Time-dependent analysis of an preemptive priority system with two priority classes

Jori Selen, Brian Fralix

We analyze the time-dependent behavior of an priority queue having two customer classes, class-dependent service rates, and preemptive priority between classes. More partic…

math.PR2015

Clearing Analysis on Phases: Exact Limiting Probabilities for Skip-free, Unidirectional, Quasi-birth-death Processes

Sherwin Doroudi, Brian Fralix, Mor Harchol-Balter

Many problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases.…

math.PR2013

First passage times to congested states of many-server systems in the Halfin-Whitt regime

Brian H. Fralix, Charles Knessl, Johan S. H. van Leeuwaarden

We consider the heavy-traffic approximation to the queueing system in the Halfin-Whitt regime, where both the number of servers and the arrival rate grow large (ta…

math.PR2013

Factorization identities for reflected processes, with applications

Brian H. Fralix, Johan S. H. van Leeuwaarden, Onno J. Boxma

We derive factorization identities for a class of preemptive-resume queueing systems, with batch arrivals and catastrophes that, whenever they occur, eliminate multiple customers p…