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 12, Pages 109–120 (Mi at578)  

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

Non-classical Models of the Queuing Theory

A queueing system with negative claims and a bunker for superseded claims in discrete time

A. V. Pechinkina, R. V. Razumchikb

a Institute of Informatics Problems, Russian Academy of Sciences, Moscow, Russia
b Peoples Friendship University, Moscow, Russia
Full-text PDF (151 kB) Citations (7)
References:
Abstract: We consider a discrete time single-line queueing system with independent geometric streams of regular and negative claims, infinite buffer, and geometric service. A negative claim pushes a regular claim out of the buffer queue and moves it to a bunker of infinite capacity. If the buffer is empty, a negative claim leaves the system without any effect. After servicing a claim, the system receives the next claim from the buffer, if it is not empty, or from the bunker. We obtain relations that allow computing stationary distributions for queues in the buffer and the bunker.
Presented by the member of Editorial Board: S. F. Yashkov

Received: 12.05.2009
English version:
Automation and Remote Control, 2009, Volume 70, Issue 12, Pages 2039–2049
DOI: https://doi.org/10.1134/S000511790912011X
Bibliographic databases:
Document Type: Article
PACS: 02.50.-r
Language: Russian
Citation: A. V. Pechinkin, R. V. Razumchik, “A queueing system with negative claims and a bunker for superseded claims in discrete time”, Avtomat. i Telemekh., 2009, no. 12, 109–120; Autom. Remote Control, 70:12 (2009), 2039–2049
Citation in format AMSBIB
\Bibitem{PecRaz09}
\by A.~V.~Pechinkin, R.~V.~Razumchik
\paper A~queueing system with negative claims and a~bunker for superseded claims in discrete time
\jour Avtomat. i Telemekh.
\yr 2009
\issue 12
\pages 109--120
\mathnet{http://mi.mathnet.ru/at578}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2641059}
\zmath{https://zbmath.org/?q=an:1180.90040}
\transl
\jour Autom. Remote Control
\yr 2009
\vol 70
\issue 12
\pages 2039--2049
\crossref{https://doi.org/10.1134/S000511790912011X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000273307900011}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-73849134233}
Linking options:
  • https://www.mathnet.ru/eng/at578
  • https://www.mathnet.ru/eng/at/y2009/i12/p109
  • This publication is cited in the following 7 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:477
    Full-text PDF :186
    References:60
    First page:8
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024