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, 1990, Volume 26, Issue 4, Pages 83–98 (Mi ppi631)  

This article is cited in 5 scientific papers (total in 5 papers)

Communication Network Theory

Random Multiple Access in Binary Feedback Channel

B. S. Tsybakov, A. N. Beloyarov
Abstract: We consider random multiple access algorithms of packets to a channel with “empty-not empty” (E – NE) and “success-no success” (S – NS) binary feedback. Upper bounds on mean packet delays are determined for these algorithms.
Received: 12.09.1989
Bibliographic databases:
Document Type: Article
UDC: 621.394.74-503.5
Language: Russian
Citation: B. S. Tsybakov, A. N. Beloyarov, “Random Multiple Access in Binary Feedback Channel”, Probl. Peredachi Inf., 26:4 (1990), 83–98; Problems Inform. Transmission, 26:4 (1990), 354–366
Citation in format AMSBIB
\Bibitem{TsyBel90}
\by B.~S.~Tsybakov, A.~N.~Beloyarov
\paper Random Multiple Access in Binary Feedback Channel
\jour Probl. Peredachi Inf.
\yr 1990
\vol 26
\issue 4
\pages 83--98
\mathnet{http://mi.mathnet.ru/ppi631}
\zmath{https://zbmath.org/?q=an:0746.94014}
\transl
\jour Problems Inform. Transmission
\yr 1990
\vol 26
\issue 4
\pages 354--366
Linking options:
  • https://www.mathnet.ru/eng/ppi631
  • https://www.mathnet.ru/eng/ppi/v26/i4/p83
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:323
    Full-text PDF :120
    First page:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024