This chapter describes the key basic queueing models and outlines results that characterize their performance. Messages that arrive to the queueing system are stored in a wait facility, also ...

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

Retrial queueing systems represent a specialised branch of queueing theory where customers, upon encountering a busy server, do not simply abandon the process but instead join an external queue or ...

It is proved that, for a large class of stable stationary queueing systems with renewal arrival processes and without losses, a necessary condition for the departure process also to be a renewal ...

Queueing systems with non-exponential service distributions and a capacity restriction on the total residual service requirement (workload) are studied. Closed-form expressions of geometric form in ...

TITLE: A Non-Preemptive Priority Queueing System with a Single Server Serving Two Queues M/G/1 and M/D/1 with Optional Server Vacations Based on Exhaustive Service of the Priority Units ...