Information theoretic analysis for queueing systems with quasi-random input



Downloads per month over past year

Artalejo, Jesús R. and Gómez-Corral, Antonio (1995) Information theoretic analysis for queueing systems with quasi-random input. Mathematical and Computer Modelling, 22 (3). pp. 65-76. ISSN 0895-7177

[thumbnail of corral38.pdf] PDF
Restringido a Repository staff only


Official URL:


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.

Item Type:Article
Uncontrolled Keywords:Maximum entropy estimation; Quasi-random input; Queueing theory; Repeated attempts; Stable recursion algorithms
Subjects:Sciences > Mathematics > Stochastic processes
ID Code:15893
Deposited On:10 Jul 2012 11:40
Last Modified:06 Aug 2018 08:33

Origin of downloads

Repository Staff Only: item control page