A Single Queue with Mutually Replacing m Servers

Kailash C. Madan

Abstract


Customers arriving in a Poisson stream are served one by one exponentially by one of the m servers S 1, S 2, S 3, . . . , S m. A
server who has just completed a service either continues the next service or is replaced by another server. The replacement
of a server at each service completion is governed by a probabilistic criterion of availability of servers. Transient solutions
in terms of Laplace transforms of the probability generating functions are obtained and among some special cases the
earlier known results for the case of 2 servers are deduced. The steady state solutions and the average queue sizes have
been obtained for some particular cases.

Full Text: PDF DOI: 10.5539/jmr.v3n1p3

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.