System with losses and pooling of servers (Q1280901)

The authors consider a queueing system with input consisting of \(m\) arrival streams; arrival and service rates depend on the stream (one stream-\(k\) customer simultaneously requires \(n_k\) servers). A stream-\(k\) customer is lost if he does not find the required number of servers. The authors obtain the stationary system size probabilities. Earlier \textit{E. A. van Doorn} and \textit{F. J. M. Panken} [IEEE/ACM Trans. Network., 664-666 (1993)] had obtained these probabilities for a batch arrival system.