队列理论queuetheory,小弟在此跪拜!Inacertainshop,thereisonlyonecashier(i.e.server).Thecustomerarrivewithintensityaandareservedwiththeintensityb.Findtheprobabilitythatthequeue(notincludingthecustomerbeingserved

Question

队列理论queue theory,小弟在此跪拜!
In a certain shop,there is only one cashier (i.e.server).The customer arrive with intensity a and are served with the intensity b.Find the probability that the queue (not including the customer being served) consists of two customers or more.
以下为翻译：
在一定的店,只有一个收银员（即服务）.顾客到达强度A和供应的强度b.求由两个或更多的客户组成的队列（不包括被服务的顾客）的概率.

Answer 1

lam=A-b;
P(X>=2)=1-P(X=0)-P(X=1)=1-e^(A-b)-(A-b)*e^(A-b);
just for one choice of referrence