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, 1985, Volume 21, Issue 2, Pages 90–98 (Mi ppi987)  

Communication Network Theory

Analysis of a Fully Connected Message-Switching Communication Network with a Large Number of Nodes, Bypass Routes, and a Limited Number of Waiting Places at Nodes

V. V. Marbukh
Abstract: The author obtains the asymptotic values as $N\to\infty$ of some characteristics of a fully connected message-switching network with $N$ nodes, bypass routes, and a limited number of waiting places at nodes. It is shown that there is a “phase transition of the first kind” in the network as $N\to\infty$. The interrelationship between the phase transition and purposeful load-limiting discipline as $N\to\infty$ is considered. The results are obtained under the assumption that as $N\to\infty$ the queues at the nodes are statistically independent and can be approximated by queues in $M|M|1$ queuing systems with a limited number of waiting-places and with intensities of the incoming flows determined from the self-consistency conditions.
Received: 02.03.1982
Bibliographic databases:
Document Type: Article
UDC: 621.394.74:519.21
Language: Russian
Citation: V. V. Marbukh, “Analysis of a Fully Connected Message-Switching Communication Network with a Large Number of Nodes, Bypass Routes, and a Limited Number of Waiting Places at Nodes”, Probl. Peredachi Inf., 21:2 (1985), 90–98; Problems Inform. Transmission, 21:2 (1985), 154–161
Citation in format AMSBIB
\Bibitem{Mar85}
\by V.~V.~Marbukh
\paper Analysis of a~Fully Connected Message-Switching Communication Network with a~Large Number of Nodes, Bypass Routes, and a~Limited Number of Waiting Places at Nodes
\jour Probl. Peredachi Inf.
\yr 1985
\vol 21
\issue 2
\pages 90--98
\mathnet{http://mi.mathnet.ru/ppi987}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=804603}
\zmath{https://zbmath.org/?q=an:0584.90024}
\transl
\jour Problems Inform. Transmission
\yr 1985
\vol 21
\issue 2
\pages 154--161
Linking options:
  • https://www.mathnet.ru/eng/ppi987
  • https://www.mathnet.ru/eng/ppi/v21/i2/p90
  • 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, 2025