Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-25T00:13:15.963Z 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 in the modeling of computer and telecommunication systems. In addition, we consider in this paper the possibility of disasters. When a disaster occurs, all the customers present in the system are destroyed immediately. Using a regenerative approach, we derive a numerically stable recursion scheme for the state probabilities. This model can be employed to analyze the behaviour of a buffer in computers with virus infections.

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.)