Markov chains and queueing theory together provide a robust framework for analysing systems that evolve randomly over time. Markov chains describe stochastic processes where the future state depends ...

Retrial queueing systems represent a class of models in which arriving customers, upon encountering a busy or unavailable server, enter a virtual waiting room—commonly referred to as an orbit—to ...

Queueing networks are stochastic systems formed by interconnected resources routing and serving jobs. They induce jump processes with distinctive properties, and find widespread use in inferential ...

The purpose of the course is to present some of the classical results in queueing theory, mainly in the analysis of single-server queues and Markovian (reversible) stochastic networks. Another goal is ...

We examine the effects of nonstationarity on the performance of multiserver queueing systems with exponential service times and sinusoidal Poisson input streams. Our primary objective is to determine ...