Consider an M/G/1 queuing system with arrival rate and independent and identically distributed successive service times having probability density function g(x) = xe⁻ˣ if x > 0, and 0 otherwise. Define, for if the first transition is from i to i − 1, and if the first transition from i is i + 1. Then, equals
Single choice · Limit Theorems and Markov Chains