English
Related papers

Related papers: A Study of a Loss System with Priorities

200 papers

As pressure on the healthcare system increases, patients that require elective surgery experience longer access times to pre- and post-operative appointments and surgery. Hospitals can control their waiting lists by allocating timeslots to…

Optimization and Control · Mathematics 2024-10-15 Y. M. van der Vlugt , J. T. van Essen , R. F. M. Vromans , M. Carlier

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there…

Networking and Internet Architecture · Computer Science 2011-10-28 Chandramani Singh , Eitan Altman , Anurag Kumar , Rajesh Sundaresan

In an earlier paper, a randomized load balancing model was studied in a heavy traffic asymptotic regime where the load balancing stream is thin compared to the total arrival stream. It was shown that the limit is given by a system of…

Probability · Mathematics 2024-09-24 Rami Atar , Tomoyuki Ichiba

The presented study elaborates a multi-server catastrophic retrial queueing model considering preemptive repeat priority policy with phase-type (PH) distributed retrial times. For the sake of comprehension, the scenario of model operation…

Systems and Control · Electrical Eng. & Systems 2022-04-13 Raina Raj , Vidyottama Jain

A simple analytical solution is proposed for the stationary loss system of two parallel queues with finite capacity $K$, in which new customers join the shortest queue, or one of the two with equal probability if their lengths are equal.…

Probability · Mathematics 2017-12-13 Plinio S. Dester , Christine Fricker , Danielle Tibi

Markov decision process models and algorithms can be used to identify optimal policies for dispatching ambulances to spatially distributed customers, where the optimal policies indicate the ambulance to dispatch to each customer type in…

Optimization and Control · Mathematics 2023-03-03 Laura A. Albert

Multiple importance sampling estimators are widely used for computing intractable constants due to its reliability and robustness. The celebrated balance heuristic estimator belongs to this class of methods and has proved very successful in…

Computation · Statistics 2019-09-05 Felipe J Medina-Aguayo , Richard G Everitt

Drone delivery systems violate a core assumption in classical queueing models: server capacity is not fixed. Drones (servers) periodically must recharge, creating random fluctuations in service availability. We introduce an Erlang--S$^{*}$…

Probability · Mathematics 2026-02-12 Eliezer Fuentes-Quezada , Jamol Pender

We study a queueing system with Erlang arrivals with $k$ phases and Erlang service with $m$ phases. Transition rates among phases vary periodically with time. For these systems, we derive the asymptotic periodic distribution of the level…

Probability · Mathematics 2021-07-29 Barbara Margolius

Machine learning-based decision support systems are increasingly deployed in clinical settings, where probabilistic scoring functions are used to inform and prioritize patient management decisions. However, widely used scoring rules, such…

Machine Learning · Computer Science 2025-07-01 Gerardo A. Flores , Alyssa H. Smith , Julia A. Fukuyama , Ashia C. Wilson

The presented study elaborates a multi-server catastrophic retrial queueing model considering preemptive repeat priority policy with phase-type (PH) distributed retrial times. For the sake of comprehension, the scenario of model operation…

Performance · Computer Science 2022-01-21 Raina Raj , Vidyottama Jain

We develop a stochastic inventory system which accounts for the limited patience of backlogged customers. While limited patience is a feature that is closer to the nature of unmet demand, our model also unifies the classic backlogging and…

Optimization and Control · Mathematics 2024-04-02 Andrew E. B. Lim , Zhao-Xuan Wei , Hanqin Zhang

We introduce a fractional generalization of the Erlang Queues $M/E_k/1$. Such process is obtained through a time-change via inverse stable subordinator of the classical queue process. We first exploit the (fractional) Kolmogorov forward…

Probability · Mathematics 2018-12-31 Giacomo Ascione , Nikolai Leonenko , Enrica Pirozzi

The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focuses on a static setting with a fixed number of items, several…

Probability · Mathematics 2022-01-04 Céline Comte

In this paper, we investigate the number of customers that overlap or coincide with a virtual customer in an Erlang-A queue. Our study provides a novel approach that exploits fluid and diffusion limits for the queue to approximate the mean…

Probability · Mathematics 2025-07-02 Young Myoung Ko , Jamol Pender , Jin Xu

We consider the Erlang A model, or $M/M/m+M$ queue, with Poisson arrivals, exponential service times, and $m$ parallel servers, and the property that waiting customers abandon the queue after an exponential time. The queue length process is…

Probability · Mathematics 2014-12-10 Charles Knessl , Johan S. H. van Leeuwaarden

Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past. Complementing previous worst-case analyses, we study an average-case scenario where the load inputs are drawn from a fixed probability…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-03-28 Leran Cai , Thomas Sauerwald

Risk prediction is central to both clinical medicine and public health. While many machine learning models have been developed to predict mortality, they are rarely applied in the clinical literature, where classification tasks typically…

Machine Learning · Statistics 2017-12-05 Maggie Makar , Marzyeh Ghassemi , David Cutler , Ziad Obermeyer

A real-time multicore system requires delay bounds on access to shared resources. These resources include the kernel, which has potentially many non-preemptible critical sections guarded by one or more different synchronization primitives.…

Operating Systems · Computer Science 2026-05-28 Shriram Raja , Richard West

We study the problem of scheduling jobs on fault-prone machines communicating via a shared channel, also known as multiple-access channel. We have $n$ arbitrary length jobs to be scheduled on $m$ identical machines, $f$ of which are prone…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-07-26 Marek Klonowski , Dariusz R. Kowalski , Jarosław Mirek , Prudence W. H. Wong