Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-11T01:51:19.018Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  15 September 2004

Jesus R. Artalejo  and
Maria J. Lopez-Herrero
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).

Keywords

Busy period analysismaximum entropy methodologyM/G/1vacation modelsnumerical inversion.
Type
Research Article
Information
RAIRO - Operations Research , Volume 38 , Issue 3 , July 2004 , pp. 195 - 213
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.)

References

Abate, J. and Whitt, W., Numerical inversion of Laplace transforms of probability distributions. ORSA J. Comput. 7 (1995) 36–43. CrossRef
Artalejo, J.R., G-networks: A versatile approach for work removal in queueing networks. Eur. J. Oper. Res. 126 (2000) 233–249. CrossRef
Artalejo, J.R., On the M/G/1 queue with D-policy. Appl. Math. Modelling 25 (2001) 1055–1069. CrossRef
Balachandran, K.R. and Tijms, H., On the D-policy for the M/G/1 queue. Manage. Sci. 21 (1975) 1073–1076. CrossRef
B.D. Bunday, Basic Optimization Methods. Edward Arnold, London (1984).
Doshi, B.T., Queueing systems with vacations - A survey. Queue. Syst. 1 (1986) 29–66. CrossRef
El-Affendi, M.A. and Kouvatsos, D.D., A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems at equilibrium. Acta Inform. 19 (1983) 339–355. CrossRef
Falin, G.I., Martin, M. and Artalejo, J.R., Information theoretic approximations for the M/G/1 retrial queue. Acta Inform. 31 (1994) 559–571. CrossRef
Gakis, K.G., Rhee, H.K. and Sivazlian, B.D., Distributions and first moments of the busy period and idle periods in controllable M/G/1 queueing models with simple and dyadic policies. Stoch. Anal. Appl. 13 (1995) 47–81. CrossRef
Gelenbe, E., Product-form queueing networks with negative and positive customers. J. Appl. Prob. 28 (1991) 656–663. CrossRef
Gelenbe, E., G-networks: A unifying model for neural and queueing networks. Ann. Oper. Res. 48 (1994) 433–461. CrossRef
E. Gelenbe and R. Iasnogorodski, A queue with server of walking type (autonomous service). Annales de l'Institut Henry Poincaré, Series B 16 (1980) 63–73.
Guiasu, S., Maximum entropy condition in queueing theory. J. Opl. Res. Soc. 37 (1986) 293–301. CrossRef
Heyman, D., The T-policy for the M/G/1 queue. Manage. Sci. 23 (1977) 775–778. CrossRef
L. Kleinrock, Queueing Systems, Volume 1: Theory. John Wiley & Sons, Inc., New York (1975).
Kouvatsos, D.D., Entropy maximisation and queueing networks models. Ann. Oper. Res. 48 (1994) 63–126. CrossRef
Levy, Y. and Yechiali, U., Utilization of idle time in an M/G/1 queueing system. Manage. Sci. 22 (1975) 202–211. CrossRef
Nelder, J.A. and Mead, R., A simplex method for function minimization. Comput. J. 7 (1964) 308–313. CrossRef
W.H. Press, S.A. Teukolsky, W.T. Vetterling and B.P. Flannery, Numerical Recipes in Fortran, The Art of Scientific Computing. Cambridge University Press (1992).
Shore, J.E., Information theoretic approximations for M/G/1 and G/G/1 queuing systems. Acta Inform. 17 (1982) 43–61. CrossRef
Tadj, L. and Hamdi, A., Maximum entropy solution to a quorum queueing system. Math. Comput. Modelling 34 (2001) 19–27. CrossRef
H. Takagi, Queueing Analysis. Vol. 1–3, North-Holland, Amsterdam (1991).
Teghem Jr, J.., Control of the service process in a queueing system. Eur. J. Oper. Res. 23 (1986) 141–158. CrossRef
Wagner, U. and Geyer, A.L.J., A maximum entropy method for inverting Laplace transforms of probability density functions. Biometrika 82 (1995) 887–892. CrossRef
Wang, K.H., Chuang, S.L. and Pearn, W.L., Maximum entropy analysis to the N policy M/G/1 queueing systems with a removable server. Appl. Math. Modelling 26 (2002) 1151–1162. CrossRef
Yadin, M. and Naor, P., Queueing systems with a removable server station. Oper. Res. Quar. 14 (1963) 393–405. CrossRef