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 3, Pages 67–81 (Mi ppi528)  

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

Communication Network Theory

On a Retrial Single-Server Queueing System with Finite Buffer and Poisson Flow

P. P. Bocharov, C. D'Apice, N. H. Phong
References:
Abstract: A retrial single-server queueing system with finite buffer is considered. The primary incoming flow is Poissonian. If the buffer is overflown, a call entering the system becomes a repeat call and joins the group of repeat calls referred to as an orbit. The maximum number of calls that can simultaneously be contained in the orbit is limited. A call from the orbit makes new attempts to enter the system until a vacancy occurs. Time between repeat attempts for each call is an exponentially distributed random variable. At the initial moment of service, a type of a call is defined: with probability $a_i$ it becomes a call of type $i$ and its service time in this case has distribution function $B_i(x)$, $i=1,\dots,K$. For this system, the stationary joint distribution of queues in the buffer and orbit is found. Numerical examples are given.
Received: 23.11.2000
English version:
Problems of Information Transmission, 2001, Volume 37, Issue 3, Pages 248–261
DOI: https://doi.org/10.1023/A:1013882108415
Bibliographic databases:
Document Type: Article
UDC: 621.394.74:519.2
Language: Russian
Citation: P. P. Bocharov, C. D'Apice, N. H. Phong, “On a Retrial Single-Server Queueing System with Finite Buffer and Poisson Flow”, Probl. Peredachi Inf., 37:3 (2001), 67–81; Problems Inform. Transmission, 37:3 (2001), 248–261
Citation in format AMSBIB
\Bibitem{BocDapPho01}
\by P.~P.~Bocharov, C.~D'Apice, N.~H.~Phong
\paper On a~Retrial Single-Server Queueing System with Finite Buffer and Poisson Flow
\jour Probl. Peredachi Inf.
\yr 2001
\vol 37
\issue 3
\pages 67--81
\mathnet{http://mi.mathnet.ru/ppi528}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2098986}
\zmath{https://zbmath.org/?q=an:1114.90332}
\transl
\jour Problems Inform. Transmission
\yr 2001
\vol 37
\issue 3
\pages 248--261
\crossref{https://doi.org/10.1023/A:1013882108415}
Linking options:
  • https://www.mathnet.ru/eng/ppi528
  • https://www.mathnet.ru/eng/ppi/v37/i3/p67
  • 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:326
    Full-text PDF :102
    References:45
    First page:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024