Abstract
The accuracy of approximation of the vector of queue lengths for an open Jackson network with regenerative input flow and unreliable servers is estimated. A theorem on the accuracy of approximation of the vector of queue lengths in open Jackson networks is put forward, i.e., an estimate for the probability of deviations of the norm of the difference between the process of queue lengths and the constructed reflected Brownian motion is obtained. As a corollary, an estimate of the Wasserstein distance is given.
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.
