Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T09:10:07.306Z Has data issue: false hasContentIssue false

Entropy maximization and the busy period of some single-server vacation models

Published online by Cambridge University Press:  15 September 2004

Jesus R. Artalejo
Affiliation:
Department of Statistics and Operations Research, Faculty of Mathematics, Complutense University of Madrid, Madrid 28040, Spain; jesus_artalejo@mat.ucm.es.
Maria J. Lopez-Herrero
Affiliation:
School of Statistics, Complutense University of Madrid, Madrid 28040, Spain; lherrero@estad.ucm.es.
Get access

Abstract

In this paper, information theoretic methodology forsystem modeling is applied to investigate the probability density functionof the busy period in M/G/1 vacation models operating under the N-, T- andD-policies. The information about the density function is limited to a fewmean value constraints (usually the first moments). By using the maximumentropy methodology one obtains the least biased probability densityfunction satisfying the system's constraints. The analysis of the threecontrollable M/G/1 queueing models provides a parallel numerical study ofthe solution obtained via the maximum entropy approach versus “classical”solutions. The maximum entropy analysis of a continuous system descriptor(like the busy period) enriches the current body of literature which, inmost cases, reduces to discrete queueing measures (such as the number ofcustomers in the system).

Information

Type
Research Article
Copyright
© EDP Sciences, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable