Generalized Priority Systems. Analytical Results and Numerical Algorithms
Serdica Journal of Computing (2014)
- Volume: 8, Issue: 3, page 281-290
- ISSN: 1312-6555
Access Full Article
top
Abstract
topHow to cite
topMishkoy, Gheorghe. "Generalized Priority Systems. Analytical Results and Numerical Algorithms." Serdica Journal of Computing 8.3 (2014): 281-290. <http://eudml.org/doc/270077>.
@article{Mishkoy2014,
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.},
author = {Mishkoy, Gheorghe},
journal = {Serdica Journal of Computing},
keywords = {Priority; Switchover Time; Busy Period; Queue Length; Traffic Coefficient},
language = {eng},
number = {3},
pages = {281-290},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Generalized Priority Systems. Analytical Results and Numerical Algorithms},
url = {http://eudml.org/doc/270077},
volume = {8},
year = {2014},
}
TY - JOUR
AU - Mishkoy, Gheorghe
TI - Generalized Priority Systems. Analytical Results and Numerical Algorithms
JO - Serdica Journal of Computing
PY - 2014
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 8
IS - 3
SP - 281
EP - 290
AB - 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.
LA - eng
KW - Priority; Switchover Time; Busy Period; Queue Length; Traffic Coefficient
UR - http://eudml.org/doc/270077
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.