Asymptotic expansions for large closed queueing networks with multiple job classes

1992 ◽  
Vol 41 (4) ◽  
pp. 480-488 ◽  
Author(s):  
C. Knessl ◽  
C. Tier
Keyword(s):  
Asymptotic Expansions ◽  
Queueing Networks ◽  
Closed Queueing Networks

Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes

1985 ◽  
Vol 17 (1) ◽  
pp. 163-185 ◽  
Author(s):  
J. A. Morrison ◽  
D. Mitra
Keyword(s):  
Waiting Time ◽  
Asymptotic Expansions ◽  
Queueing Networks ◽  
Parabolic Cylinder ◽  
Processor Sharing ◽  
Closed Queueing Networks ◽  
Second Moments ◽  
Large Numbers ◽  
Sharing Time ◽  
Leading Term

We present new results based on novel techniques for the problem of characterizing the waiting-time distribution in a class of closed queueing networks in heavy usage, which in practical terms means that the processor is utilized more than about 80 per cent. This paper extends recent work by Mitra and Morrison [10] on the same system in normal usage. The closed system has a CPU operating under the processor-sharing (‘time-slicing’) discipline and a bank of terminals. The presence of multiple job-classes allows distinctions in the user’s behavior in the terminal and in the service requirements. This work is primarily applicable to the case of large numbers of terminals. We give an effective method for calculating, for the equilibrium waiting time, the first and second moments and the leading term in the asymptotic approximation to the distribution. Our results are in the form of asymptotic expansions in inverse powers of , where N is a large parameter. The expansion coefficients depend on the classical parabolic cylinder functions.

Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes

1985 ◽  
Vol 17 (01) ◽  
pp. 163-185
Author(s):  
J. A. Morrison ◽  
D. Mitra
Keyword(s):  
Waiting Time ◽  
Asymptotic Expansions ◽  
Queueing Networks ◽  
Parabolic Cylinder ◽  
Processor Sharing ◽  
Closed Queueing Networks ◽  
Second Moments ◽  
Large Numbers ◽  
Sharing Time ◽  
Leading Term

We present new results based on novel techniques for the problem of characterizing the waiting-time distribution in a class of closed queueing networks in heavy usage, which in practical terms means that the processor is utilized more than about 80 per cent. This paper extends recent work by Mitra and Morrison [10] on the same system in normal usage. The closed system has a CPU operating under the processor-sharing (‘time-slicing’) discipline and a bank of terminals. The presence of multiple job-classes allows distinctions in the user’s behavior in the terminal and in the service requirements. This work is primarily applicable to the case of large numbers of terminals. We give an effective method for calculating, for the equilibrium waiting time, the first and second moments and the leading term in the asymptotic approximation to the distribution. Our results are in the form of asymptotic expansions in inverse powers of , where N is a large parameter. The expansion coefficients depend on the classical parabolic cylinder functions.

Sign in / Sign up

Export Citation Format

Share Document