Artalejo, J. R., and Gómez-Corral, A.. "Computation of the limiting distribution in queueing systems with repeated attempts and disasters ." RAIRO - Operations Research 33.3 (2010): 371-382. <http://eudml.org/doc/197840>.
@article{Artalejo2010,
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.
},
author = {Artalejo, J. R., Gómez-Corral, A.},
journal = {RAIRO - Operations Research},
keywords = {Disasters; G-networks; queueing theory; repeated attempts. ; -networks; single server queues; repeated attempts; disasters; stable recursion scheme; state probabilities},
language = {eng},
month = {3},
number = {3},
pages = {371-382},
publisher = {EDP Sciences},
title = {Computation of the limiting distribution in queueing systems with repeated attempts and disasters },
url = {http://eudml.org/doc/197840},
volume = {33},
year = {2010},
}
TY - JOUR
AU - Artalejo, J. R.
AU - Gómez-Corral, A.
TI - Computation of the limiting distribution in queueing systems with repeated attempts and disasters
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 33
IS - 3
SP - 371
EP - 382
AB -
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.
LA - eng
KW - Disasters; G-networks; queueing theory; repeated attempts. ; -networks; single server queues; repeated attempts; disasters; stable recursion scheme; state probabilities
UR - http://eudml.org/doc/197840
ER -
