The stability of infinite-server networks with random routing
暂无分享,去创建一个
We consider networks with a very large or infinite number of nodes, linked by cable channels. The request which comes to a node is ordered to occupy a certain route of successive channels. The functioning of the system is regulated by the reserving of channels in order of the arrivals of the requests. Under some general conditions the existence of an ergodic region for such networks is proved. The practical value of the result lies in the fact that these conditions do not depend on the size of the graph.
[1] V. Schmidt,et al. Queues and Point Processes , 1983 .
[2] F. Kelly. Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.
[3] P. Franken,et al. Queues and Point Processes , 1983 .
[4] Aleksandr Alekseevich Borovkov,et al. Stochastic processes in queueing theory , 1976 .