Abstract
A mathematical model of an adaptive random multiple access communication network is investigated. The value of the network critical load is found; in the critical load, asymptotic probability distributions for states of the information transmission channel and for the number of requests in the source of repeated calls are found. It is proved that distributions of the normalized number of requests belong to the class of normal and exponential distributions, and it is shown how conditional normal distributions pass in the limit to the class of exponential ones.
Similar content being viewed by others
REFERENCES
Nazarov, A.A. and Shokhor, S.L., Study of Controlled Asynchronous Multiple Access in Satellite Communication Networks with Con ict Warning, Probl. Peredachi Inf., 2000, vol. 36, no. 1, pp. 77–89 [Probl. Inf. Trans. (Engl. Transl.), 2000, vol. 36, no. 1, pp. 71-84].
Nazarov, A.A. and Odyshev, Yu.D., Analysis of a Dynamic Strategy Slotted Aloha Network in the Case of Heavy Traffic Load, Avtomat. Vych. Tekhn., 2001, vol. 35, no. 1, pp. 77–84.
Khomichkov, I.I., Retrial Queues and Loss Probability for Double Connectives, Dokl. Nats. Akad. Nauk Belarusi, 1998, vol. 42, no. 2, pp. 36–39.
Tsybakov, B.S. and Mikhailov, V.A., Random Multiple Packet Access: Part-and-Try Algorithm, Probl. Peredachi Inf., 1980, vol. 16, no. 4, pp. 65–79 [Probl. Inf. Trans. (Engl. Transl.), 1980, vol. 16, no. 4, pp. 305-317].
Mikhailov, V.A., Geometrical Analysis of the Stability of Markov Chains in R n+ and Its Application to Throughput Evaluation of the Adaptive Random Multiple Access Algorithm, Probl. Peredachi Inf., 1988, vol. 24, no. 1, pp. 61–73 [Probl. Inf. Trans. (Engl. Transl.), 1988, vol. 24, no. 1, pp. 47-56].
Kuznetsov, D.Yu. and Nazarov, A.A., Investigation of Communication Networks with Finitely Many Stations Governed by Adaptive Random Multiple Access Protocols in Overload, Avtomat. Telemekh., 1999, vol. 60, no. 12, pp. 99–113.
Kuznetsov, D.Yu. and Nazarov, A.A., Investigation of Communication Networks Based on Adaptive Random Multiple Access Protocols under Conditions of Heavy Load and for Unlimited Number of Stations, Avtomat. Vych. Tekhn., 2003, no. 3, pp. 55–64.
Kuznetsov, D.Yu. and Nazarov, A.A., Adaptivnye seti sluchainogo dostupa (Adaptive Random Access Networks), Tomsk: Del'taplan, 2002.
Falin, G.I. and Temppleton, J.G.C., Retrial Queues, London: Chapman & Hall, 1997.
Nazarov, A.A., Asimptoticheskii analiz markoviziruemykh sistem (Asymptotic Analysis of Markovizable Systems), Tomsk: Tomsk. Gos. Univ., 1991.
König, D. and Stoyan, D., Methoden der Bedienungstheorie, Berlin: Akademie, 1976. Translated under the title Metody teorii massovogo obsluzhivaniya, Moscow: Radio i Svyaz', 1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kuznetsov, D.Y., Nazarov, A.A. Analysis of a Communication Network Governed by an Adaptive Random Multiple Access Protocol in Critical Load. Problems of Information Transmission 40, 243–253 (2004). https://doi.org/10.1023/B:PRIT.0000044260.05898.24
Issue Date:
DOI: https://doi.org/10.1023/B:PRIT.0000044260.05898.24