Computation of the limiting distribution in queueing systems with repeated attempts and disasters
Single server queues with repeated attempts are useful in the modeling of computer and telecommunication systems. In addition, we consider iii this paper the possibility of disasters. When a disaster occurs, all the customers present in the sq stein are destroyed immediately. Using a regenerative ap...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 1999 |
| País: | España |
| Institución: | Universidad Complutense de Madrid (UCM) |
| Repositorio: | Docta Complutense |
| Idioma: | inglés |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/57426 |
| Acceso en línea: | https://hdl.handle.net/20.500.14352/57426 |
| Access Level: | acceso abierto |
| Palabra clave: | 519.8 Disasters G-networks queueing theory repeated attempts Investigación operativa (Matemáticas) 1207 Investigación Operativa |
| Sumario: | Single server queues with repeated attempts are useful in the modeling of computer and telecommunication systems. In addition, we consider iii this paper the possibility of disasters. When a disaster occurs, all the customers present in the sq stein are destroyed immediately. Using a regenerative approach, we derive a numerically stable recursion scheme for the stare probabilities. This model can be employed to analyze the behaviour of a buffer in computers with virus infections. |
|---|