Artalejo Rodríguez, Jesús ManuelAnisimov, Vladimir V.2023-06-202023-06-202001-06-110257-013010.1023/A:1012796517394https://hdl.handle.net/20.500.14352/57408This research was supported in part by DGES98-0837 and the European Commission through INTAS Project 96-0828Negative 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.engjournal articlehttp://www.springerlink.com/content/m4250164066w9w25/http://www.springerlink.com/restricted access519.8Retrial queueing systemsNegative arrivalsAveraging principleMatrix–analytic methodsSwitching processInvestigación operativa (Matemáticas)1207 Investigación Operativa