Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
| Hi-index | 0.00 |
In this paper, we study the end-to-end control through virtual circuits in a computer network built following the X.25 Recommendations. We develop a mathematical model to obtain the maximum overallocation of node buffers, in order for the probability of overflow not to exceed a given value.