Multidimensional analogs of the kendall equation for priority queueing systems: computational aspects

Authors:
Gh. K. Mishkoy;V. V. Rykov;S. Giordano;A. Iu. Bejan
Affiliations:
Academy of Sciences of Moldova, Chisinau, Moldova;Gubkin Russian State University of Oil and Gas, Moscow, Russia;University of Applied Sciences of Southern Switzerland, Canton Ticino, Switzerland;State University of Moldova, Chisinau, Moldova
Venue:
Automation and Remote Control
Year:
2008

Citing 2
Cited 0

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Comparison of sequence accelerators forthe Gaver method of numerical Laplace transform inversion

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An analogy between celebrated Kendall equation for busy periods in the system M|GI|1 and analytical results for busy periods in the priority systemsM 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.