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, 2004, Issue 12, Pages 110–118 (Mi at1677)  
This article is cited in 2 scientific papers (total in 2 papers)

Queuing Systems

A ${MAP}_K/G_K/1/\infty$ queueing system with generalized foreground-background processor sharing discipline

C. D'Apicea, M. L. Cristofanoa, A. V. Pechinkinb

a University of Salerno
b Institute for Problems of Informatics RAS
Full-text PDF (188 kB) Citations (2)
References:
PDF
HTML
Abstract: A queueing system with Markov arrival process, several customer types, generalized foreground-background processor sharing discipline with minimal served length, and an infinite buffer for all types of customers is studied. The joint stationary distribution of the number of customers of all types and the stationary distribution of time of sojourn of customers of every type are determined in terms of generating functions and Laplace-Stieltjes transforms.
Presented by the member of Editorial Board: V. M. Vishnevsky

Received: 08.12.2003
English version:
Automation and Remote Control, 2004, Volume 65, Issue 12, Pages 1961–1967
DOI: https://doi.org/10.1023/B:AURC.0000049880.57645.91
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: C. D'Apice, M. L. Cristofano, A. V. Pechinkin, “A ${MAP}_K/G_K/1/\infty$ queueing system with generalized foreground-background processor sharing discipline”, Avtomat. i Telemekh., 2004, no. 12, 110–118; Autom. Remote Control, 65:12 (2004), 1961–1967
Citation in format AMSBIB
\Bibitem{DapCriPec04}
\by C.~D'Apice, M.~L.~Cristofano, A.~V.~Pechinkin
\paper A ${MAP}_K/G_K/1/\infty$ queueing system with generalized foreground-background processor sharing discipline
\jour Avtomat. i Telemekh.
\yr 2004
\issue 12
\pages 110--118
\mathnet{http://mi.mathnet.ru/at1677}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2128195}
\zmath{https://zbmath.org/?q=an:1075.90016}
\transl
\jour Autom. Remote Control
\yr 2004
\vol 65
\issue 12
\pages 1961--1967
\crossref{https://doi.org/10.1023/B:AURC.0000049880.57645.91}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000226005300008}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84904241982}
Linking options:
  • https://www.mathnet.ru/eng/at1677
  • https://www.mathnet.ru/eng/at/y2004/i12/p110
    • This publication is cited in the following 2 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:244
    Full-text PDF :70
    References:39
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024