A single-server queueing system with batch Markov arrivals, semi-Markov service, and finite buffer: its characteristics

DOI10.1023/A:1019831410410zbMath1066.60080OpenAlexW1573818288MaRDI QIDQ1778730

G. V. Tsarenkov, Valentina I. Klimenok, Alexander N. Dudin

Publication date: 17 June 2005

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019831410410

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks ⋮ On the distribution of the number of consecutively lost customers in the \textit{BMAP}/\textit{PH}/1/\textit{N} system ⋮ Idle time utilization through service to customers in a retrial queue maintaining high system reliability ⋮ Analysis of the BMAP/SM/1/N Type System with Randomized Choice of Customers Admission Discipline ⋮ Transient and stationary characteristics of a packet buffer modelled as an \(\mathrm{MAP}/\mathrm{SM}/1/b\) system ⋮ The \(MAP + MAP/PH/1/N\) queuing system with single and batch arrivals of customers

This page was built for publication: A single-server queueing system with batch Markov arrivals, semi-Markov service, and finite buffer: its characteristics