Skip to main content
Log in

Analysis of a Communication Network Governed by an Adaptive Random Multiple Access Protocol in Critical Load

  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. 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].

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Khomichkov, I.I., Retrial Queues and Loss Probability for Double Connectives, Dokl. Nats. Akad. Nauk Belarusi, 1998, vol. 42, no. 2, pp. 36–39.

    Google Scholar 

  4. 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].

    Google Scholar 

  5. 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].

    Google Scholar 

  6. 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.

    Google Scholar 

  7. 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.

  8. Kuznetsov, D.Yu. and Nazarov, A.A., Adaptivnye seti sluchainogo dostupa (Adaptive Random Access Networks), Tomsk: Del'taplan, 2002.

    Google Scholar 

  9. Falin, G.I. and Temppleton, J.G.C., Retrial Queues, London: Chapman & Hall, 1997.

    Google Scholar 

  10. Nazarov, A.A., Asimptoticheskii analiz markoviziruemykh sistem (Asymptotic Analysis of Markovizable Systems), Tomsk: Tomsk. Gos. Univ., 1991.

    Google Scholar 

  11. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:PRIT.0000044260.05898.24

Keywords

Navigation