DocumentCode :
758734
Title :
Iterative Computation of the M/G/1 Queue Length Distribution via the Discrete Fourier Transform
Author :
Ackroyd, Martin H.
Author_Institution :
Aston Univ., Birmingham, England
Volume :
28
Issue :
11
fYear :
1980
fDate :
11/1/1980 12:00:00 AM
Firstpage :
1929
Lastpage :
1932
Abstract :
An iterative method is presented by which the distribution of queue lengths in the 
queue may be computed. The method applies to the nonsteady-state case and involves repeatedly performing convolutions. The steady-state solution may be obtained by performing the iterations until convergence occurs. A frequencydomain equivalent of the method is presented which gives much greater computational economy.
queue may be computed. The method applies to the nonsteady-state case and involves repeatedly performing convolutions. The steady-state solution may be obtained by performing the iterations until convergence occurs. A frequencydomain equivalent of the method is presented which gives much greater computational economy.Keywords :
DFT; Discrete Fourier transforms (DFT´s); Queued communications; Discrete Fourier transforms; Distributed computing; Encoding; Entropy coding; Geometry; Iterative methods; Notice of Violation; Quantization; Rate distortion theory; Robustness;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1980.1094612
Filename :
1094612
Link To Document :
