Name
Title | ||
|---|---|---|
An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models. |
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. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.2307/1427936 | ADVANCES IN APPLIED PROBABILITY |
Keywords | Field | DocType |
PRODUCT-FORM MODELS,LOSS NETWORKS,CIRCUIT-SWITCHED COMMUNICATION NETWORKS,RESOURCE-SHARING MODELS,COORDINATE CONVEX RESOURCE-SHARING POLICIES,GENERATING FUNCTIONS,NUMERICAL TRANSFORM INVERSION,NORMALIZATION CONSTANTS,PARTITION FUNCTIONS | Generating function,Normalization (statistics),Partition function (mathematics),Computer science,Inversion (meteorology),Algorithm,Queueing theory,Poisson distribution,Computation,Computational complexity theory | Conference |
Volume | Issue | ISSN |
27.0 | 4.0 | 0001-8678 |
Citations | PageRank | References |
30 | 2.44 | 34 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gagan L. Choudhury | 1 | 445 | 75.32 |
| Kin K. Leung | 2 | 2463 | 183.60 |
| Ward Whitt | 3 | 3562 | 697.71 |
| bell laboratories | 4 | 76 | 24.69 |