Paper Info
Title
Queueing performance of a tree type ATM network
Abstract
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. The authors 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
Year
DOI
Venue
1994
10.1109/INFCOM.1994.337633
Toronto, Ont.
Keywords
Field
DocType
B-ISDN,approximation theory,asynchronous transfer mode,probability,queueing theory,stochastic processes,telecommunication traffic,trees (mathematics),B-ISDN,approximation,arrival process,asymptotic rate,directed tree,discrete-time Gaussian process,infinite buffer queue,input statistics,loss probabilities,mean,output statistics,performance statistics,queueing network,queueing performance,simulations,traffic,tree type ATM network,variance
M/D/1 queue,Bulk queue,G/G/1 queue,M/M/c queue,Computer science,M/G/1 queue,M/G/k queue,M/D/c queue,Fork–join queue,Distributed computing
Conference
ISSN
Citations 
PageRank 
0743-166X
2
0.47
References 
Authors
5
2
Name
Order
Citations
PageRank
Ron Addie116821.39
Zukerman, M.2834.79