Algorithmic analysis of dual tandem queue with batch Markovian arrival process and repeated attempts at the first station

zbMATH Open1298.90027MaRDI QIDQ2929258FDOQ2929258

Authors: Valentina Klimenok, Alexander Dudin 

Publication date: 11 November 2014

Recommendations

• Retrial tandem queue with BMAP-input and semi-Markovian service process
• Investigation of the \(\mathrm{BMAP}/G/1\to\cdot/PH/1/M\) tandem queue with retrials and losses
• Tandem service system with batch Markov flow and repeated calls
• A tandem retrial queueing system with two Markovian flows and reservation of channels
• A tandem \(\text{BMAP}/G/1 \to \bullet/M/N/0\) queue with group occupation of servers at the second station

zbMATH Keywords

stationary state distributionretrialstandem queueing systemmulti-server stations

Mathematics Subject Classification ID

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

Cited In (6)

• Investigation of the \(\mathrm{BMAP}/G/1\to\cdot/PH/1/M\) tandem queue with retrials and losses
• Retrial tandem queue with BMAP-input and semi-Markovian service process
• A matrix-geometric approximation for tandem queues with blocking and repeated attempts
• Tandem service system with batch Markov flow and repeated calls
• On a tandem queue with retrials and losses
• Analysis of the BMAP/SM/1/N type system with randomized choice of customers admission discipline

This page was built for publication: Algorithmic analysis of dual tandem queue with batch Markovian arrival process and repeated attempts at the first station

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929258)