Sistemy i Sredstva Informatiki [Systems and Means of Informatics]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sistemy i Sredstva Inform.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Sistemy i Sredstva Informatiki [Systems and Means of Informatics], 2015, Volume 25, Issue 3, Pages 44–59
DOI: https://doi.org/10.14357/08696527150303 (Mi ssi416) 		 
This article is cited in 1 scientific paper (total in 1 paper)

On the method of calculating the stationary distribution in the finite two-channel system with ordered input

I. S. Zaryadova, L. A. Meykhanadzhyana, T. A. Milovanovaa, R. V. Razumchikba

a Peoples' Friendship University of Russia, 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
b Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Full-text PDF (234 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.14357/08696527150303
Abstract: This paper considers a queueing system with ordered input and two servers (labelled by numbers 1 and 2). Each server has a buffer of finite capacity in front of it. Queues capacities are different. Customers arrive according to a Poisson process with constant rate. Upon arrival, a new customer goes to the server with label 1 or, if it is busy, occupies a place in the queue in front of it. If upon arrival a customer sees the queue in front of the server 1 full, it goes to the server with label 2 or, if it is busy, enters the queue in front of it. If upon arrival of a new customer the system is full, the new customer is lost. Customers from both queues are served according to the FIFO (first in, first out) discipline and each server serves customers exponentially distributed times with the same parameter. A new method for recursive computation of the joint stationary distribution of queues is proposed.
Keywords: queueing system; special functions; two-dimensional Markov chain; joint distribution.
Funding agency Grant number
Russian Foundation for Basic Research 15-07-03007
15-07-03406
Received: 28.04.2015
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: I. S. Zaryadov, L. A. Meykhanadzhyan, T. A. Milovanova, R. V. Razumchik, “On the method of calculating the stationary distribution in the finite two-channel system with ordered input”, Sistemy i Sredstva Inform., 25:3 (2015), 44–59
Citation in format AMSBIB
\Bibitem{ZarMeyMil15}
\by I.~S.~Zaryadov, L.~A.~Meykhanadzhyan, T.~A.~Milovanova, R.~V.~Razumchik
\paper On the method of calculating the stationary distribution in the finite two-channel system with~ordered~input
\jour Sistemy i Sredstva Inform.
\yr 2015
\vol 25
\issue 3
\pages 44--59
\mathnet{http://mi.mathnet.ru/ssi416}
\crossref{https://doi.org/10.14357/08696527150303}
\elib{https://elibrary.ru/item.asp?id=24347064}
Linking options:
  • https://www.mathnet.ru/eng/ssi416
  • https://www.mathnet.ru/eng/ssi/v25/i3/p44
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Системы и средства информатики
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024