AN APPROXIMATE SOLUTION FOR COMPUTER-NETWORKS WITH SEMAPHORES

An exact solution for a computer network with semaphores is typically not accessible with reasonable computation effort since it is non-separable. This paper proposes an algorithm to find an approximate solution of such a network. The basic idea is to replace a semaphore with an IP center. The approximate semaphore holding time and delay can then be obtained iteratively by using the mean value analysis to solve the equivalent network. Analytical results are compared with simulation results. © 1990.