Asymptotic Expansions of Moments of the Waiting Time in Closed and Open Processor-Sharing Systems with Multiple Job Classes

We present new results based on novel techniques for the problem of characterizing the waiting-time distribution in a class of queueing networks. We give effective methods for computing, for each of possibly several job-classes, the second moment of the equilibrium waiting time for closed systems as...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:Advances in Applied Probability. - Applied Probability Trust. - 15(1983), 4, Seite 813-839
1. Verfasser: Mitra, Debasis (VerfasserIn)
Weitere Verfasser: Morrison, J. A.
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 1983
Zugriff auf das übergeordnete Werk:Advances in Applied Probability
Schlagworte:Queueing networks Queueing theory Waiting-time moments Mathematics Applied sciences Behavioral sciences Social sciences
LEADER 01000caa a22002652 4500
001 JST000681296
003 DE-627
005 20240619091218.0
007 cr uuu---uuuuu
008 150322s1983 xx |||||o 00| ||eng c
024 7 |a 10.2307/1427326  |2 doi 
035 |a (DE-627)JST000681296 
035 |a (JST)1427326 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Mitra, Debasis  |e verfasserin  |4 aut 
245 1 0 |a Asymptotic Expansions of Moments of the Waiting Time in Closed and Open Processor-Sharing Systems with Multiple Job Classes 
264 1 |c 1983 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
520 |a We present new results based on novel techniques for the problem of characterizing the waiting-time distribution in a class of queueing networks. We give effective methods for computing, for each of possibly several job-classes, the second moment of the equilibrium waiting time for closed systems as well as for open systems. Both open and closed systems have a CPU operating under the processor-sharing ('time-slicing') discipline in which service-time requirements may depend on job-class. The closed system also includes a bank of terminals grouped according to job-classes, with the class structure allowing distinctions in the user's behavior in the terminal. In the contrasting open system, the job streams submitted to the CPU are Poisson with rate parameters dependent on job-classes. Our results are exact for the open system and, for the closed system, in the form of an asymptotic series in inverse powers of a parameter N. In fact, the result for open networks is simply the first term in the asymptotic series. For larger closed systems, the parameter N is larger and thus fewer terms of the series need be computed to achieve a desired degree of accuracy. The complexity of the calculations for the asymptotic expansions is polynomial in number of classes and, importantly, independent of the class populations. Only the results on the single-class systems, closed and open, were previously known. 
540 |a Copyright 1983 Applied Probability Trust 
650 4 |a Queueing networks 
650 4 |a Queueing theory 
650 4 |a Waiting-time moments 
650 4 |a Mathematics  |x Pure mathematics  |x Algebra  |x Coefficients 
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 Mathematical moments 
650 4 |a Mathematics  |x Mathematical expressions  |x Mathematical functions  |x Hypergeometric functions  |x Generating function 
650 4 |a Applied sciences  |x Systems science  |x Closed systems 
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 Applied sciences  |x Systems science  |x Open systems 
650 4 |a Mathematics  |x Mathematical procedures 
650 4 |a Mathematics  |x Mathematical expressions 
650 4 |a Mathematics  |x Pure mathematics  |x Calculus  |x Differential calculus  |x Mathematical integration  |x Mathematical integrals 
650 4 |a Social sciences  |x Population studies  |x Demography  |x Population distributions 
655 4 |a research-article 
700 1 |a Morrison, J. A.  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t Advances in Applied Probability  |d Applied Probability Trust  |g 15(1983), 4, Seite 813-839  |w (DE-627)269247009  |w (DE-600)1474602-5  |x 00018678  |7 nnns 
773 1 8 |g volume:15  |g year:1983  |g number:4  |g pages:813-839 
856 4 0 |u https://www.jstor.org/stable/1427326  |3 Volltext 
856 4 0 |u https://doi.org/10.2307/1427326  |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_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_65 
912 |a GBV_ILN_69 
912 |a GBV_ILN_70 
912 |a GBV_ILN_90 
912 |a GBV_ILN_100 
912 |a GBV_ILN_110 
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_2026 
912 |a GBV_ILN_2027 
912 |a GBV_ILN_2044 
912 |a GBV_ILN_2050 
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_2110 
912 |a GBV_ILN_2190 
912 |a GBV_ILN_2938 
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_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_4325 
912 |a GBV_ILN_4335 
912 |a GBV_ILN_4346 
912 |a GBV_ILN_4392 
912 |a GBV_ILN_4393 
912 |a GBV_ILN_4700 
951 |a AR 
952 |d 15  |j 1983  |e 4  |h 813-839