Analysis of the finite source retrial queues with server breakdowns and repairs

Abstract

This paper is concerned with the queueing analysis as well as reliability evaluation of an $M/G/1//K$ retrial queue with a finite number of sources in which the server is subject to breakdowns and repairs. The server has a exponentially distributed life time and a generally distributed repair time. Our analysis extends previous work on this topic and includes the analysis of the arriving customer's distribution, the busy period, the waiting time process and main reliability characteristics. This queueing system and its variants could be used to model magnetic disk memory systems, star-like local area networks and other communication systems with detected or undetected breakdowns.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 45 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.