M/G/: Background Poisson arrivals: rate 2 General service times, S; fs(s); E[S]=1/; Os Infinite queue capacity The system is NoT a continuous time Markov process(most of the time"it has memory") We can, however, identify certain instants of time (epochs")at which all we need to know is the number of customers in the system to determine the probability that at the next epoch there will be 0, 1, 2,m, n customers in the system Epochs= instants immediately following the completion of a serviceM/G/1: Background • Poisson arrivals; rate l • General service times, S; fS(s); E[S]=1/m; sS • Infinite queue capacity • The system is NOT a continuous time Markov process (most of the time “it has memory”) • We can, however, identify certain instants of time (“epochs”) at which all we need to know is the number of customers in the system to determine the probability that at the next epoch there will be 0, 1, 2, …, n customers in the system • Epochs = instants immediately following the completion of a service