DocumentCode
1238981
Title
Buffer Behavior for Binomial Input and Constant Service
Author
Fredrikson, Gunnar F W
Author_Institution
Norwegian Telecommunications Admn.,Kjeller,Norway
Volume
22
Issue
11
fYear
1974
fDate
11/1/1974 12:00:00 AM
Firstpage
1862
Lastpage
1866
Abstract
An analysis of the discrete-time queuing problem: binomial input, constant message length, infinite queue length, one server, is carried out. The state probabilities are calculated using the method of imbedded Markov chains, and the results are applied to the problem of determining characteristic features in the performance of a traffic concentrator. The results are compared to the direct numerical solution of the equations of state for a finite buffer queue concentrator.
Keywords
Buffered communications; Queued communications; Communication standards; Data communication; Maximum likelihood estimation; Phase estimation; Probability; Queueing analysis; Signal detection; Traffic control; Upper bound; Viterbi algorithm;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOM.1974.1092137
Filename
1092137
Link To Document