Priority Switchover Time Busy Period Queue Length Traffic 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.
