相关论文: Lowest priority waiting time distribution in an ac…
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that…
In real-time systems, priorities assigned to real-time tasks determine the order of task executions, by relying on an underlying task scheduling policy. Assigning optimal priority values to tasks is critical to allow the tasks to complete…
We consider the problem of minimizing queue-length costs in a system with heterogenous parallel servers, operating in a many-server heavy-traffic regime with nondegenerate slowdown. This regime is distinct from the well-studied heavy…
This paper considers a multiclass processor-sharing queue with feedback. Jobs arrive according to renewal processes, and service times follow general distributions. Upon service completion, jobs may either depart the system or re-enter as a…
Our goal is to estimate the characteristic exponent of the input to a L\'evy-driven storage system from a sample of equispaced workload observations. The estimator relies on an approximate moment equation associated with the…
As the simplest model of transport of interacting particles in a disordered medium, we consider the asymmetric simple exclusion process (ASEP) in which particles with hard-core interactions perform biased random walks, on the supercritical…
In this paper we give the distribution of the position of the particle in the asymmetric simple exclusion process (ASEP) with the alternating initial condition. That is, we find $\mathbb{P}(X_m(t) \leq x)$ where $X_m(t)$ is the position of…
CPU scheduling is the reason behind the performance of multiprocessing and in time-shared operating systems. Different scheduling criteria are used to evaluate Central Processing Unit Scheduling algorithms which are based on different…
We consider a multivariate L\'evy process where the first coordinate is a L\'evy process with no negative jumps which is not a subordinator and the others are nondecreasing. We determine the Laplace-Stieltjes transform of the steady-state…
In this paper, we study joint queue-aware and channel-aware scheduling of arbitrarily bursty traffic over multi-state time-varying channels, where the bursty packet arrival in the network layer, the backlogged queue in the data link layer,…
This work develops a methodology for studying the effect of an offload zone on the ambulance ramping problem using a multi-server, multi-class non-preemptive priority queueing model that can be treated analytically. A prototype model for…
Consider an M/M/$s$ queue with the additional feature that the arrival rate is a random variable of which only the mean, variance, and range are known. Using semi-infinite linear programming and duality theory for moment problems, we…
We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…
An important open problem in the theory of L\'evy flights concerns the analytically tractable formulation of absorbing boundary conditions. Although numerical studies using the correctly defined nonlocal approach have yielded substantial…
This paper applies a custom model order reduction technique to the distribution grid state estimation problem. Specifically, the method targets the situation where, due to pseudo-measurement uncertainty, it is advantageous to run the state…
We consider communication in a fully cooperative multi-agent system, where the agents have partial observation of the environment and must act jointly to maximize the overall reward. We have a discrete-time queueing network where agents…
We consider the problem of computing first-passage time distributions for reaction processes modelled by master equations. We show that this generally intractable class of problems is equivalent to a sequential Bayesian inference problem…
The waiting time distribution $w(\tau)$, i.e. the probability for a delay $\tau$ between two subsequent transition (`jumps') of particles, is a statistical tool in (quantum) transport. Using generalized Master equations for systems coupled…
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' linear program (LP) is critical, but does not require that it…
We study the problem of equitably and efficiently allocating an arriving resource to multiple queues with customer abandonment. The problem is motivated by the cadaveric liver allocation system of the United States, which includes a large…