An analysis of a class of telecommunications models
Performance Evaluation - Special issue: discrete-time models and analysis methods
A transient discrete-time queueing analysis of the ATM multiplexer
Performance Evaluation
An Introduction to ATM Networks
An Introduction to ATM Networks
Discrete Time Analysis of a State Dependent Tandem with Different Customer Types
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Approximation models of feed-forward G/G/1/N queueing networks with correlated arrivals
Performance Evaluation
Queueing analysis of ATM tandem queues with correlated arrivals
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
A performance analysis of a discrete-time priority queueing system with correlated arrivals
Performance Evaluation
Gaussian tandem queues with an application to dimensioning of switch fabric interfaces
Computer Networks: The International Journal of Computer and Telecommunications Networking
The BMAP/G/1--·/PH/1/M tandem queue with feedback and losses
Performance Evaluation
An approximate compositional approach to the analysis of fluid queue networks
Performance Evaluation
Tandem Queue Models with Applications to QoS Routing in Multihop Wireless Networks
IEEE Transactions on Mobile Computing
Analysis of interdeparture processes for bursty traffic in ATM networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We present an exact performance analysis of tandem networks with an arbitrary number of multiplexers. Each multiplexer is fed by the output of its upstream neighbor as well as the traffic generated by a number of independent binary Markovian sources. We model the tandem network as a discrete-time queueing system. After determining the unknown boundary functions, the probability generating function (PGF) of the joint distribution of queue length and number of On sources for each multiplexer is derived as a function of the transform of the busy period of its upstream neighbor. From this PGF, we determine closed form expressions for the mean and variance of queue length, as well as the mean packet delay. The solution has also been extended to tandem networks in which each multiplexer is fed by multiple types of traffic. Then, numerical results are presented and it has been shown that the multiplexing smooths the traffic. The mean queue lengths are very easy to calculate and the computation complexity does not increase with the number of sources in the network.