TY - JOUR
T1 - Queueing performance of a tree type ATM network
AU - Addie, Ronald G.
AU - Zukerman, Moshe
PY - 1994
Y1 - 1994
N2 - A queueing network structured as a directed tree, where only transmissions towards its head are allowed, is considered. Input to each queue is assumed to follow a discrete-time Gaussian process. To compute loss probabilities, each queue is considered independently and its input statistics are derived by approximating output statistics of its immediate sources. Performance statistics of a single Gaussian queue can be accurately approximated as a function of three parameters: the mean and variance of the arrival process, and a parameter related to the asymptotic rate of the long term variance. Of these three parameters only the variance changes when the traffic is filtered through an infinite buffer queue. In this paper we derive an approximation of the variance of the output process. Comparisons with simulations show that the approximation is accurate. Having the parameters of the output process, the single queue analysis is extended to a tree type network of queues. A small example of a network of three queues is simulated and the performance results are found to be close to results obtained analytically.
AB - A queueing network structured as a directed tree, where only transmissions towards its head are allowed, is considered. Input to each queue is assumed to follow a discrete-time Gaussian process. To compute loss probabilities, each queue is considered independently and its input statistics are derived by approximating output statistics of its immediate sources. Performance statistics of a single Gaussian queue can be accurately approximated as a function of three parameters: the mean and variance of the arrival process, and a parameter related to the asymptotic rate of the long term variance. Of these three parameters only the variance changes when the traffic is filtered through an infinite buffer queue. In this paper we derive an approximation of the variance of the output process. Comparisons with simulations show that the approximation is accurate. Having the parameters of the output process, the single queue analysis is extended to a tree type network of queues. A small example of a network of three queues is simulated and the performance results are found to be close to results obtained analytically.
UR - http://www.scopus.com/inward/record.url?scp=0028563768&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0028563768&origin=recordpage
U2 - 10.1109/INFCOM.1994.337633
DO - 10.1109/INFCOM.1994.337633
M3 - RGC 22 - Publication in policy or professional journal
VL - 1
SP - 48
EP - 55
JO - Proceedings - IEEE INFOCOM
JF - Proceedings - IEEE INFOCOM
SN - 0743-166X
T2 - Proceedings of the IEEE INFOCOM'94. Part 2 (of 3)
Y2 - 12 June 1994 through 16 June 1994
ER -