Distribution of Processor-Sharing Customers for a Large Closed System with Multiple Classes

A closed processor-sharing (PS) system with multiple customer classes is considered. The system consists of one infinite server (IS) station and one PS station. For a system with a large number of customers, a saturated PS station, and an arbitrary number of customer classes, asymptotic approximatio...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:SIAM Journal on Applied Mathematics. - Society for Industrial and Applied Mathematics, 1966. - 60(2000), 4, Seite 1330-1339
1. Verfasser: Berger, Arthur (VerfasserIn)
Weitere Verfasser: Kogan, Yaakov
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2000
Zugriff auf das übergeordnete Werk:SIAM Journal on Applied Mathematics
Schlagworte:Heavy traffic approximation Queueing theory S0036139998346063 Mathematics Applied sciences Behavioral sciences
LEADER 01000caa a22002652 4500
001 JST081554621
003 DE-627
005 20240623143047.0
007 cr uuu---uuuuu
008 150325s2000 xx |||||o 00| ||eng c
035 |a (DE-627)JST081554621 
035 |a (JST)118553 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
084 |a 60K30, 34E20  |2 MSC 
100 1 |a Berger, Arthur  |e verfasserin  |4 aut 
245 1 0 |a Distribution of Processor-Sharing Customers for a Large Closed System with Multiple Classes 
264 1 |c 2000 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
520 |a A closed processor-sharing (PS) system with multiple customer classes is considered. The system consists of one infinite server (IS) station and one PS station. For a system with a large number of customers, a saturated PS station, and an arbitrary number of customer classes, asymptotic approximations to the stationary distribution of the total number of customers at the PS station are derived. The asymptotics for the probability mass function is described by a quasipotential function, which defines the exponential decay for the distribution, and a state-dependent preexponential factor. Both functions have an explicit expression in terms of the solution at each point x of a polynomial equation whose order equals the number of classes and whose coefficients are explicit functions of x. The quasi-potential function at its minimum point provides the logarithmic asymptotics for the normalization constant, and the asymptotic approximation for the variance is inversely proportional to the second derivative of the quasi-potential function at its minimum point. The complementary probability distribution is computed using the normal approximation and its refinements, which do not require repeated solution of polynomial equations. Numerical results demonstrate the range of applicability of the approximations. The results can be applied to the problem of dimensioning bandwidth and of admission control for different data sources in packet-switched communication networks. 
540 |a Copyright 2000 Society for Industrial and Applied Mathematics 
650 4 |a Heavy traffic approximation 
650 4 |a Queueing theory 
650 4 |a S0036139998346063 
650 4 |a Mathematics  |x Mathematical procedures  |x Approximation 
650 4 |a Applied sciences  |x Systems science  |x Closed systems 
650 4 |a Mathematics  |x Applied mathematics  |x Statistics  |x Applied statistics  |x Descriptive statistics  |x Statistical distributions  |x Distribution functions  |x Probability distributions 
650 4 |a Mathematics  |x Applied mathematics  |x Statistics  |x Applied statistics  |x Descriptive statistics  |x Statistical distributions  |x Distribution functions  |x Probability distributions  |x Discrete probability distributions  |x Probability mass distributions 
650 4 |a Mathematics  |x Mathematical expressions 
650 4 |a Mathematics  |x Pure mathematics  |x Algebra  |x Polynomials 
650 4 |a Behavioral sciences  |x Psychology  |x Cognitive psychology  |x Decision theory  |x Operations research  |x Queuing theory  |x Queueing networks 
650 4 |a Mathematics  |x Mathematical expressions  |x Mathematical functions  |x Hypergeometric functions  |x Generating function 
650 4 |a Mathematics 
650 4 |a Applied sciences  |x Computer science  |x Computer engineering  |x Computer networking  |x Network servers 
655 4 |a research-article 
700 1 |a Kogan, Yaakov  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t SIAM Journal on Applied Mathematics  |d Society for Industrial and Applied Mathematics, 1966  |g 60(2000), 4, Seite 1330-1339  |w (DE-627)266884121  |w (DE-600)1468266-7  |x 00361399  |7 nnns 
773 1 8 |g volume:60  |g year:2000  |g number:4  |g pages:1330-1339 
856 4 0 |u https://www.jstor.org/stable/118553  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_JST 
912 |a GBV_ILN_11 
912 |a GBV_ILN_20 
912 |a GBV_ILN_22 
912 |a GBV_ILN_23 
912 |a GBV_ILN_24 
912 |a GBV_ILN_31 
912 |a GBV_ILN_39 
912 |a GBV_ILN_40 
912 |a GBV_ILN_60 
912 |a GBV_ILN_62 
912 |a GBV_ILN_63 
912 |a GBV_ILN_69 
912 |a GBV_ILN_70 
912 |a GBV_ILN_90 
912 |a GBV_ILN_100 
912 |a GBV_ILN_105 
912 |a GBV_ILN_110 
912 |a GBV_ILN_120 
912 |a GBV_ILN_206 
912 |a GBV_ILN_285 
912 |a GBV_ILN_374 
912 |a GBV_ILN_702 
912 |a GBV_ILN_2001 
912 |a GBV_ILN_2003 
912 |a GBV_ILN_2005 
912 |a GBV_ILN_2006 
912 |a GBV_ILN_2007 
912 |a GBV_ILN_2008 
912 |a GBV_ILN_2009 
912 |a GBV_ILN_2010 
912 |a GBV_ILN_2011 
912 |a GBV_ILN_2014 
912 |a GBV_ILN_2015 
912 |a GBV_ILN_2018 
912 |a GBV_ILN_2020 
912 |a GBV_ILN_2021 
912 |a GBV_ILN_2025 
912 |a GBV_ILN_2026 
912 |a GBV_ILN_2027 
912 |a GBV_ILN_2031 
912 |a GBV_ILN_2044 
912 |a GBV_ILN_2048 
912 |a GBV_ILN_2050 
912 |a GBV_ILN_2055 
912 |a GBV_ILN_2056 
912 |a GBV_ILN_2057 
912 |a GBV_ILN_2061 
912 |a GBV_ILN_2088 
912 |a GBV_ILN_2107 
912 |a GBV_ILN_2108 
912 |a GBV_ILN_2110 
912 |a GBV_ILN_2111 
912 |a GBV_ILN_2119 
912 |a GBV_ILN_2129 
912 |a GBV_ILN_2190 
912 |a GBV_ILN_2522 
912 |a GBV_ILN_2932 
912 |a GBV_ILN_2947 
912 |a GBV_ILN_2949 
912 |a GBV_ILN_2950 
912 |a GBV_ILN_4012 
912 |a GBV_ILN_4035 
912 |a GBV_ILN_4037 
912 |a GBV_ILN_4046 
912 |a GBV_ILN_4112 
912 |a GBV_ILN_4125 
912 |a GBV_ILN_4126 
912 |a GBV_ILN_4242 
912 |a GBV_ILN_4251 
912 |a GBV_ILN_4305 
912 |a GBV_ILN_4306 
912 |a GBV_ILN_4307 
912 |a GBV_ILN_4313 
912 |a GBV_ILN_4322 
912 |a GBV_ILN_4323 
912 |a GBV_ILN_4324 
912 |a GBV_ILN_4325 
912 |a GBV_ILN_4335 
912 |a GBV_ILN_4346 
912 |a GBV_ILN_4393 
912 |a GBV_ILN_4700 
951 |a AR 
952 |d 60  |j 2000  |e 4  |h 1330-1339