Markovian queueing systems represent a cornerstone in the study of stochastic processes, offering a robust framework for modelling the random nature of service and arrival processes across diverse ...

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 ...

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 ...

Using simple exactly solvable models, we show that event-dependent time delays may lead to significant non-Poisson effects in the statistics of polymer chain growth. The results are confirmed by ...