Analysis of Parallel Queueing Network with Mutual Expectations

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.