Abstract
In this paper, one type of parallel queuing networks is analyzed. The main feature of the considered networks is a mutual expectation of servicing devices (SDs). Due to this mutual expectation SDs do not take the next request from a queue until all the neighboring SDs haven't completed servicing of their requests. Thus, a work with requests in such networks is synchronized. For the type of described networks a method for finding an upper bound for an average delay is given. An efficiency of the above mentioned estimation is analyzed by comparison with simulation results for a test scenario.
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.
