Abstract

This article presents the results of numerical experiments to solve the problem of optimal placement of information resources on the nodes of a distributed information processing system (DIPS) by the criterion of the minimum average response time of the system to user requests, implemented on the basis of the architecture "file-server", two-level and three-level architecture "client-server" with self-similar input traffic applications. Approximate methods of stochastic Queuing networks research (decomposition approximation method and mean value analysis method) and simulation method were used as modeling methods. The obtained results of numerical experiments are compared with the results of solving the same problems using the exact method of analysis of exponential Queuing networks. By results of the comparative analysis of the received results conclusions are drawn.

Full Text
Paper version not known

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 call

Disclaimer: 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.