2026-06-08T01:05:59Zhttps://docta.ucm.es/rest/oai/requestoai:docta.ucm.es:20.500.14352/574082024-03-11T14:45:30Zcom_20.500.14352_14col_20.500.14352_15
Docta Complutense
author
Artalejo Rodríguez, Jesús Manuel
author
Anisimov, Vladimir V.
2023-06-20T16:54:49Z
2023-06-20T16:54:49Z
2001-06-11
0257-0130
10.1023/A:1012796517394
https://hdl.handle.net/20.500.14352/57408
http://www.springerlink.com/content/m4250164066w9w25/
http://www.springerlink.com/
Negative arrivals are used as a control mechanism in many telecommunication and computer networks. In the paper we analyze multiserver retrial queues; i.e., any customer finding all servers busy upon arrival must leave the service area and re-apply for service after some random time. The control mechanism is such that, whenever the service facility is full occupied, an exponential timer is activated. If the timer expires and the service facility remains full, then a random batch of customers, which are stored at the retrial pool, are automatically removed. This model extends the existing literature, which only deals
with a single server case and individual removals. Two different approaches are considered. For the stable case, the matrix–analytic formalism is used to study the joint distribution of the service facility and the retrial pool. The approximation by more simple infinite retrial model is also proved. In the overloading case we study the transient behaviour of the trajectory of the suitably normalized retrial queue and the long-run behaviour of the number of busy servers. The method of investigation in this case is based on the averaging principle for switching processes.
eng
Analysis of Markov multiserver retrial queues with negative arrivals
journal article
URL
https://docta.ucm.es/bitstreams/f901e3fb-f462-4bcc-be11-b9086a551942/download
File
MD5
ab6f09533ffb4589c9fc74e22ac37bb3
191962
application/pdf
arta50.pdf