Abstract
A synchronous conflict model for a group of K>1 stations is designed and used in evaluating the stability of the capacity of the random multiple access method with increasing number of stations and the station individual speed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Khomichkov, I.I., A Model of Local Area Networks with Random Multiple Access, Avtom.Vychisl.Tekh., 1987, no. 1, pp. 58–62.
Khomichkov, I.I., Models of a Local Area Network with 1–Persistent Protocol CSMA/CD, Avtom.Telemekh., 1993, no. 12, pp. 89–100.
Khomichkov, I.I., Characteristics of a Local Area Network with p-Persistent Random Multiple Access Protocol: A Computation Procedure, Avtom.Telemekh., 1995, no. 2, pp. 67–80.
Chugreev, O.S. and Shmelev, V.V., Optimization of the Random Multiple Access Protocol for a Local Area Network, Avtom.Vychisl.Tekh., 1991, no. 2, pp. 40–47.
Bertsekas, D. and Gallager, R., Data Networks, Englewood Cliffs: Prentice Hall, 1987. Translated under the title Seti peredachi dannykh, Moscow: Mir, 1989.
Shcherbo, V.K., Kiretschev, V.M., and Samoilenko, S.I., Standarty po lokal'nym vychislitel'nym setyam: Spravochnik (A Handbook on Local Computing Network Standards), Moscow: Radio i Svyaz, 1990.
Prudnikov, A.P. Brychkov, Yu.A., and Marichev, O.I., Integraly i ryagy (Integrals and Series), Moscow: Nauka, 1981.
Gradshtein, I.S. and Ryzhik, I.M., Tablitsy integralov, summ, ryadov i proizvedenii (Tables of Integrals, Sums, Series, and Products), Moscow: Nauka, 1971.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kustov, N.T., Sushchenko, S.P. Capacity of the Random Multiple Access Method. Automation and Remote Control 62, 76–85 (2001). https://doi.org/10.1023/A:1002831917990
Issue Date:
DOI: https://doi.org/10.1023/A:1002831917990