Computing performance measures in a multi-class multi-resource processor-shared loss system

European Journal of Operational Research

Volumn 123, Issue 1, 2000, Pages 61-72

  Akşin, O Zeynep ^a   Harker, Patrick T ^b  

^a INSEAD   (France)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONVOLUTION; MATHEMATICAL MODELS; MONTE CARLO METHODS; MULTIPROCESSING SYSTEMS; PERFORMANCE; PROBABILITY;

COMPUTATIONAL ANALYSIS; MULTI CLASS MULTI RESOURCE PROCESSOR SHARED LOSS SYSTEM; MULTIDIMENSIONAL CONVOLUTIONS; PROCESSOR SHARING;

QUEUEING NETWORKS;

EID: 0343953373     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00051-X     Document Type: Article

References (17)

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.
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.
3. 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.
5. Buzen J.P. Computational algorithms for closed queuing networks with exponential servers. Communications of the ACM. 16:1973;527-531.
6. De Waal P.R., Van Dijk N.M. Monotonicity of performance measures in a processor sharing queue. Performance Evaluation. 12:1991;5-16.
7. 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:1983;203-215.
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:1981;599-641.
10. Mitra D. Asymptotic analysis and computational methods for a class of simple circuit-switched networks with blocking. Advances in Applied Probability. 19:1987;219-239.
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.
12. Reiser M., Kobayashi H. Queueing networks with multiple closed chains: theory and computational algorithms. IBM Journal of Research and Development. 19:1975;283-294.
13. 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.
15. Ross K.W., Wang J. Monte Carlo summation applied to product-form loss networks. Probability in the Engineering and Informational Sciences. 6:1992;323.
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:1993;1110-1135.
17. Tsang D.H.K., Ross K.W. Algorithms to determine exact blocking probabilities for multirate tree networks. IEEE Transactions on Communications. 38:1990;1266-1271.