A Retrial Queueing System with a Finite Buffer, several Input Flows and a Customer Searching Server to a
buffer of
finite capacity. If a customer upon arrival finds the
buffer full, he joins an orbit
Improved Priority Scheme for Unreliable Queueing System service. According to this discipline, arriving customers are stored in the
finite buffers dedicated
Improved Priority Scheme for Unreliable Queueing System service. According to this discipline, arriving customers are stored in the
finite buffers dedicated
Tandem queues with a Markov flow and blocking. Both phases are characterized by one server with a
buffer of
finite capacity. The service times have
The MAP/MSP/1/r queueing system with background customers are considered. The system has a
finite buffer for principal customers. The service discipline is characterized
A Queueing System with Negative Claims, Infinite Buffer and Finite Bunker for Superseded Claims an ordinary claim queued in the
buffer and moves it to a
finite-capacity
buffer of superseded claims (bunker