A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“including its denseness in the space of nonnegative distributions”
From Efficient duration and hierarchical modeling for human activity recognition (2009) · cites this paper as [32]
In the citing paper
“The 2-phase Coxian is chosen to represent the abnormal data, not only because it involves least computation, but it is known to have a high variance [32] suiting the variable characteristics of abnormality.”
From Efficient duration and hierarchical modeling for human activity recognition (2009) · cites this paper as [32]
Citations
Cites
Matrix-Geometric Solutions in Stochastic Models. An Algorithmic Approach.
Heyde, C. C., & Neuts, M. F. (1982) · Journal of the American Statistical Association · doi:10.2307/2287748 · Cited by 3,248 · cited 1×
“Observe that PH distributions h ave (n2) free parameters, see Figure 1 [14], while S can be defined to have far fewer free parameters.”
BackgroundTchebycheff Systems: With Applications in Analysis and Statistics
Kappos, D. A., Karlin, S., & Studden, W. J. (1967) · Revue de l Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1401807 · Cited by 1,239
Tchebycheff Systems: With Applications in Analysis and Statistics.
Igwe, N. O., Karlin, S., & Studden, W. J. (1967) · Journal of the American Statistical Association · doi:10.2307/2283712 · Cited by 638 · cited 1×
“Since any nonnegative distribution G satisfiesmG3 mG2 1 [11], almost all the nonnegative distributions are in PH.”
BackgroundApproximating a Point Process by a Renewal Process, I: Two Basic Methods
Whitt, W. (1982) · Operations Research · doi:10.1287/opre.30.1.125 · Cited by 539 · cited 1×
“Whitt [26] and Altiok [2] focus on the set of distributions with C2 > 1 and suÆciently high third moment.”
BackgroundFitting mixtures of exponentials to long-tail distributions to analyze network performance models
Feldmann, A., & Whitt, W. (1998) · Performance Evaluation · doi:10.1016/s0166-5316(97)00003-5 · Cited by 484
The least variable phase type distribution is erlang
David, A., & Larry, S. (1987) · Communications in Statistics. Stochastic Models · doi:10.1080/15326348708807067 · Cited by 185 · cited 1×
“By contrast, an n-phase Erlang distribution has only two free parameters and is also known to have the least normalized second moment among all the n-phase PH distributions [1].”
BackgroundMatching moments to phase distributions: Mixtures of erlang distributions of common order
Johnson, M. A., & Taaffe, M. R. (1989) · Stochastic Models · doi:10.1080/15326348908807131 · Cited by 168 · cited 2×
“Johnson and Taaffe [ 8 , 7] come closest to achieving all four measures.”
BackgroundOn the Phase-Type Approximations of General Distributions
Altiok, T. M. (1985) · IIE Transactions · doi:10.1080/07408178508975280 · Cited by 154 · cited 4×
“T. Altiok.”
BackgroundInfluentialPhFit: A General Phase-Type Fitting Tool
Horváth, A., & Telek, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46029-2_5 · Cited by 149
Fitting world-wide web request traces with the EM-algorithm
Khayari, R. E. A., Sadre, R., & Haverkort, B. R. H. M. (2003) · Performance Evaluation · doi:10.1016/s0166-5316(02)00179-7 · Cited by 127
An integrated approach to parallel scheduling using gang-scheduling, backfilling, and migration
Zhang, Y., Franke, H., Moreira, J. E., & Sivasubramaniam, A. (2003) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2003.1189582 · Cited by 123 · cited 1×
“We choose to limit our discussion in this paper to three-moment matching, because matching the rst three moments of an input distribution has been shown to be e ective in predicting mean performance for variety of many computer system models [4, 5, 19, 23, 27].”
MethodCalculating equilibrium probabilities for λ(n)/C k /1/N queues
Marie, R. A. (1980) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1009375.806155 · Cited by 115 · cited 1×
“Marie [15] provides a closed-form solution for matching two moments of a general distribution in PH3.”
BackgroundPhFit: a general phase-type fitting tool
Bobbio, A., Horváth, A., & Telek, M. (2003) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2002.1028966 · Cited by 111
Advances in Matrix-Analytic Methods for Stochastic Models
Chakravarthy, S., & Alfa, A. S. (1998) · Medical Entomology and Zoology · Cited by 96
Approximate Analysis of Central Server Models
Sauer, C. H., & Chandy, K. M. (1975) · IBM Journal of Research and Development · doi:10.1147/rd.193.0301 · Cited by 91 · cited 1×
“Sauer and Chand y [17] provide a closed-form solution for matching two moments of a general distribution in PH.”
BackgroundOn Approximations for Queues, III: Mixtures of Exponential Distributions
Whitt, W. (1984) · AT&T Bell Laboratories Technical Journal · doi:10.1002/j.1538-7305.1984.tb00007.x · Cited by 81 · cited 1×
“The class of EC dis-tributions has very few free parameters, which narrows down the searchspace, making the algorithm eÆcient { In fact we provide a closed-formsolution for the parameters of the EC distribution.”
BackgroundMatching moments to phase distributions: nonlinear programming approaches
Johnson, M. A., & Taaffe, M. R. (1990) · Stochastic Models · doi:10.1080/15326349908807147 · Cited by 71 · cited 3×
“The current approach involves simply iterating over all choices for n [12], whereas our characterization would immediately specify n.”
MethodTransient analysis of stochastic fluid models
Séricola, B. (1998) · Performance Evaluation · doi:10.1016/s0166-5316(98)00004-2 · Cited by 69
Matching moments to phase distributions: density function shapes
Johnson, M. A., & Taaffe, M. R. (1990) · Stochastic Models · doi:10.1080/15326349908807148 · Cited by 65 · cited 1×
“In complementary work, Johnson and Taaffe [11,12] again look at the problem of matching the first three moments of any distribution G ∈ PH3, this time using three types of PH distributions: a mixture of Erlang distributions, a Coxian PH distribution, and a general PH distribution.”
MethodJohnson, M. A. (1993) · INFORMS journal on computing · doi:10.1287/ijoc.5.1.69 · Cited by 64 · cited 2×
“Equations (9) and (10) an be easily veri ed by substitution into (7) and (8), respe tively.”
BackgroundAn investigation of phase-distribution moment-matching algorithms for use in queueing models
Johnson, M. A., & Taaffe, M. R. (1991) · Queueing Systems · doi:10.1007/bf02412246 · Cited by 62 · cited 2×
“Equations (9) and (10) an be easily veri ed by substitution into (7) and (8), respe tively.”
BackgroundAn evaluation of parallel job scheduling for ASCI Blue-Pacific
Franke, H., Jann, J., Moreira, J. E., Pattnaik, P., & Jette, M. A. (1999) · ACM/IEEE Conference on Supercomputing (SC) · doi:10.1145/331532.331577 · Cited by 56 · cited 1×
“We choose to limit our discussion in this paper to three-moment matching, because matching the rst three moments of an input distribution has been shown to be e ective in predicting mean performance for variety of many computer system models [4, 5, 19, 23, 27].”
MethodMeda: mixed erlang distributions as phase-type representations of empirical distribution functions.
Schmickler, L. (1992) · Stochastic Models · doi:10.1080/15326349208807217 · Cited by 54
Efficient fitting of long-tailed data sets into hyperexponential distributions
Riska, A., Diev, V., & Evgenia Smirni, A. (2003) · Globecom · doi:10.1109/glocom.2002.1189083 · Cited by 47
Modeling and analysis of power-tail distributions via classical teletraffic methods
Starobinski, D., & Sidi, M. (2000) · Queueing Systems · doi:10.1023/a:1019195522806 · Cited by 44 · cited 1×
“tailed distributions to hyperexponential distributions, see for example the work of [3, 19 , 12].”
MethodAnalysis of task assignment with cycle stealing under central queue
Harchol‐Balter, M., Li, C., Osogami, T., Scheller-Wolf, A. A., & Squillante, M. S. (2004) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2003.1203514 · Cited by 37 · cited 1×
“Observe that mZ2 is minimized when y = mX2 1, namely, Y1 = (mX2 1) X1 : (4) Observe that when equation (4) is satis ed, the normalized se ond moment of Z satis es: mZ2 = 2 1 mX2 ; (5) and the normalized third moment of Z satis es: mZ3 = 1 mX2 (2mX2 1)mX3 + 3(mX2 1) mX2 : (6) We next hara terize Zl = l(X) = Yl l 1(X) f…”
BackgroundSelf-citationNecessary and Sufficient Conditions for Representing General Distributions by Coxians
Osogami, T., & Harchol‐Balter, M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45232-4_12 · Cited by 31 · cited 5×
“The parameters ( X1, X2, pX) of the two-phase Coxian distribution are chosen as follows [20, 15]: X1 = u+pu2 4v 2E[G℄ ; X2 = u pu2 4v 2E[G℄ ; and pX = X2E[G℄( X1E[G℄ 1) X1E[G℄ ;”
BackgroundInfluentialSelf-citationAnalysis of cycle stealing with switching cost
Osogami, T., Harchol‐Balter, M., & Scheller-Wolf, A. A. (2003) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/781027.781050 · Cited by 25 · cited 1×
“Matching three moments is desirable because it has been found to lead to sufficient ac cur y in modeling many computer systems [4, 16].”
BackgroundSelf-citationEfficient fitting of long-tailed data sets into phase-type distributions
Riska, A., Diev, V., & Smirni, E. (2002) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/605521.605525 · Cited by 21
A graphical investigation of error bounds for moment-based queueing approximations
Johnson, M. A., & Taaffe, M. R. (1991) · Queueing Systems · doi:10.1007/bf02412257 · Cited by 18 · cited 1×
“Matching only two moments often does not suffice sinc e the performance of some queueing models has been shown to be heavily dependent on the third mom ent of distributions in the model [22, 6].”
Research works printed but not linked: 2
- Horváth, A., Telek, M.: Approximating heavy tailed behavior with phase type distributions. In: Advances in Matrix-Analytic Methods for Stochastic Models, pp. 191–214. Notable Publications (July 2000)
- Telek, M., Heindl, A.: Matching moments for acyclic discrete and continuous phase-type distributions of second order. International Journal of Simulation 3, 47–57 (2003)
Cited by
Fine-Grained Activity Recognition by Aggregating Abstract Object Usage
Patterson, D. J., Fox, D., Kautz, H., & Philipose, M. (2005) · Ninth IEEE International Symposium on Wearable Computers (ISWC'05) · doi:10.1109/iswc.2005.22 · Cited by 452
“We chose these techniques because they are robust to sensor noise, they have well-understood algorithms for inference and parameter learning [16] and they have wellcharacterized temporal properties [14].”
MethodVerification and planning for stochastic processes with asynchronous events
Younes, H. L. S., & Simmons, R. G. (2004) · Cited by 171
Matching Three Moments with Minimal Acyclic Phase Type Distributions
Bobbio, A., Horváth, A., & Telek, M. (2005) · Stochastic Models · doi:10.1081/stm-200056210 · Cited by 161
“The methods presented in Osogami[8,9], which papers consider only APHM(n) distributions, make use of the transformation described in Corollary 4.”
BackgroundMethodResultInfluentialClosed form solutions for mapping general distributions to quasi-minimal PH distributions
Osogami, T., & Harchol‐Balter, M. (2005) · Performance Evaluation · doi:10.1016/j.peva.2005.06.002 · Cited by 140
“Unfortunately, many interesting results in [18,19] are omitted in this paper due to space constraints.”
BackgroundMethodResultSelf-citationEfficient duration and hierarchical modeling for human activity recognition
Duong, T., Phung, D., Bui, H., & Venkatesh, S. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2008.12.005 · Cited by 115
“This type of parameterization yields an elegant solution: it has a closed-form re-estimation solution; the number of free parameters is adequately low, scaling linearly with the number of phases K , where K is typically much smaller than the maximum duration M in practice; and it is theoretically flexible enough in ap…”
Background
Metadata
- Authors
- Osogami, T., & Harchol-Balter, M.
- Affiliations
- Carnegie Mellon University (US)
- ORCID
- Osogami, Takayuki
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 200-217
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2713421705
- Cited by
- 55
- References
- 30
- Citations by year
- 2026: 1 · 2022: 2 · 2020: 2 · 2018: 7 · 2017: 2 · 2016: 1 · 2015: 1 · 2014: 4 · 2013: 1 · 2012: 2
- FWCI
- 10.02
- Type
- conference paper
- Language
- en
- Open access
- green
- doi.org
- Locations
- Lecture notes in computer science (publishedVersion)
- KiltHub Repository (submittedVersion)
- KiltHub Repository
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Queuing Theory Analysis
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Social Sciences › Decision Sciences › Management Science and Operations Research › Probability and Risk Models
- Keywords
- phase-type distributions, distribution matching, moment matching, analytical solution, Markov approximation, queueing analysis, numerical stability
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.