Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






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


Avtomatika i Telemekhanika, 2009, Issue 7, Pages 97–110 (Mi at501)  

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

Queuing Systems

Queueing system with finite memory and jump intensity of the arrival process

N. I. Golovko, V. V. Katrakhov, D. E. Ryzhkov

Pacific State University of Economics, Vladivostok, Russia
Full-text PDF (237 kB) Citations (4)
References:
Abstract: We consider a single-server queueing system (QS) with finite memory and exponential service with parameter $\mu$. The QS is fed by a doubly stochastic Poisson flow whose intensity $\lambda(t)$ is a jump process. We propose a matrix and a functional-analytical method to study stationary and nonstationary characteristics of the QS; we also prove existence and uniqueness of a stationary regime and stabilization of a nonstationary regime of the QS. Results of numerical analysis are discussed.
Presented by the member of Editorial Board: A. I. Kibzun

Received: 28.06.2007
English version:
Automation and Remote Control, 2009, Volume 70, Issue 7, Pages 1176–1189
DOI: https://doi.org/10.1134/S0005117909070091
Bibliographic databases:
Document Type: Article
PACS: 02.50.-r
Language: Russian
Citation: N. I. Golovko, V. V. Katrakhov, D. E. Ryzhkov, “Queueing system with finite memory and jump intensity of the arrival process”, Avtomat. i Telemekh., 2009, no. 7, 97–110; Autom. Remote Control, 70:7 (2009), 1176–1189
Citation in format AMSBIB
\Bibitem{GolKatRyz09}
\by N.~I.~Golovko, V.~V.~Katrakhov, D.~E.~Ryzhkov
\paper Queueing system with finite memory and jump intensity of the arrival process
\jour Avtomat. i Telemekh.
\yr 2009
\issue 7
\pages 97--110
\mathnet{http://mi.mathnet.ru/at501}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2567382}
\zmath{https://zbmath.org/?q=an:1181.93077}
\transl
\jour Autom. Remote Control
\yr 2009
\vol 70
\issue 7
\pages 1176--1189
\crossref{https://doi.org/10.1134/S0005117909070091}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000268479100009}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-68549123618}
Linking options:
  • https://www.mathnet.ru/eng/at501
  • https://www.mathnet.ru/eng/at/y2009/i7/p97
  • 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
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:353
    Full-text PDF :121
    References:36
    First page:5
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024