<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-29T07:22:58Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/33603" metadataPrefix="oai_dc">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/33603</identifier><datestamp>2023-07-14T03:30:19Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_15</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Maximum queue lengths during a fixed time interval in the M/M/c retrial queue</dc:title>
   <dc:creator>Gómez-Corral, Antonio</dc:creator>
   <dc:creator>López-García, M.</dc:creator>
   <dc:subject>519.2</dc:subject>
   <dc:subject>Absorbing Markov chain</dc:subject>
   <dc:subject>Eigenvalues/eigenvectors</dc:subject>
   <dc:subject>Maximum queue length</dc:subject>
   <dc:subject>Retrial queue</dc:subject>
   <dc:subject>Splitting method</dc:subject>
   <dc:subject>Estadística matemática (Matemáticas)</dc:subject>
   <dc:subject>1209 Estadística</dc:subject>
   <dc:description>We are concerned with the problem of characterizing the distribution of the maximum number Z(t(0)) of customers during a fixed time interval [0, t(0)] in the M/M/c retrial queue, which is shown to have a matrix exponential form. We present a simple condition on the service and retrial rates for the matrix exponential solution to be explicit or algorithmically tractable. Our methodology is based on splitting methods and the use of eigen-values and eigenvectors. A particularly appealing feature of our solution is that it allows us to obtain global error control. Specifically, we derive an approximating solution p(x; t(0)) = p(x; t(0); epsilon) verifying [P(Z(t(0)) &lt;= x vertical bar X(0) = (i,j)) - p(x; t(0))] &lt; epsilon uniformly in x >= i + j, for any epsilon > 0 and initial numbers i of busy servers and j of customers in orbit.</dc:description>
   <dc:description>Government of Spain (Ministry of Economy and Competitiveness)</dc:description>
   <dc:description>European Commission</dc:description>
   <dc:description>Depto. de Estadística e Investigación Operativa</dc:description>
   <dc:description>Fac. de Ciencias Matemáticas</dc:description>
   <dc:description>TRUE</dc:description>
   <dc:description>pub</dc:description>
   <dc:date>2023-06-19T13:24:53Z</dc:date>
   <dc:date>2023-06-19T13:24:53Z</dc:date>
   <dc:date>2014</dc:date>
   <dc:type>journal article</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/33603</dc:identifier>
   <dc:identifier>0096-3003</dc:identifier>
   <dc:identifier>10.1016/j.amc.2014.02.074</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>MTM-2011-23864</dc:relation>
   <dc:relation>BES-2009-018747</dc:relation>
   <dc:rights>restricted access</dc:rights>
   <dc:format>application/pdf</dc:format>
   <dc:publisher>Elsevier</dc:publisher>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>