An M-M-1 queue has Poisson process arrivals of rate , independent exponential service times of rate , and one server. The two letters indicate the memoryless property of the interarrival and service-time distributions. Its queue length is a birth-death process with birth rate and death rate away from zero. When , its normalized stationary distribution isthe powers quoted in the question form the corresponding unnormalized invariant measure.
Let be the number of visits to the server made by one customer. Then has the geometric distribution with success parameter , and its service periods are independent exponential random variables of rate . For , the Laplace transform of the total service time isThus
At each service completion, a successful departure reduces the queue length by one and occurs at rate while the queue is nonempty; feedback completions leave its length unchanged. The queue-length process is therefore the birth-death process of an ordinary queue with service rate . It is positive recurrent exactly when , and then, with ,
The Poisson output theorem for a feedback queue, equivalently the Burke theorem applied to the effective queue-length process with service rate , shows that successful departures in equilibrium form a Poisson process of rate .
The process of all entries into the queue is different. Its long-run rate isImmediately after any queue-entry event the server is busy, so the conditional probability of another entry in the next interval of length isthe next entry can be external or can be a service completion followed by feedback. A Poisson process of the displayed long-run rate would instead give . These coefficients are unequal when , sinceHence the combined arrival process is not Poissonian.
Articles by others on the same topic
There are currently no matching articles.