Hostname: page-component-76c49bb84f-hwk5l Total loading time: 0 Render date: 2025-07-05T22:02:16.289Z Has data issue: false hasContentIssue false

On a certain type of network of queues

Published online by Cambridge University Press:  14 July 2016

K. C. Madan*
Affiliation:
National Council of Educational Research and Training, New Delhi

Abstract

The paper studies a network of queues in which units arrive singly in a Poisson stream at a service channel S from which they branch out into k parallel channels S1, S2, …, Sk. After having been serviced at S1, S2, … Sk, the units converge again into a single channel S′. The service times of units at each of the channels are assumed to be exponential. Units finally serviced at S’ may leave the system or may again join S. This has been considered by taking two models denoted as Model A and Model B. Steady-state probabilities giving the number of units present in the system have been obtained explicitly for both the models. The expressions for mean queue lengths have also been arrived at.

Information

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1975 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1] O'brien, G. G. (1954) The solution of some queueing problems. J. Soc. Indust Appl. Math. 2, 133142.CrossRefGoogle Scholar
[2] Jackson, R. R. P. (1954) Queueing systems with phase type service. Operat. Res. Quart. 5, 109120.Google Scholar
[3] Jackson, R. R. P. (1956) Queueing processes with phase type service. J. R. Statist . Soc. B 18, 129132.Google Scholar
[4] Saaty, T. L. (1961) Elements of Queueing Theory. McGraw-Hill, New York.Google Scholar