A discrete model of a large polling system
Matematičeskie zametki, Tome 79 (2006) no. 4, pp. 597-600
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
For a network with Poisson incoming flow of customers (particles) and unit time of the motion of servers (annihilators), we obtain the limit distribution of the number of customers at the node for a fixed general number of nodes.
[1] Borovkov A. A., Veroyatnostnye protsessy v teorii massovogo obsluzhivaniya, Nauka, M., 1972
[2] Afanaseva L. G., Bulinskaya E. V., Sluchainye protsessy v teorii massovogo obsluzhivaniya i upravleniya zapasami, Izd-vo MGU, M., 1980