Skip to main content
SpringerLink
Log in

Interrelation of characteristics of blocked RMA stack algorithms

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

Abstract

A method to analyze the duration of collision resolution for blocked RMA stack algorithms is proposed. Simple formulas are obtained that express the average length of a collision resolution interval for the modified (frugal) algorithm in a noisy and in a noiseless channel, as well as for the basic algorithm in a noisy channel, through the corresponding parameters for the basic algorithm in a noiseless channel. From estimates of the throughput of the basic algorithm in a noiseless channel, estimates for the throughput in the other three cases are directly constructed.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Tsybakov, B.S. and Mikhailov, V.A., Free Synchronous Packet Access in a Broadcast Channel with Feedback, Probl. Peredachi Inf., 1978, vol. 14, no. 4, pp. 32–59 [Probl. Inf. Trans. (Engl. Transl.), 1978, vol. 14, no. 4, pp. 259–280].

    MATH  MathSciNet  Google Scholar 

  2. Capetanakis, J.I., Tree Algorithms for Packet Broadcast Channels, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 5, pp. 505–515.

    Article  MATH  MathSciNet  Google Scholar 

  3. Tsybakov, B.S., Survey of USSR Contributions to Random Multiple-Access Communications, IEEE Trans. Inform. Theory, 1985, vol. 31, no. 2, pp. 143–165.

    Article  MATH  MathSciNet  Google Scholar 

  4. Györfi, L., Györi, S., and Massey, J.L., Principles of Stability Analysis for Random Accessing with Feedback, Multiple Access Channels: Theory and Practice, Biglieri, E. and Györfi, L., Eds., Amsterdam: IOS Press, 2007, pp. 214–249.

    Google Scholar 

  5. Evseev, G.S. and Ermolaev, N.G., Performance Evaluation of the Collision Resolution for a Random-Access Noisy Channel, Probl. Peredachi Inf., 1982, vol. 18, no. 2, pp. 101–105.

    MATH  Google Scholar 

  6. Evseev, G.S. and Turlikov, A.M., Throughput Analysis for a Noise-Resistant Multiple Access Algorithm, Probl. Peredachi Inf., 1986, vol. 22, no. 2, pp. 104–109.

    MATH  Google Scholar 

  7. Evseev, G. and Turlikov, A., The Multiple-Random-Access Algorithms Analysis Based on Tree Properties, in Proc. 5th Joint Soviet-Swedish Int. Workshop on Information Theory, Moscow, 1991.

  8. Janssen, A.J.E.M. and de Jong, M.J.M., Analysis of Contention Tree Algorithms, IEEE Trans. Inform. Theory, 2000, vol. 46, no. 6, pp. 2163–2172.

    Article  MATH  Google Scholar 

  9. Györfi, L. and Györi, S., Analysis of Tree Algorithm for Collision Resolution, in Proc. 2005 Int. Conf. on Analysis of Algorithms, Barcelona, Nancy: Assoc. Discrete Math. Theor. Comput. Sci., 2005, pp. 357–364.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St. Petersburg State University of Aerospace Instrumentation, Russia

    G. S. Evseev & A. M. Turlikov

Authors
  1. G. S. Evseev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. M. Turlikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. S. Evseev.

Additional information

Original Russian Text © G.S. Evseev, A.M. Turlikov, 2007, published in Problemy Peredachi Informatsii, 2007, Vol. 43, No. 4, pp. 83–92.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Evseev, G.S., Turlikov, A.M. Interrelation of characteristics of blocked RMA stack algorithms. Probl Inf Transm 43, 344–352 (2007). https://doi.org/10.1134/S0032946007040072

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946007040072

Keywords

Search

Navigation