Hostname: page-component-848d4c4894-sjtt6 Total loading time: 0 Render date: 2024-06-25T01:17:03.635Z Has data issue: false hasContentIssue false
  • English
  • Français

Study of a network of serial and non-serial servers with phase type service and finite queueing space

Published online by Cambridge University Press:  14 July 2016

Krishan Lall Arya
Krishan Lall Arya*
Affiliation:
The University, Kurukshetra, India
Get access Rights & Permissions [Opens in a new window]

Abstract

The paper develops the steady-state solution of a finite space queueing system wherein each of the two non-serial servers is separately in series with two non-serial servers. It is assumed that the arriving units of the same type may demand a different number of service phases. Poisson arrivals and exponential service times are assumed at all the four channels of the system. Service of units is completed on a first-come, first-served basis at each channel. The steady-state solution for infinite queueing space is obtained as a special case of finite queueing space.

Keywords

NETWORK OF SERIAL AND NON-SERIAL SERVERSPHASE TYPE SERVICEFINITE AND INFINITE QUEUEING SPACESSTEADY-STATE SOLUTION
Type
Short Communications
Information
Journal of Applied Probability , Volume 9 , Issue 1 , March 1972 , pp. 198 - 201
Copyright
Copyright © Applied Probability Trust 1972 

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.)

References

[1] Jackson, R. R. P. (1954) Queueing systems with phase type service. Operat. Res. Quart. 5, 109–120.Google Scholar
[2] O'Brien, G. G. (1954) The solution of some queueing systems. J. Soc. Ind. Appl. Math. 2, 133–142.Google Scholar
[3] Saaty, T. L. (1961) Elements of Queueing Theory. McGraw-Hill Book Company, New York.Google Scholar
[4] Lee, A. M. (1966) Applied Queueing Theory. Macmillan, London.Google Scholar