This article discusses the steady analysis of a discrete time queue of Geo/Geo+G/2 type. All arriving customers are served either by server-1 according to a geometrically distributed service time S1=k slots for k=1,2, … ∞ , with mass function f1(k)==Pr(S1=k) = μ(1- μ) k-1 with mean rate 0<μ<1 or by server-2 with a general service time S2= k for k=1,2, … ∞ , with mass function f2(k)==Pr(S2=k) with mean service time is β= 2 1 () k kf k ∞ = ∑ or mean service rate μ2=1/β. Sequel to some objections raised on the use of the classical 'First Come First Served (FCFS)' queue discipline when the two heterogeneous servers operate as parallel service providers, an alternative queue discipline in a serial configuration of servers are considered in this work; the objective is that if, in a singlechannel queue in equilibrium, the service rate suddenly increases and exceeds the present service capacity, install a new channel to work serially with the first channel as suggested by Krishnamoorthy (1968). Using the embedded method subject to different service time distributions we present an exact analysis for finding the ‘Probability generating Function (PGF)’ of steady state number of customers in the system and most importantly, the actual waiting time expectation of customers in the system. This work shows that one can obtain all stationery probabilities and other vital measures for this queue under certain additional and simple but realistic assumptions

Projects

Currently no objects available

Currently no objects available