Monotonicity and error bounds for networks of Erlang loss queues
Tóm tắt
Networks of Erlang loss queues naturally arise when modelling finite communication systems without delays, among which, most notably are
Performance measures of interest such as loss probabilities or throughputs can be obtained from the steady state distribution. However, while this steady state distribution has a closed product form expression in the first case (loss networks), it does not have one in the second case due to blocked (and lost) handovers. Product form approximations are therefore suggested. These approximations are obtained by a combined modification of both the state space (by a hypercubic expansion) and the transition rates (by extra redial rates). It will be shown that these product form approximations lead to
The proofs of these results rely upon both monotonicity results and an analytic error bound method as based on Markov reward theory. This combination and its technicalities are of interest by themselves. The technical conditions are worked out and verified for two specific applications:
The results are of practical interest for computational simplifications and, particularly, to guarantee that blocking probabilities do not exceed a given threshold such as for network dimensioning.
Tài liệu tham khảo
Abdalla, N., Boucherie, R.J.: Blocking probabilities in mobile communications networks with time-varying rates and redialing subscribers. Ann. Oper. Res. 112, 15–34 (2002)
Adan, I., van der Wal, J.: Monotonicity of the throughput of a closed queueing network in the number of jobs. Oper. Res. 37, 935–957 (1989)
Baccelli, F., Brémaud, P.: Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences. Springer, Berlin (1994)
Boucherie, R.J., Mandjes, M.: Estimation of performance measures for product form cellular mobile communications networks. Telecommun. Syst. 10, 321–354 (1998)
Boucherie, R.J., van Dijk, N.M.: On a queueing network model for cellular mobile communications networks. Oper. Res. 48, 38–49 (2000)
Boucherie, R.J., Mandjes, M., Verwijmeren, S.: Asymptotic evaluation of blocking probabilities in a hierarchical cellular mobile network. Probab. Eng. Inf. Sci. 14, 81–99 (2000)
Coleman, J.L., Henderson, W., Taylor, P.G.: A convolution algorithm for resource allocation problems with moderate user interference. IEEE Trans. Commun. 42, 1106–1111 (1994)
Everitt, D.: Product form solutions in cellular mobile communication systems. Fourth Australian Teletraffic Research Seminar, Paper No. 3.1 (1989)
Everitt, D., Macfadyen, N.W.: Analysis of multi-cellular mobile radiotelephone systems with loss. Br. Telecom Tech. J. 1, 218–222 (1983)
Keilson, L.J., Kester, A.: Monotone matrices and monotone Markov processes. Stoch. Process. Appl. 5, 231–245 (1977)
Kelly, F.P.: Loss networks. Ann. Appl. Probab. 1, 319–378 (1991)
Massey, W.A.: Strong orderings for Markov processes on partially ordered spaces. Math. Oper. Res. 12, 350–367 (1987)
Shaked, M., Shanthikumar, J.G.: Stochastic Orders and Their Applications. Academic Press, San Diego (1994)
Sonderman, D.: Comparing multi-server queues with finite waiting rooms, I: Same number of servers. Adv. Appl. Probab. 11, 439–447 (1979)
Sonderman, D.: Comparing multi-server queues with finite waiting rooms, II: Different number of servers. Adv. Appl. Probab. 11, 448–455 (1979)
Stoyan, D.: Bounds and approximations in queueing through monotonicity and continuity. Oper. Res. 25, 851–863 (1977)
Stoyan, D.: Comparison Method for Queues and Other Stochastic Models. Wiley, Chichester (1983)
Pallant, D.L., Taylor, P.G.: Approximations of performance measures in cellular mobile networks with dynamic channel allocation. Telecommun. Syst. 3, 129–163 (1994)
Pallant, D.L., Taylor, P.G.: Modeling handovers in cellular mobile networks with dynamical channel allocation. Oper. Res. 43, 33–42 (1995)
Ross, K.W.: Multiservice Loss Models for Broadband Telecommunication Systems. Springer, London (1995)
Tijms, H.C.: Stochastic Models: An Algorithmic Approach. Wiley, New York (1994)
Tsoucas, P., Walrand, J.: Monotonicity of throughput in non-Markovian networks. J. Appl. Probab. 26, 134–141 (1989)
van Dijk, N.M.: Perturbation theory for unbounded Markov reward processes with applications to queueing. Adv. Appl. Probab. 20, 99–111 (1988)
van Dijk, N.M.: The importance of bias terms for error bounds and comparison results. In: Stewart, W.J. (ed.) Numerical Solution of Markov Chains. Dekker, New York (1991)
van Dijk, N.M.: Queueing Networks and Product Forms: A Systems Approach. Wiley, Chichester (1993)
van Dijk, N.M., Miyazawa, M.: A note on bounds and error bounds for non- exponential batch arrival systems. Probab. Eng. Inf. Sci. 11, 189–201 (1997)
van Dijk, N.M., Putterman, M.L.: Perturbation theory for Markov reward processes with applications to queueing systems. Adv. Appl. Probab. 20, 79–98 (1988)
van Dijk, N.M., Tsoucas, P., Walrand, J.: Simple bounds and monotonicity of the call congestion of infinite multiserver delay systems. Probab. Eng. Inf. Sci. 2, 129–138 (1988)
Whitt, W.: Comparing counting processes and queues. Adv. Appl. Probab. 13, 207–220 (1981)