Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-26T23:56:33.044Z Has data issue: false hasContentIssue false
  • English
  • Français

Computation of the limiting distribution in queueing systems withrepeated attempts and disasters

Published online by Cambridge University Press:  15 August 2002

J. R. Artalejo  and
A. Gómez-Corral
J. R. Artalejo
Affiliation:
Faculty of Mathematics, Department of Statistics and O.R., University Complutense of Madrid, Madrid 28040, Spain.
A. Gómez-Corral
Affiliation:
Faculty of Mathematics, Department of Statistics and O.R., University Complutense of Madrid, Madrid 28040, Spain.
Get access

Abstract

Single server queues with repeated attempts are useful inthe modeling of computer and telecommunication systems. In addition, weconsider in this paper the possibility of disasters. When a disasteroccurs, all the customers present in the system are destroyedimmediately. Using a regenerative approach, we derive a numericallystable recursion scheme for the state probabilities. This model can beemployed to analyze the behaviour of a buffer in computers with virusinfections.

Keywords

DisastersG-networksqueueing theoryrepeated attempts.
Type
Research Article
Information
RAIRO - Operations Research , Volume 33 , Issue 3 , July 1999 , pp. 371 - 382
Copyright
© EDP Sciences, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)