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, 2001, Volume 37, Issue 2, Pages 88–95 (Mi ppi519)  

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

Communication Network Theory

Ergodicity of Band Graph Markov Chains and Their Application to Problems of the Analysis of Existence of a Stationary Regime in a Dynamic Random Multiple Access Communication Network

A. A. Nazarov, S. L. Shokhor
Full-text PDF (685 kB) Citations (4)
References:
Abstract: A concept of the class of band graph Markov chains is introduced. Simple ergodicity criteria for this class of stochastic processes are found. We show how these criteria can be applied to prove the existence of a stationary operation regime in a dynamic access communication network with conflict warning.
Received: 16.03.2000
Revised: 24.10.2000
English version:
Problems of Information Transmission, 2001, Volume 37, Issue 2, Pages 165–171
DOI: https://doi.org/10.1023/A:1010426209867
Bibliographic databases:
Document Type: Article
UDC: 621.391.1:621.394/395.74-503.5
Language: Russian
Citation: A. A. Nazarov, S. L. Shokhor, “Ergodicity of Band Graph Markov Chains and Their Application to Problems of the Analysis of Existence of a Stationary Regime in a Dynamic Random Multiple Access Communication Network”, Probl. Peredachi Inf., 37:2 (2001), 88–95; Problems Inform. Transmission, 37:2 (2001), 165–171
Citation in format AMSBIB
\Bibitem{NazSho01}
\by A.~A.~Nazarov, S.~L.~Shokhor
\paper Ergodicity of Band Graph Markov Chains and Their Application to Problems of the Analysis of Existence of a~Stationary Regime in a~Dynamic Random Multiple Access Communication Network
\jour Probl. Peredachi Inf.
\yr 2001
\vol 37
\issue 2
\pages 88--95
\mathnet{http://mi.mathnet.ru/ppi519}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2099900}
\zmath{https://zbmath.org/?q=an:0991.60059}
\transl
\jour Problems Inform. Transmission
\yr 2001
\vol 37
\issue 2
\pages 165--171
\crossref{https://doi.org/10.1023/A:1010426209867}
Linking options:
  • https://www.mathnet.ru/eng/ppi519
  • https://www.mathnet.ru/eng/ppi/v37/i2/p88
  • This publication is cited in the following 4 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:861
    Full-text PDF :694
    References:47
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024