DocumentCode :
933032
Title :
Bounds on the performance of protocols for a multiple-access broadcast channel
Author :
Pippenger, Nicholas
Volume :
27
Issue :
2
fYear :
1981
fDate :
3/1/1981 12:00:00 AM
Firstpage :
145
Lastpage :
151
Abstract :
A general model is presented for synchronous protocols that resolve conflicts among message transmissions to a multiple-access broadcast channel. An information-theoretic method is used now to show that if only finitely many types of conflicts can be distinguished by the protocol, utilization of the channel at rates approaching capacity is impossible. A random-coding argument is used to show that if the number of conflicting transmissions can be determined (which requires distinguishing infinitely many types of conflicts) then utilization of the channel at rates arbitrarily close to capacity can be achieved.
Keywords :
Broadcast channels; Computer communication protocols; Computer software performance evaluation; Multiple-access communications; Broadcasting; Poisson equations; Protocols; Throughput;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1981.1056332
Filename :
1056332
Link To Document :
بازگشت