Issue |
RAIRO-Oper. Res.
Volume 33, Number 3, July-September 1999
|
|
---|---|---|
Page(s) | 371 - 382 | |
DOI | https://doi.org/10.1051/ro:1999116 | |
Published online | 15 August 2002 |
Computation of the limiting distribution in queueing systems with repeated attempts and disasters
Faculty of Mathematics, Department of
Statistics and O.R., University Complutense of Madrid, Madrid 28040, Spain.
Received:
July
1997
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.
Résumé
Les files d'attente avec tentatives repetées sont utiles dans la modélisation des ordinateurs et des systèmes de télécommunication. En outre, nous considérons dans cet article la possibilité de désastres. Quand un désastre survient, tous les clients présents dans le système sont immédiatement detruits. En utilisant une méthode regénerative, nous établissons un schema de recursion stable pour les probabilités d'état. Ce modèle peut être utilisé pour analyser le comportement d'un buffer dans des ordinateurs infectés par des virus.
Key words: Disasters / G-networks / queueing theory / repeated attempts.
© EDP Sciences, 1999
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.