×

Multidimensional analogs of the Kendall equation for priority queueing systems: computational aspects. (English. Russian original) Zbl 1156.93314

Autom. Remote Control 69, No. 6, 980-992 (2008); translation from Avtom. Telemekh. 2008, No. 6, 82-95 (2008).
Summary: An analogy between celebrated Kendall equation for busy periods in the system \(M|GI|1\) and analytical results for busy periods in the priority systems \(M_r |GI_r |1\) is drawn. These results can be viewed as generalizations of the functional Kendall equation. The methodology and algorithms of numerical solution of recurrent functional equations which appear in the analysis of such queueing systems are developed. The efficiency of the algorithms is achieved by acceleration of the numerical procedure of solving the classical Kendall equation. An algorithm of calculation of the system workload coefficient calculation is given.

MSC:

93A30 Mathematical modelling of systems (MSC2010)
90B22 Queues and service in operations research
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Kendall, D.G., Some Problems in the Theory of Queues, J. R. Stat. Soc. Ser. B, Stat. Methodol., 1951, vol. 13(2), pp. 151–185. · Zbl 0045.07801
[2] Klimov, G.P. and Mishkoy, G.K., Prioritetnye sistemy obsluzhivaniya s orientatsiei (Priority Queueing Systems with Switchings), Moscow: Mosk. Gos. Univ., 1979.
[3] Abate, J. and Whitt, W., Solving Probability Transform Functional Equations for Numerical Inversion, Oper. Res. Lett., 1992, vol. 12, pp. 275–281. · Zbl 0766.60107
[4] Mishkoy, Gh., Giordano, S., Andronati, N., and Bejan, A., Priority Queueing Systems with Switchover Times: Generalized Models for QoS and CoS Network Technologies and Analysis, Technical Report, 2006 ( http://www.vitrum.md/andrew/PQSST.pdf ).
[5] Gnedenko, B.V. et al., Prioritetnye Sistemy Obsluzhivaniya (Priority Queueing Systems), Moscow: Mosk. Gos. Univ., 1973.
[6] Volkovinskii, M.I. and Kabalevskii, A.N., Analiz prioritetnykh ocheredei s uchetom vremeni pereklyucheniya (Analysis of Priority Queues with Switchover Times), Moscow: Energoizdat, 1981.
[7] Abramowitz, M. and Stegun, I.A., Handbook of Mathematical Functions: With Formulas, Graphs, and Mathematical Tables, National Bureau of Standards. Applied Mathematics Series, 1964, vol. 55, pp. 355–389. · Zbl 0171.38503
[8] Bernstein, S.N., Sur les fonctions absolument monotones, Acta Mathematica, 1928, pp. 1–6. · JFM 55.0142.07
[9] Feller, W., An Introduction to Probability Theory and Its Applications, New York: Wiley, 1971, vol. I. · Zbl 0219.60003
[10] Valk√≥, P.P. and Abate, J., Comparison of Sequence Accelerators for the Gaver Method of Numerical Laplace Transform Inversion, Comput. Math. Appl., 2004, vol. 48, pp. 629–636. · Zbl 1064.65152
[11] Bejan, A., On Algorithms of Busy Time Period Evaluation in Priority queues with Orientation Time, Communications of the Second Conference of the Mathematical Society of the Republic of Moldova, 2004, pp. 32–36.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.