scientific article; zbMATH DE number 4046839

From MaRDI portal
Publication:3784952





[For the entire collection see Zbl 0636.00014.] This paper presents an efficient direct method for the solution of a queueing network consisting of two Coxian servers. The structure of the transition rate matrix associated with this network is examined in some detail, and it is shown how advantage may be taken of this structure to derive the required stationary probability vector in a number of operations which is proportional to N, the number of customers in the network. The direct method which is employed, is based on a single step of inverse iteration. The method is shown to be stable.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784952)