The authors investigate a system with N servers and with N sources connected with the servers. A sources can be in state «on» or «off». In state «on» the source generates the Poisson flow of packets of rate $\lb$. The service time of a packet is distributed exponentially with mean one. Upon its arrival a packet is directed to the server with the shortest queues of the following two servers: the server where the packet has been generated and another randomly selected server. The queue length probability as N \to \infty$ is investigated.