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, 2009, Volume 45, Issue 3, Pages 85–97 (Mi ppi1992)  
This article is cited in 12 scientific papers (total in 12 papers)

Communication Network Theory

The $MAP/M/N$ retrial queueing system with time-phased batch arrivals

S. A. Dudin

Belarusian State University, Minsk
Full-text PDF (266 kB) Citations (12)
References:
PDF
HTML
Abstract: We consider a retrial queueing system with batch arrival of customers. Unlike standard batch arrival, where a whole batch enters the system simultaneously, we assume that customers of a batch (session) arrive one by one in exponentially distributed time intervals. Service time is exponentially distributed. The batch arrival flow is MAP. The number of customers in a session is geometrically distributed. The number of sessions that can enter the system simultaneously is a control parameter. We analyze the joint probability distribution of the number of sessions and customers in the system using the techniques of multidimensional asymptotically quasi-Toeplitz Markov chains.
Received: 12.11.2008
Revised: 25.04.2009
English version:
Problems of Information Transmission, 2009, Volume 45, Issue 3, Pages 270–281
DOI: https://doi.org/10.1134/S0032946009030089
Bibliographic databases:
Document Type: Article
UDC: 621.391.71+519.2
Language: Russian
Citation: S. A. Dudin, “The $MAP/M/N$ retrial queueing system with time-phased batch arrivals”, Probl. Peredachi Inf., 45:3 (2009), 85–97; Problems Inform. Transmission, 45:3 (2009), 270–281
Citation in format AMSBIB
\Bibitem{Dud09}
\by S.~A.~Dudin
\paper The $MAP/M/N$ retrial queueing system with time-phased batch arrivals
\jour Probl. Peredachi Inf.
\yr 2009
\vol 45
\issue 3
\pages 85--97
\mathnet{http://mi.mathnet.ru/ppi1992}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2590747}
\zmath{https://zbmath.org/?q=an:1178.90092}
\transl
\jour Problems Inform. Transmission
\yr 2009
\vol 45
\issue 3
\pages 270--281
\crossref{https://doi.org/10.1134/S0032946009030089}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000271088300008}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-70350506831}
Linking options:
  • https://www.mathnet.ru/eng/ppi1992
  • https://www.mathnet.ru/eng/ppi/v45/i3/p85
    • This publication is cited in the following 12 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, 2025