Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-26T07:46:19.024Z Has data issue: false hasContentIssue false
  • English
  • Français

Fitting Discrete Distributions on the First Two Moments

Published online by Cambridge University Press:  27 July 2009

Ivo Adan ,
Michel van Eenige  and
Jacques Resing
Ivo Adan
Affiliation:
Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB – Eindhoven, The Netherlands
Michel van Eenige
Affiliation:
Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB – Eindhoven, The Netherlands
Jacques Resing
Affiliation:
Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB – Eindhoven, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we present a simple method to fit a discrete distribution on the first two moments of a given random variable. With the Fitted distribution we solve approximately Lindley's equation for the D/G/1 queue with discrete service-time distribution using a moment-iteration method. Numerical results show excellent performance of the method.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 9 , Issue 4 , October 1995 , pp. 623 - 632
Copyright
Copyright © Cambridge University Press 1995

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

1.Adan, I. & Zhao, Y. (1994). Analyzing GI | E r | I queues. Memorandum COSOR 94–37, Eindhoven University of Technology, Department of Mathematics and Computing Science.Google Scholar
2.Darroch, J.N. (1964). On the traffic-light queue. Annals of Mathematical Statistics 35: 380–388.Google Scholar
3.de Kok, A.G. (1989). A moment-iteration method for approximating the waiting-time characteristics of the GI/G/1 queue. Probability in the Engineering and Informational Sciences 3: 273–287.Google Scholar
4.Fredericks, A.A. (1982). A class of approximations for the waiting time distribution in a GI/G/1 queueing system. Bell System Technical Journal 61: 295–325.Google Scholar
5.Neuts, M.F. (1981). Matrix-geometric solutions in stochastic models. Baltimore, MD: Johns Hopkins University Press.Google Scholar
6.Newell, G.F. (1960). Queues for a fixed-cycle traffic light. Annals of Mathematical Statistics 31: 589–597.CrossRefGoogle Scholar
7.Ord, J.K. (1967). On a system of discrete distributions. Biometrika 54: 649–656.Google ScholarPubMed
8.Tijms, H.C. (1986). Stochastic modelling and analysis: A computational approach. Chichester: John Wiley & Sons.Google Scholar
9.Tijms, H.C. & van de Coevering, M.C.T. (1991). A simple numerical approach for infinite-state Markov chains. Probability in the Engineering and Informational Sciences 5: 285–295.CrossRefGoogle Scholar
10.van Eenige, M.J.A., Resing, J.A.C., & van der Wal, J. (1993). A matrix-geometric analysis of queueing systems with periodic service interruptions. Memorandum COSOR 93–32, Eindhoven University of Technology, Department of Mathematics and Computing Science.Google Scholar