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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
