Generalized Priority Systems. Analytical Results and Numerical Algorithms

Authors

  • Gheorghe Mishkoy Institute of Mathematics and Computer Science Academy of Sciences of Moldova Free International University of Moldova Chișinău, Republic of Moldova

DOI:

https://doi.org/10.55630/sjc.2014.8.281-290

Keywords:

Priority, Switchover Time, Busy Period, Queue Length, Traffic Coefficient

Abstract

A class of priority systems with non-zero switching times, referred as
generalized priority systems, is considered.
Analytical results regarding the distribution of busy periods, queue lengths
and various auxiliary characteristics are presented. These results can be
viewed as generalizations of the Kendall functional equation and the
Pollaczek-Khintchin transform equation, respectively. Numerical algorithms
for systems’ busy periods and traffic coefficients are developed.

ACM Computing Classification System (1998): 60K25.

Downloads

Published

2015-07-13

Issue

Vol. 8 No. 3 (2014)

Section

Articles