Abstract
The problem of service discipline synthesis in queuing systems with constraints on the mean residence time of different classes of requests, or chances of exceeding the limits. Problem is solved for the class of disciplines with mixed priorities between requests of different classes - relative, absolute, or no priorities. An algorithm for prioritization, ensuring the implementation of the limitations specified for the minimal system performance is proposed. The problem is solved using analytical dependences obtained for the first two moments of the residence time distribution, and the approximation of the principles of distributions on two moments.
References
Aliev, T.I., Maharevs, E.: Queueing disciplines based on priority matrix. Sci. Tech. J. Inf. Technol. Mech. Opt. 6(94), 91–97 (2014)
Aliev, T.I.: Approximation of probability distributions in queuing systems. Sci. Tech. J. Inf. Technol. Mech. Opt. 2(84), 88–93 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Aliev, T. (2016). The Synthesis of Service Discipline in Systems with Limits. In: Vishnevsky, V., Kozyrev, D. (eds) Distributed Computer and Communication Networks. DCCN 2015. Communications in Computer and Information Science, vol 601. Springer, Cham. https://doi.org/10.1007/978-3-319-30843-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-30843-2_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30842-5
Online ISBN: 978-3-319-30843-2
eBook Packages: Computer ScienceComputer Science (R0)