An iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput. The iterative procedure converges to the exact solution in the case of the closed 3-sibling fork/join queue.>
No takes yet. Share an insight, caveat, or question.
Liu et al. (1991) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: