Generalized Priority Systems. Analytical Results and Numerical Algorithms

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.

Academic Experience and Personal Abilities in Analytical Chemistry Education

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2016