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, 2007, Volume 43, Issue 4, Pages 93–108 (Mi ppi30)  
This article is cited in 6 scientific papers (total in 6 papers)

Communication Network Theory

On Exact Asymptotics for a Stationary Sojourn Time Distribution in a Tandem of Queues with Light-Tailed Service Times

S. G. Fossab

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Heriot Watt University
Full-text PDF (1317 kB) Citations (6)
References:
PDF
HTML
Abstract: We study the asymptotics of the stationary sojourn time $Z$ of a “typical customer” in a tandem of single-server queues. It is shown that in a certain “intermediate” region of light-tailed service time distributions, $Z$ may take a large value mostly due to a large value of a single service time of one of the customers. Arguments used in the paper also allow us to obtain an elementary proof of the logarithmic asymptotics for the tail distribution of the stationary sojourn time in the whole class of light-tailed distributions.
Received: 07.06.2007
Revised: 07.09.2007
English version:
Problems of Information Transmission, 2007, Volume 43, Issue 4, Pages 353–366
DOI: https://doi.org/10.1134/S0032946007040084
Bibliographic databases:
Document Type: Article
UDC: 621.39:519.2
Language: Russian
Citation: S. G. Foss, “On Exact Asymptotics for a Stationary Sojourn Time Distribution in a Tandem of Queues with Light-Tailed Service Times”, Probl. Peredachi Inf., 43:4 (2007), 93–108; Problems Inform. Transmission, 43:4 (2007), 353–366
Citation in format AMSBIB
\Bibitem{Fos07}
\by S.~G.~Foss
\paper On Exact Asymptotics for a Stationary Sojourn Time Distribution in a Tandem
of Queues with Light-Tailed Service Times
\jour Probl. Peredachi Inf.
\yr 2007
\vol 43
\issue 4
\pages 93--108
\mathnet{http://mi.mathnet.ru/ppi30}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2406147}
\zmath{https://zbmath.org/?q=an:1166.60056}
\transl
\jour Problems Inform. Transmission
\yr 2007
\vol 43
\issue 4
\pages 353--366
\crossref{https://doi.org/10.1134/S0032946007040084}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000255782900008}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-45349103201}
Linking options:
  • https://www.mathnet.ru/eng/ppi30
  • https://www.mathnet.ru/eng/ppi/v43/i4/p93
    • This publication is cited in the following 6 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:349
    Full-text PDF :96
    References:57
    First page:9
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024