We consider a system with N servers and messages arriving according to a Poisson process. The service time of a message is exponentially distributed. Two strategies to process the messages are compared. In the first strategy, an arriving message is sent randomly to one of the servers. In the second strategy, for each message two servers are selected randomly, and the message is directed to the least busy one. The queue length distribution is investigated as N tends to infinity.
E( M_{N}^{2}(t))£ 

, 
P 
æ ç ç è 

M_{N}(s) >a 
ö ÷ ÷ ø 
£ 

, 

(3) 
(u_{k,N}(s)) 

, NÎN 


E_{v}(f(U_{N}(t)))f(u_{v}(t))=0, 
This document was translated from L^{A}T_{E}X by H^{E}V^{E}A.