Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/2462

 Title: Generalized Priority Systems. Analytical Results and Numerical Algorithms Authors: Mishkoy, Gheorghe Keywords: PrioritySwitchover TimeBusy PeriodQueue LengthTraffic Coefficient Issue Date: 2014 Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences Citation: Serdica Journal of Computing, Vol. 8, No 3, (2014), 281p-290p 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. URI: http://hdl.handle.net/10525/2462 ISSN: 1312-6555 Appears in Collections: Volume 8 Number 3

Files in This Item:

File Description SizeFormat