### RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networksRECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks

Access Restriction
Subscribed

 Author Conway, A. E. ♦ Georganas, N. D. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1986 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract RECAL, a $\textit{Re}cursion$ by $\textit{C}hain$ $\textit{Al}gorithm$ for computing the mean performance measures of product-form multiple-chain closed queuing networks, is presented. It is based on a new recursive expression that relates the normalization constant of a network with $\textit{r}$ closed routing chains to those of a set of networks having $(\textit{r}$ - 1) chains. It relies on the artifice of breaking down each chain into constituent subchains that each have a population of one. The time and space requirements of the algorithm are shown to be polynomial in the number of chains. When the network contains many routing chains, the proposed algorithm is substantially more efficient than the convolution or mean value analysis algorithms. The algorithm, therefore, extends the range of queuing networks that can be analyzed efficiently by exact means. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1986-08-10 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 33 Issue Number 4 Page Count 24 Starting Page 768 Ending Page 791

#### Open content in new tab

Source: ACM Digital Library