(a) Let Sk be the sum of k independent exponential random variables of rate kμ. Compute the moment generating function ϕSk(θ)=EeθSk of Sk. Show that, as k→∞, functions ϕSk(θ) converge to a limit. Describe the random variable S for which the limiting function limk→∞ϕSk(θ) coincides with EeθS.
(b) Define the M/G/1 queue with infinite capacity (sometimes written M/G/1/∞ ). Introduce the embedded discrete-time Markov chain (Xn) and write down the recursive relation between Xn and Xn−1.
Consider, for each fixed k and for 0<λ<μ, an M/G/1/∞ queue with arrival rate λ and with service times distributed as Sk. Assume that the queue is empty at time 0 . Let Tk be the earliest time at which a customer departs leaving the queue empty. Let A be the first arrival time and Bk=Tk−A the length of the busy period.
(c) Prove that the moment generating functions ϕBk(θ)=EeθBk and ϕSk(θ) are related by the equation
ϕBk(θ)=ϕSk(θ−λ(1−ϕBk(θ)))
(d) Prove that the moment generating functions ϕTk(θ)=EeθTk and ϕSk(θ) are related by the equation
λλ−θϕTk(θ)=ϕSk((λ−θ)(ϕTk(θ)−1))
(e) Assume that, for all θ<λ,
k→∞limϕBk(θ)=EeθB,k→∞limϕTk(θ)=EeθT,
for some random variables B and T. Calculate EB and ET. What service time distribution do these values correspond to?