A comparison of a classical retrial M/G/1 queueing system and a Lakatos-type M/G/1 cyclic-waiting time queueing system

MaRDI QIDQ3428751zbMATHFDO

Authors K. V. Mykhalevych

Publication date 29 March 2007

zbMATH Keywords

queueing system

Mathematics Subject Classification ID

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

Recommendations

• \( GI / G / 1\) lakatos-type queueing system with \(T\)-retrials
• Retrial queueing system \(M/M/1/0\) with combined service discipline
• Cyclic-retrial queuing systems with dispatching
• Standard and retrial queueing systems: A comparative analysis
• On the \(M/G/1\) retrial queueing system with linear control policy

Cited in

(6)

• Cyclic-retrial queuing systems with dispatching
• Analyzing a degenerate buffer with general inter-arrival and service times in discrete time
• Retrial queueing system \(M/M/1/0\) with combined service discipline
• A retrial queueing system with urgent customers
• Cyclic-waiting systems
• \( GI / G / 1\) lakatos-type queueing system with \(T\)-retrials

This page was built for publication: A comparison of a classical retrial \(M/G/1\) queueing system and a Lakatos-type \(M/G/1\) cyclic-waiting time queueing system

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