Discrete Time Stochastic Networks


In this section we study the relation between throughput and queue-length distributions in discrete-time closed cyclic networks when the number of customers and the number of nodes grows unboundedly. To state our findings more precisely: For each positive integer N , consider a cyclic network with n(N) nodes and k(N) customers. We suppose that there are… (More)


Cite this paper

@inproceedings{Daduna2008DiscreteTS, title={Discrete Time Stochastic Networks}, author={Hans Daduna}, year={2008} }