Related papers: Lowest priority waiting time distribution in an ac…
We provide the first analytical expressions for the expected waiting time of high-priority customers in the delayed APQ by exploiting a classical conservation law for work-conserving queues. Additionally, we describe an algorithm to compute…
In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…
In this paper we study a queue with L\'evy input, without imposing any a priori assumption on the jumps being one-sided. The focus is on computing the transforms of all sorts of quantities related to the transient workload, assuming the…
In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a…
Motivated by the operational problems in click and collect systems, such as curbside pickup programs, we study a joint admission control and capacity allocation problem. We consider a system where arriving customers have preferred service…
This paper considers a L\'evy-driven queue (i.e., a L\'evy process reflected at 0), and focuses on the distribution of $M(t)$, that is, the minimal value attained in an interval of length $t$ (where it is assumed that the queue is in…
The performance of non-preemptive M/M/1 queueing system with two priority is analyzed. By using complementary variable method to make vector Markov process and analyzing the state-change equations of the queueing system, the generating…
The L\'evy walk process for a lower interval of an excursion times distribution ($\alpha<1$) is discussed. The particle rests between the jumps and the waiting time is position-dependent. Two cases are considered: a rising and diminishing…
We calculate asymptotics of the distribution of the number of customers in orbit in a two-class priority retrial $M/G/1$-type queueing model. In this model, priority customers wait in line while non-priority customers join an orbit and…
This paper considers a multichannel preemptive-resume priority queueing system with a Poisson input and an arbitrary service time distribution depending on the priority of job. Jobs of the same priority are serviced according to the LIFO…
We introduce the prioritising exclusion process, a stochastic scheduling mechanism for a priority queueing system in which high priority customers gain advantage by overtaking low priority customers. The model is analogous to a totally…
In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority…
In many cognitive radio applications, there are multiple types of message queues. Existing queueing analysis works in underlay CR networks failed to discuss packets heterogeneity. Therefore high priority packets with impatient waiting time…
This paper aims at semi-parametrically estimating the input process to a L\'evy-driven queue by sampling the workload process at Poisson times. We construct a method-of-moments based estimator for the L\'evy process' characteristic…
We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving customers join the fastest idle server. A capacity allocation is…
Recently increased accessibility of large-scale digital records enables one to monitor human activities such as the interevent time distributions between two consecutive visits to a web portal by a single user, two consecutive emails sent…
In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority…
In this paper we analyze the transient behavior of the workload process in a L\'evy input queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential…
We study a queueing network with a strictly upper-triangular routing matrix, where each column contains at most one non-negative entry, and the root node receives input from a spectrally positive L\'{e}vy process. Our aim is to characterize…
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprisingly limited role in fielded systems. A new opportunity for…