Generalized Priority Systems. Analytical Results and Numerical Algorithms

Autor:	Mishkoy, Gheorghe
Rok vydání:	2015
Předmět:	Queue Length Switchover Time Busy Period Priority Traffic Coefficient
Zdroj:	Serdica Journal of Computing. 8:281-290
ISSN:	1314-7897 1312-6555
DOI:	10.55630/sjc.2014.8.281-290
Popis:	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 algorithmsfor systems’ busy periods and traffic coefficients are developed.ACM Computing Classification System (1998): 60K25.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5f00693e22bc070641f83415715297d https://doi.org/10.55630/sjc.2014.8.281-290 Zobrazit plný text záznamu