Abstract:
The channel throughput for a finite number of packet broadcasting users is analyzed for random access protocols, including slotted persistent carrier sense multiple acces...Show MoreMetadata
Abstract:
The channel throughput for a finite number of packet broadcasting users is analyzed for random access protocols, including slotted persistent carrier sense multiple access (CSMA) with and without collision detection and unslotted persistent CSMA with and without collision detection. We consider bothp- and 1-persistent CSMA. Our results can be extended to infinite population cases (by taking the proper limit), where they agree with the known throughput expressions when available.
Published in: IEEE Transactions on Communications ( Volume: 33, Issue: 7, July 1985)
References is not available for this document.
Select All
1.
E. Arthurs and B. W. Stuck, "A theoretical performance analysis of polling and carrier sense collision detection communication systems" in Local Computer Networks, New York:North-Holland, 1982.
2.
M. Gerla and L. Kleinrock, "Flow control: A comparative survey", IEEE Trans. Commun., vol. COM-28, pp. 553-574, Apr. 1980.
3.
D. P. Heyman and M. J. Sobel, Stochastic Models in Operations Research Vol. I: Stochastic Processes and Operating Characteristics, New York:McGraw-Hill, 1982.
4.
R. E. Kahn, S. A. Gronemeyer, J. Burchfiel and R. C. Kunzelman, "Advances in packet radio technology", Proc. IEEE, vol. 66, pp. 1468-1496, Nov. 1978.
5.
L. Kleinrock, Queueing Systems Vol. I: Theory, New York:Wiley, 1975.
6.
L. Kleinrock and F. A. Tobagi, "Packet switching in radio channels: Part I—Carrier sense multiple-access modes and their throughput-delay characteristics", IEEE Trans. Commun., vol. COM-23, pp. 1400-1416, Dec. 1975.
7.
F. A. Tobagi and V. B. Hunt, "Performance analysis of carrier sense multiple access with collision detection", Comput. Networks, vol. 4, pp. 245-259, Oct.-Nov. 1980.
