A queueing system holds N packets, including the one(s) in service. The service rate is statedependent, with μn = nμ, 1 ≤ n ≤ N . Arrivals are Poisson, with average rate λ.
A queueing system holds N packets, including the one(s) in service. The service rate is statedependent, with μn = nμ, 1 ≤ n ≤ N . Arrivals are Poisson, with average rate λ.
Leave a Reply