Re: Queued systems with *balking*

When each customer in queue balks with probability b*h+o(h) in every
(short) time interval of length h, then when n are in queue, the
balking rate in n*b, which satisfies your requirement. This is the
easiest balking scheme to analyze.

BTW, (4) above should be Poisson arrivals or exponential inter-arrival
times.

Dan Heyman

.