The Community for Technology Leaders
RSS Icon
Issue No.05 - September (1979 vol.5)
pp: 530-538
R.A. Marie , Institut de Recherche en Informatique et Syst?mes Al?atoires, I.N.S.A.
In this paper, we present an approximate solution for the asymptotic behavior of relatively general queueing networks. In the particular case of networks with general service time distributions (i.e., fixed routing matrix, one or many servers per station, FIFO discipline), the application of the method gives relatively accurate results in a very short time. The approximate stationary state probabilities are identified with the solution of a nonlinear system. The proposed method is applicable to a larger class of queueing networks (dependent routing matrix, stations with fimite capacity, etc.). In this case, the structure of the network studied must satisfy certain decomposability conditions.
service time distribution, Approximate solution, equilibrium distribution, performance evaluation, queueing networks, queueing theory
R.A. Marie, "An Approximate Analytical Method for General Queueing Networks", IEEE Transactions on Software Engineering, vol.5, no. 5, pp. 530-538, September 1979, doi:10.1109/TSE.1979.234214
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool