Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-27T05:55:31.942Z Has data issue: false hasContentIssue false
  • English
  • Français

An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models

Part of: Operations research and management science Special processes

Published online by Cambridge University Press:  01 July 2016

Gagan L. Choudhury ,
Kin K. Leung  and
Ward Whitt
Gagan L. Choudhury*
Affiliation:
AT&T Bell Laboratories
Kin K. Leung*
Affiliation:
AT&T Bell Laboratories
Ward Whitt*
Affiliation:
AT&T Bell Laboratories
*
* AT&T Bell Laboratories, Holmdel, NJ 07733-3030, USA.
* AT&T Bell Laboratories, Holmdel, NJ 07733-3030, USA.
** AT&T Bell Laboratories, Murray Hill, NJ 07974-0636, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we consider a family of product-form loss models, including loss networks (or circuit-switched communication networks) and a class of resource-sharing models. There can be multiple classes of requests for multiple resources. Requests arrive according to independent Poisson processes. The requests can be for multiple units in each resource (the multi-rate case, e.g. several circuits on a trunk). There can be upper-limit and guaranteed-minimum sharing policies as well as the standard complete-sharing policy. If all the requirements of a request cannot be met upon arrival, then the request is blocked and lost. We develop an algorithm for computing the (exact) steady-state blocking probability of each class and other steady state descriptions in these loss models. The algorithm is based on numerically inverting generating functions of the normalization constants. In a previous paper we introduced this approach to product-form models and developed a full algorithm for a class of closed queueing networks. The inversion algorithm promises to be even more useful for loss models than for closed queueing networks because fewer alternative algorithms are available for loss models. Indeed, for many loss models with sharing policies other than traditional complete sharing, our algorithm is the first effective algorithm. Unlike some recursive algorithms, our algorithm has a low storage requirement. To treat the loss models here, we derive the generating functions of the normalization constants and develop a new scaling algorithm especially tailored to the loss models. In general, the computational complexity grows exponentially in the number of resources, but the computation can often be reduced dramatically by exploiting conditional decomposition based on special structure and by appropriately truncating large finite sums. We illustrate our numerical inversion algorithm by applying it to several examples. To validate our algorithm on small models, we also develop a direct algorithm. The direct algorithm itself is of interest, because it tends to be more efficient when the number of resources is large, but the number of request classes is small. Furthermore, it also allows a form of conditional decomposition based on special structure.

Keywords

PRODUCT-FORM MODELSLOSS NETWORKSCIRCUIT-SWITCHED COMMUNICATION NETWORKSRESOURCE-SHARING MODELSCOORDINATE-CONVEX RESOURCE-SHARING POLICIESGENERATING FUNCTIONSNUMERICAL TRANSFORM INVERSIONNORMALIZATION CONSTANTSPARTITION FUNCTIONS

MSC classification

Primary: 60K25: Queueing theory
Secondary: 90B15: Network models, stochastic 90B22: Queues and service 60K35: Interacting random processes; statistical mechanics type models; percolation theory
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 27 , Issue 4 , December 1995 , pp. 1104 - 1143
Copyright
Copyright © Applied Probability Trust 1995 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Abate, J. and Whitt, W. (1992a) The Fourier-series method for inverting transforms of probability distributions. Queueing Systems 10, 5–88.CrossRefGoogle Scholar
Abate, J. and Whitt, W. (1992b) Numerical inversion of probability generating functions. Operat. Res. Letters 12, 245–251.CrossRefGoogle Scholar
Aein, J. M. (1978) A multi-user-class, blocked-calls-cleared demand access mode. IEEE Trans. Commun. 26, 378–385.CrossRefGoogle Scholar
Aein, J. M. and Kosovych, O. S. (1977) Satellite capacity allocation. Proc. IEEE 65, 332–342.CrossRefGoogle Scholar
Ash, G. R. and Huang, B. D. (1993) An analytical model for adaptive routing networks. IEEE Trans. Commun. 41, 1748–1759.CrossRefGoogle Scholar
Bertozzi, A. and Mckenna, J. (1993) Multidimensional residues, generating functions, and their application to queueing networks. SIAM Rev. 35, 239–268.CrossRefGoogle Scholar
Burman, D. Y., Lehoczky, J. P. and Lim, Y. (1984) Insensitivity of blocking probabilities in a circuit switching network. J. Appl. Prob. 21, 850–859.CrossRefGoogle Scholar
Buzen, J. P. (1973) Computational algorithms for the closed queueing networks with exponential servers. Commun. ACM 16, 527–531.CrossRefGoogle Scholar
Choudhury, G. L., Leung, K. K. and Whitt, W. (1995a) Calculating normalization constants of closed queueing networks by numerically inverting their generating functions. J. ACM, to appear. (Abbreviated version in Proc. 1994 Conf. Inf. Sci. Syst. , ed. Kobayashi, H., Princeton University, 7–11.)Google Scholar
Choudhury, G. L., Leung, K. K. and Whitt, W. (1995b) An inversion algorithm to calculate blocking probabilities in loss networks with state-dependent rates. ACM/IEEE Trans. Network., to appear. (Abbreviated version in Proc. IEEE Infocom '95, 513-521.) Google Scholar
Choudhury, G. L., Leung, K. K. and Whitt, W. (1995c) Resource-sharing models with state-dependent arrivals of batches. In Computations with Markov Chains, ed. Stewart, W. J., pp. 255–282. Kluwer, Boston.CrossRefGoogle Scholar
Choudhury, G. L., Leung, K. K. and Whitt, W. (1995d) Efficiently providing multiple grades of service with protection against overloads in shared resources. AT&T Tech. J., to appear.CrossRefGoogle Scholar
Choudhury, G. L., Lucantoni, D. M. and Whitt, W. (1994a) Multidimensional transform inversion with applications to the transient M/G/1 queue. Ann. Appl. Prob. 4, 719–740.CrossRefGoogle Scholar
Choudhury, G. L., Lucantoni, D. M. and Whitt, W. (1994b) Numerical transform inversion to analyze teletraffic models. In The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks, Proc. 14th Int. Teletraffic Congress, ed. Labetoulle, J. and Roberts, J. W., 1b, 1043–1052. Elsevier, Amsterdam.Google Scholar
Chuah, M. C. (1993) General pricing framework for multiple service, multiple resource systems. AT&T Bell Laboratories, Holmdel, NJ.Google Scholar
Chung, S.-P., and Ross, K. (1993) Reduced load approximation for multirate loss networks. IEEE Trans. Commun. 41, 1222–1231.CrossRefGoogle Scholar
Conway, A. E. and Pinsky, E. (1992) A decomposition method for the exact analysis of circuit-switched networks. Proc. IEEE Infocom '92, 996–1003.CrossRefGoogle Scholar
Delbrouck, L. W. N. (1983) On the steady-state distribution in a service facility carrying mixtures of traffic with different peakedness factors and capacity requirements. IEEE Trans. Commun. 31, 1209–1211.CrossRefGoogle Scholar
Dziong, Z. and Roberts, J. W. (1987) Congestion probabilities in a circuit-switched integrated services network. Perf. Eval. 7, 267–284.CrossRefGoogle Scholar
Evans, S. P. (1991) Optimal bandwidth management and capacity provision in a broadband network using virtual paths. Perf Eval. 13, 27–43.CrossRefGoogle Scholar
Gaujal, B., Greenberg, A. and Nicol, D. (1993) A sweep algorithm for massively parallel simulation of circuit-switched networks. J. Parallel Distrib. Computing 18, 484–500.CrossRefGoogle Scholar
Greenberg, A., Nicol, D. and Lubachevsky, B. (1992) MIMD parallel simulation of circuit-switched communication networks. In Proc. 1992 Winter Simulation Conference.Google Scholar
Jordan, S. and Varaiya, P. P. (1991) Throughput in multiple service, multiple resource communication networks. IEEE Trans. Commun. 39, 1216–1222.CrossRefGoogle Scholar
Kamoun, F. and Kleinrock, L. (1980) Analysis of shared finite storage in a computer network node environment under general traffic conditions. IEEE Trans. Commun. 28, 992–1003.CrossRefGoogle Scholar
Kaufman, J. S. (1981) Blocking in a shared resource environment. IEEE Trans. Commun. 29, 1474–1481.CrossRefGoogle Scholar
Kaufman, J. S. and Rege, K. M. (1995) Blocking in a shared resource environment with batched Poisson arrival processes. Perf. Eval., to appear.CrossRefGoogle Scholar
Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley, New York.Google Scholar
Kelly, F. P. (1985) Stochastic models of computer communication systems. J.R. Statist. Soc. B 47, 379–395.Google Scholar
Kelly, F. P. (1986) Blocking probabilities in large circuit-switched networks. Adv. Appl. Prob. 18, 473–505.CrossRefGoogle Scholar
Kelly, F. P. (1991) Loss networks. Ann. Appl. Prob. 1, 319–378.CrossRefGoogle Scholar
Kogan, Y. (1989) Exact analysis for a class of simple, circuit-switched networks with blocking. Adv. Appl. Prob. 21, 952–955.CrossRefGoogle Scholar
Kogan, Y. and Shenfild, M. (1994) Asymptotic solutions of generalized multiclass Engset models. In Proc. 14th Int. Teletraffic Congress, ed Labetoulle, J. and Roberts, J. W., 1239–1249. Elsevier, Amsterdam.Google Scholar
Labourdette, J. P. and Hart, G. W. (1992) Blocking probabilities in multitraffic loss systems: insensitivity, asymptotic behavior, and approximations. IEEE Trans. Commun. 40, 1355–1366.CrossRefGoogle Scholar
Lam, S. S. (1977) Queueing networks with population size constraints. IBM J. Res. Dev. 21, 370–378.CrossRefGoogle Scholar
Lam, S. S. and Lien, Y. L. (1983) A tree convolution algorithm for the solution of queueing networks. Commun. ACM 26, 203–215.CrossRefGoogle Scholar
Melamed, B. and Whitt, W. (1990) On arrivals that see time averages. Operat. Res. 38, 156–172.CrossRefGoogle Scholar
Mitra, D. (1987) Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking. Adv. Appl. Prob. 19, 291–239.CrossRefGoogle Scholar
Mitra, D. and Morrison, J. A. (1994) Erlang capacity and uniform approximations for shared unbuffered resources. In Proc. 14th Int. Teletraffic Congress, ed Labetoulle, J. and Roberts, J. W., 875–886. Elsevier, Amsterdam.Google Scholar
Mitra, D., Gibbens, R. J. and Huang, B. D. (1993) State-dependent routing on symmetric loss networks with trunk reservations-I. IEEE Trans. Commun. 41, 400–411.CrossRefGoogle Scholar
Morrison, J. A. (1995) Blocking probabilities for multiple class batched Poisson arrivals to a shared resource. Perf. Eval., to appear.CrossRefGoogle Scholar
Pinsky, E. and Conway, A. E. (1992) Computational algorithms for blocking probabilities in circuit-switched networks. Ann. Operat. Res. 35, 31–41.CrossRefGoogle Scholar
Reiman, M. I. (1991) A critically loaded multiclass Erlang loss system. Queueing Systems 9, 65–82.CrossRefGoogle Scholar
Reiser, M. and Kobayashi, H. (1975) Queueing networks with multiple closed chains: theory and computational algorithms. IBM J. Res. Dev. 19, 283–294.CrossRefGoogle Scholar
Roberts, J. W. (1981) A service system with heterogeneous user requirements. In Performance of Data. Commun. Systems and their Applications, ed. Pujolle, G., pp. 423–431. North-Holland, Amsterdam.Google Scholar
Ross, K. W. and Tsang, D. H. K. (1989a) The stochastic knapsack problem. IEEE Trans. Commun. 37, 740–747.CrossRefGoogle Scholar
Ross, K. W. and Tsang, D. H. K. (1989b) Optimal circuit access policies in an ISDN environment: a Markov decision approach. IEEE Trans. Commun. 37, 934–939.CrossRefGoogle Scholar
Ross, K. W. and Tsang, D. (1990) Teletraffic engineering for product-form circuit-switched networks. Adv. Appl. Prob. 22, 657–675.CrossRefGoogle Scholar
Ross, K. W. and Wang, J. (1992) Monte Carlo summation applied to product-form loss networks. Prob. Engr. Inf. Sci. 6, 323–348.CrossRefGoogle Scholar
Tsang, D. and Ross, K. W. (1990) Algorithms to determine exact blocking probabilities for multirate tree networks. IEEE Trans. Commun. 38, 1266–1271.Google Scholar
Van Doorn, E. A. and Panken, J. F. M. (1993) Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements. IEEE/ACM Trans. Networking 1, 664–667.CrossRefGoogle Scholar
Van De Vlag, H. A. B. and Awater, G. A. (1994) Exact computation of time and call blocking probabilities in multi-traffic circuit-switched networks. Proc. IEEE Infocom '94 , 56–65.CrossRefGoogle Scholar
Whitt, W. (1980) Continuity of generalized semi-Markov processes. Math. Operat. Res. 5, 494–501.CrossRefGoogle Scholar
Whitt, W. (1985) Blocking when service is required from several facilities simultaneously. AT&T Tech. J. 64, 1807–1855.Google Scholar
Wimp, J. (1981) Sequence Transformations and their Applications. Academic Press, New York.Google Scholar