2026-06-29T15:08:41Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/574292024-03-11T14:59:14Zcom_20.500.14352_14col_20.500.14352_15

Information theoretic analysis for queueing systems with quasi-random input Artalejo Rodríguez, Jesús Manuel Gómez-Corral, Antonio 519.216 Maximum entropy estimation Quasi-random input Queueing theory Repeated attempts Stable recursion algorithms Procesos estocásticos 1208.08 Procesos Estocásticos In this paper, information theoretic inference methodology for system modeling is applied to estimate the stationary distribution for the number of customers in single server queueing systems with service capacity utilized by a finite population. The customers demand i.i.d. service times. Three different models are considered. In Model I, a customer who finds the server busy can be queued, whereas in Models II and III, any customer finding the server busy upon arrival will make repeated attempts to enter service until he eventually finds the server free. Models II and III differ in the retrial policy. Numerical examples illustrate the accuracy of the proposed maximum entropy estimation when it is compared with the classical analysis. Universidad Complutense de Madrid Depto. de Estadística e Investigación Operativa Fac. de Ciencias Matemáticas TRUE pub 2023-06-20T16:55:18Z 2023-06-20T16:55:18Z 1995 journal article https://hdl.handle.net/20.500.14352/57429 0895-7177 10.1016/0895-7177(95)00120-Q eng PR161/93-4777. restricted access application/pdf Pergamon-Elsevier Science LTD