Computing performance measures in a multi-class multi-resource processor-shared loss system. (English) Zbl 0961.90018
Eur. J. Oper. Res. 123, No. 1, 61-72 (2000); erratum ibid. 123, No. 3, 685 (2001).
Summary: This paper develops methods to compute performance measures in a specific type of loss system with multiple classes of customers sharing the same processor. Such systems arise in the modeling of a call center, where the performance measures of interest are the blocking probability of a call and the reneging probability of customers that are put on hold. Expressions for these performance measures have been derived in previous work by the authors. Given the difficulty of computing these performance measures for realistic systems, this paper proposes two different approaches to simplify this computation. The first method introduces the idea of multidimensional convolutions, and uses this approach to compute exact blocking and reneging probabilities. The second method establishes an adaptation of the Monte Carlo summation technique in order to obtain good estimates of blocking and reneging probabilities in large systems along with their associated confidence intervals.
MSC:
| 90B15 | Stochastic network models in operations research |
| 60K25 | Queueing theory (aspects of probability theory) |
| 90B22 | Queues and service in operations research |
| 90C59 | Approximation methods and heuristics in mathematical programming |
References:
| [1] | Akşin, O.Z., Harker, P.T., 1996a. Modeling a phone center: Analysis of a multi-class, multi-resource, processor shared loss system. Working Paper, Financial Institutions Center, The Wharton School, Philadelphia, PA; Akşin, O.Z., Harker, P.T., 1996a. Modeling a phone center: Analysis of a multi-class, multi-resource, processor shared loss system. Working Paper, Financial Institutions Center, The Wharton School, Philadelphia, PA |
| [2] | Akşin, O.Z., Harker, P.T., 1996b. To sell or not to sell: Determining the tradeoffs between sales and service in retail banking phone centers. Working Paper, Financial Institutions Center, The Wharton School, Philadelphia, PA; Akşin, O.Z., Harker, P.T., 1996b. To sell or not to sell: Determining the tradeoffs between sales and service in retail banking phone centers. Working Paper, Financial Institutions Center, The Wharton School, Philadelphia, PA |
| [3] | Akşin, O.Z., Harker, P.T., 1996c. Staffing a call center. Working Paper, INSEAD, Fontainebleau, France; Akşin, O.Z., Harker, P.T., 1996c. Staffing a call center. Working Paper, INSEAD, Fontainebleau, France |
| [4] | Bratley, P., Fox, B.L., Shrage, L.E., 1987. A Guide to Simulation. Springer, Berlin; Bratley, P., Fox, B.L., Shrage, L.E., 1987. A Guide to Simulation. Springer, Berlin |
| [5] | Buzen, J. P., Computational algorithms for closed queuing networks with exponential servers, Communications of the ACM, 16, 527-531 (1973) · Zbl 0261.68031 |
| [6] | De Waal, P. R.; Van Dijk, N. M., Monotonicity of performance measures in a processor sharing queue, Performance Evaluation, 12, 5-16 (1991) |
| [7] | Kaufman, J.S., 1981. Blocking in a shared resource environment. IEEE Transactions on Communications COM-29, 1474-1481; Kaufman, J.S., 1981. Blocking in a shared resource environment. IEEE Transactions on Communications COM-29, 1474-1481 |
| [8] | Lam, S. S.; Lien, Y. L., A tree convoluted algorithm for the solution of queueing networks, Communications of the ACM, 26, 203-215 (1983) |
| [9] | McKenna, J.; Mitra, D.; Ramakrishnan, K. G., A class of closed Markovian queueing networks: Integral representations, asymptotic expansions, and generalizations, Bell Systems Technical Journal, 60, 599-641 (1981) · Zbl 0462.60089 |
| [10] | Mitra, D., Asymptotic analysis and computational methods for a class of simple circuit-switched networks with blocking, Advances in Applied Probability, 19, 219-239 (1987) · Zbl 0615.60085 |
| [11] | Mitra, D., Ramakrishnan, K.G., 1990. A numerical investigation into the optimal design of congestion controls for high speed data networks. Technical Report, AT&T Bell Laboratories; Mitra, D., Ramakrishnan, K.G., 1990. A numerical investigation into the optimal design of congestion controls for high speed data networks. Technical Report, AT&T Bell Laboratories |
| [12] | Reiser, M.; Kobayashi, H., Queueing networks with multiple closed chains: theory and computational algorithms, IBM Journal of Research and Development, 19, 283-294 (1975) · Zbl 0307.68042 |
| [13] | Roberts, J.W., 1981. A service system with heterogeneous user requirements. Performance of Data Communication Systems and their Applications 423-431; Roberts, J.W., 1981. A service system with heterogeneous user requirements. Performance of Data Communication Systems and their Applications 423-431 |
| [14] | Ross, K.W., 1995. Loss Models for Multiservice Telecommunication Networks. Springer, Berlin; Ross, K.W., 1995. Loss Models for Multiservice Telecommunication Networks. Springer, Berlin · Zbl 1094.90514 |
| [15] | Ross, K. W.; Wang, J., Monte Carlo summation applied to product-form loss networks, Probability in the Engineering and Informational Sciences, 6, 323 (1992) · Zbl 1134.90330 |
| [16] | Ross, K. W.; Tsang, D. H.K.; Wang, J., Monte Carlo summation and integration applied to multiclass queueing networks, Journal of the Association for Computing Machinery, 41, 1110-1135 (1993) · Zbl 0829.68010 |
| [17] | Tsang, D. H.K.; Ross, K. W., Algorithms to determine exact blocking probabilities for multirate tree networks, IEEE Transactions on Communications, 38, 1266-1271 (1990) · Zbl 0706.94028 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
