Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2007, Volume 43, Issue 4, Pages 83–92 (Mi ppi29)  
This article is cited in 6 scientific papers (total in 6 papers)

Communication Network Theory

Interrelation of Characteristics of Blocked Random Multiple Access Stack Algorithms

G. S. Evseev, A. M. Tyurlikov

Saint-Petersburg State University of Aerospace Instrumentation
Full-text PDF (1168 kB) Citations (6)
References:
PDF
HTML
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.
Received: 25.04.2007
English version:
Problems of Information Transmission, 2007, Volume 43, Issue 4, Pages 344–352
DOI: https://doi.org/10.1134/S0032946007040072
Bibliographic databases:
Document Type: Article
UDC: 621.39:004.7
Language: Russian
Citation: G. S. Evseev, A. M. Tyurlikov, “Interrelation of Characteristics of Blocked Random Multiple Access Stack Algorithms”, Probl. Peredachi Inf., 43:4 (2007), 83–92; Problems Inform. Transmission, 43:4 (2007), 344–352
Citation in format AMSBIB
\Bibitem{EvsTyu07}
\by G.~S.~Evseev, A.~M.~Tyurlikov
\paper Interrelation of Characteristics of Blocked Random
Multiple Access Stack Algorithms
\jour Probl. Peredachi Inf.
\yr 2007
\vol 43
\issue 4
\pages 83--92
\mathnet{http://mi.mathnet.ru/ppi29}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2406146}
\zmath{https://zbmath.org/?q=an:1142.94300}
\transl
\jour Problems Inform. Transmission
\yr 2007
\vol 43
\issue 4
\pages 344--352
\crossref{https://doi.org/10.1134/S0032946007040072}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000255782900007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-45349105974}
Linking options:
  • https://www.mathnet.ru/eng/ppi29
  • https://www.mathnet.ru/eng/ppi/v43/i4/p83
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024