A retrial queue with redundancy and unreliable server

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1994 English Publisher:Springer Science and Business Media LLCJournal:Queueing Systems, volume 17, pages 431-449 (issn: 0257-0130, eissn: 1572-9443,

Copyright policy )

Authors: Amar Aissani;

doi: 10.1007/bf01158703

A retrial queue with redundancy and unreliable server

- Summary
- Subjects
- Metrics

Abstract

This paper introduces a new version of the unreliable \(M/G/1/1\) retrial queue and obtains, amongst other things, using the theory of piecewise Markovian processes, the analogue of the Pollaczek-Khinchin formula for such a queue.

Related Organizations

University of Blida
Algeria

Keywords

Reliability, availability, maintenance, inspection in operations research, Markov and semi-Markov decision processes, Pollaczek-Khinchin formula, retrial queue, Queues and service in operations research, Queueing theory (aspects of probability theory)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	38
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average