Abstract
problem of choosing optimal parameters for dynamic priorities in the case of the various types of service requests with linearly decreasing function of priorities, performed experiments and obtained results. These results can be used to develop algorithms of functioning nodes for data and their software. In this paper we propose a method for solving the problem of choosing the optimal values of these coefficients that minimize the total value of the queue length in systems with four types of applications.
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.
