Abstract
We recently developed a new algorithm for calculating the blocking probability of each class in resource-sharing models with upper limit and guaranteed minimum sharing policies as well as the standard complete-sharing policy. These models may have multiple resources and multiple classes, with each class requiring multiple units from each resource. These models may also have state-dependent arrival and service rates. Our new algorithm is based on calculating normalization constants appearing in the product-form steady-state distributions by numerically inverting their generating functions. In the present paper we provide the basis for extending the algorithm to resource-sharing models with batch arrival processes. The batch sizes are mutually independent random variables with distributions depending on the class. We show that the steady-state distribution of the resource-sharing model has a product form for both complete-batch blocking and partial-batch blocking, and we derive the generating functions of the normalization constants for partial-batch blocking. We primarily focus on the Bernoulli-Poisson-Pascal (BPP) special case in which the batches have linear state-dependent arrival rates, which includes finite-source inputs and Poisson inputs for the batches as special cases. With batches, we require exponential service times, but when there are state-dependent arrivals of single customers (no batches), the service-time distributions can be general. By considering state-dependent arrivals for the batches, multiple resources and noncomplete-sharing policies, our treatment extends recent results for resource-sharing models with batch arrivals by van Doom and Panken, by Kaufman and Rege and by Morrison. Even for the batch models previously considered, our algorithm is faster than recursive algorithms when the model is large. We also provide a new derivation of the product-form steady-state distributions that helps explain why service-time insensitivity does not hold when there are batches.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Abate and W. Whitt, The Fourier-Series Method for Inverting Transforms of Probability Distributions. Queueing Systems 10 (1992) 5–88.
J. Abate and W. Whitt, Numerical Inversion of Probability Generating Functions. Oper. Res. Letters 12 (1992) 245–251.
G. L. Choudhury, K. K. Leung and W. Whitt, Calculating Normalization Constants of Closed Queueing Networks by Numerically Inverting Their Generating Functions. J. ACM, to appear.
G. L. Choudhury, K. K. Leung and W. Whitt, An Algorithm to Compute Blocking Probabilities in Multi-Rate Multi-Class Multi-Resource Loss Models. Adv. Appl. Prob. 27 (1995) to appear.
G. L. Choudhury, K. K. Leung and W. Whitt, An Inversion Algorithm To Calculate Blocking Probabilities in Loss Networks with State-Dependent Rates, submitted for publication.
G. L. Choudhury, D. M. Lucantoni and W. Whitt, Multidimensional Transform Inversion with Applications to the Transient M/G/1 Queue, Ann. Appl. Prob. 4 (1994) 719–740.
L. E. N. Delbrouck, On the Steady-State Distribution in a Service Facility with Different Peakedness Factors and Capacity Requirements. IEEE Trans. Commun., COM-31 (1983) 1209–1211.
Z. Dziong and J. W. Roberts, Congestion Probabilities in a Circuit-Switched Integrated Services Network. Perf. Eval. 7 (1987) 267–284.
W. Feller, An Introduction to Probability Theory and its pplications,Vol. I, third edition, Wiley, New York.
J. R. Jackson, Jobshop-like Queueing Systems. Management Science 10 (1963) 131–142.
J. S. Kaufman and K. M. Rege, Blocking in a Shared Resource Environment with Batched Poisson Arrival Processes. Perf. Eval., to appear.
F. P. Kelly, Loss Networks. Ann. Appl. Prob. 1 (1991) 319–378.
A. E. Krzesinski, Multiclass Queueing Networks with State-Dependent Routing. Perf. Eval. 7 (1987) 125–143.
L. Liu, B. R. K. Kashyap and J. G. C. Templeton, On the GIX/G/∞System. J. Appl. Prob. 27 (1990) 671–683.
B. Melamed and W. Whitt, On Arrivals That See Time Averages. Operations Res. 38 (1990) 156–172.
J. A. Morrison, Blocking Probabilities for Multiple Class Batched Poisson Arrivals to a Shared Resource. Perf Eval.,to appear.
M. Reiser and H. Kobayashi, Queueing Networks with Multiple Closed Chains: Theory and Computational Algorithms. IBM J. Res. Dev. 19 (1975) 283–294.
D. N. Shanbhag, On Infinite Server Queues with Batch Arrivals. J. Appl. Prob. 3 (1966) 274–279.
D. Towsley, Queueing Network Models with State-Dependent Routing. J. ACM 27 (1986) 323–337.
N. M. van Dijk, Queueing Networks and Product Forms, Wiley, New York, 1993.
E. A. van Doorn and F. J. M. Panken, Blocking Probabilities in a Loss System with Arrivals in Geometrically Distributed Batches and Heterogeneous Service Requirements. ACM/IEEE Trans. Networking 1 (1993) 664–667.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this paper
Cite this paper
Choudhury, G.L., Leung, K.K., Whitt, W. (1995). Resource-Sharing Models with State-Dependent Arrivals of Batches. In: Stewart, W.J. (eds) Computations with Markov Chains. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2241-6_16
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2241-6_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5943-2
Online ISBN: 978-1-4615-2241-6
eBook Packages: Springer Book Archive