Related papers: Lowest priority waiting time distribution in an ac…
In this paper, we consider a L\'evy-driven fluid queueing system where the server may subject to breakdowns and repairs. In addition, the server will leave for a vacation each time when he finds an empty system. We cast the queueing process…
Polling systems are a well-established subject in queueing theory. However, their formal treatments generally rely heavily on relatively sophisticated theoretical tools, such as moment generating functions and Laplace transforms, and…
This paper considers the mean waiting times in discrete-time preemptive-resume and nonpreemptive priority single-server queues fed by K independent batch Markovian arrival streams with geometrically distributed idle periods. While being…
The performance of Emergency Departments (EDs) is of great importance for any health care system, as they serve as the entry point for many patients. However, among other factors, the variability of patient acuity levels and corresponding…
This note examines the distributional implications of introducing a fast-track queue for accessing a service when agents are heterogeneous in both income and service valuation. Relative to a single free queue, I show that willingness to…
We consider a load balancing system comprised of a fixed number of single server queues, operating under the well-known Join-the-Shortest Queue policy, and where jobs/customers are impatient and abandon if they do not receive service after…
We consider a queuing model with the workload evolving between consecutive i.i.d.\ exponential timers $\{e_q^{(i)}\}_{i=1,2,...}$ according to a spectrally positive L\'evy process $Y_i(t)$ that is reflected at zero, and where the…
The L\'evy walk process for the lower interval of the time of flight distribution ($\alpha<1$) and with finite resting time between consecutive flights is discussed. The motion is restricted to a region bounded by two absorbing barriers and…
We study a double-ended queue which consists of two classes of customers. Whenever there is a pair of customers from both classes, they are matched and leave the system immediately. The matching follows first-come-first-serve principle. If…
Queuing models provide insight into the temporal inhomogeneity of human dynamics, characterized by the broad distribution of waiting times of individuals performing tasks. We study the queuing model of an agent trying to execute a task of…
In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and…
Last passage times arise in a number of areas of applied probability, including risk theory and degradation models. Such times are obviously not stopping times since they depend on the whole path of the underlying process. We consider the…
Explicit results are obtained using simple and exact methods for the joint queue-length distribution of the M/M/c queue with an arbitrary number of non-preemptive priority levels. This work is the first to provide explicit results for the…
We analyze the so-called Shortest Queue First (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time that queue with the smallest workload. Considering a stationary system composed of two…
Priority queues are fundamental abstract data structures, often used to manage limited resources in parallel programming. Several proposed parallel priority queue implementations are based on skiplists, harnessing the potential for…
Priority queues are one of the most fundamental and widely used data structures in computer science. Their primary objective is to efficiently support the insertion of new elements with assigned priorities and the extraction of the highest…
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.…
We analyze the time-dependent behavior of an $M/M/c$ priority queue having two customer classes, class-dependent service rates, and preemptive priority between classes. More particularly, we develop a method that determines the Laplace…
The L\'evy walk process with rests is discussed. The jumping time is governed by an $\alpha$-stable distribution with $\alpha>1$ while a waiting time distribution is Poissonian and involves a position-dependent rate which reflects a…
In this paper we generalize known workload decomposition results for L\'{e}vy queues with secondary jump inputs and queues with server vacations or service interruptions. Special cases are polling systems with either compound Poisson or…