Over recent years it has become increasingly evident that “classical” queueing theory cannot
easily handle complex queueing systems and networks with many interacting elements. As …

The Shortest Remaining Processing Time (SRPT) scheduling policy and variants thereof
have been deployed in many computer systems, including web servers [5], networks [9] …

We present the first near-exact analysis of an M/PH/k queue with m> 2 preemptive-resume
priority classes. Our analysis introduces a new technique, which we refer to as Recursive …

We consider a non-preemptive priority head of the line queueing system with multiple
servers and two classes of customers. The arrival process for each class is Poisson, and the …

Queueing delays are ubiquitous in many domains, including computer systems, service
systems, communication networks, supply chains, and transportation. Queueing and …

We consider a queueing system with multiple servers and two classes of customers
operating under a preemptive resume priority rule. The arrival process for each class is …

Expressions are derived for the mean response times of each priority level in a multiserver
M/M/m queue operating under preemptive resume scheduling. Exact results are obtained for …

A class of two-dimensional birth-and-death processes, with applications in many modelling
problems, is defined and analysed in the steady state. These are processes whose …

A common digital transmission facility provides service to a community of heterogeneous
users generating traffic with differing intensity, message length, and bit rate. In order for this …

Finding an optimal/near-optimal scheduling algorithm to minimize the age of information
(AoI) in a multi-source G/G/1 system is well-known to be a hard problem, more so if there is a …