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, 2010, Volume 46, Issue 2, Pages 91–109 (Mi ppi2017)  
This article is cited in 3 scientific papers (total in 3 papers)

Communication Network Theory

On ergodic algorithms in random multiple access systems with “success-failure” feedback

A. M. Turlikova, S. G. Fossbc

a Saint-Petersburg State University of Aerospace Instrumentation
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
c Heriot Watt University, Edinburgh, United Kingdom
Full-text PDF (376 kB) Citations (3)
References:
PDF
HTML
Abstract: We consider a decentralized multiple access system with a binary “success-failure” feedback. We introduce a family of algorithms (protocols) called “algorithms with delayed intervals” and study stability conditions of one of them. Then we discuss some numerical results and a number of related and interesting problems and hypotheses.
Received: 27.08.2009
Revised: 15.02.2010
English version:
Problems of Information Transmission, 2010, Volume 46, Issue 2, Pages 184–200
DOI: https://doi.org/10.1134/S0032946010020067
Bibliographic databases:
Document Type: Article
UDC: 621.394.74+519.7
Language: Russian
Citation: A. M. Turlikov, S. G. Foss, “On ergodic algorithms in random multiple access systems with “success-failure” feedback”, Probl. Peredachi Inf., 46:2 (2010), 91–109; Problems Inform. Transmission, 46:2 (2010), 184–200
Citation in format AMSBIB
\Bibitem{TyuFos10}
\by A.~M.~Turlikov, S.~G.~Foss
\paper On ergodic algorithms in random multiple access systems with ``success-failure'' feedback
\jour Probl. Peredachi Inf.
\yr 2010
\vol 46
\issue 2
\pages 91--109
\mathnet{http://mi.mathnet.ru/ppi2017}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2724798}
\transl
\jour Problems Inform. Transmission
\yr 2010
\vol 46
\issue 2
\pages 184--200
\crossref{https://doi.org/10.1134/S0032946010020067}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000280241600006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77956161935}
Linking options:
  • https://www.mathnet.ru/eng/ppi2017
  • https://www.mathnet.ru/eng/ppi/v46/i2/p91
    • This publication is cited in the following 3 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:385
    Full-text PDF :111
    References:46
    First page:11
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024