Worst-case traffic in a tree network of ATM multiplexers

J.M. Barcelo, J. Garcia-Vidal, O. Casals
2000 IEEE/ACM Transactions on Networking  
In this paper we study tree networks of discrete-time queues loaded with periodic traffic sources. By using the so-called Beneš method, exact closed-form expressions are obtained for the queue length distributions. The models developed can be used to study the superposition of periodic sources emitting bursts of cells in ATM networks. The results obtained show the significant effect that this kind of traffic can have on the performance of these systems.
doi:10.1109/90.865078 fatcat:7gawdlzkiraznghpbbbp543bge