Large deviations for the total queue size in non-Markovian tandem queues (Q2397975): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11134-016-9512-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2568119720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large deviations analysis of the generalized processor sharing policy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact asymptotics for the stationary sojourn time distribution in a tandem of queues with light-tailed service times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large deviations of the sojourn time for queues in series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of an importance sampling estimator for tandem queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/m queue / rank
 
Normal rank

Latest revision as of 06:49, 14 July 2024

scientific article
Language Label Description Also known as
English
Large deviations for the total queue size in non-Markovian tandem queues
scientific article

    Statements

    Large deviations for the total queue size in non-Markovian tandem queues (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2017
    0 references
    The paper under review considers \(d\) independent \(\mathrm{G}/\mathrm{G}/1\) queues in tandem. Customers arrive at queue 1 according to a renewal process with interarrival times all having the distribution \(A(x)\). The service times at queue \(j\) are independent and identically distributed random variables all having the distribution \(B^{(j)}(x)\). All processes are independent, and the customers are served according to the first-come-first-served discipline. After the service completion at queue \(j\) (\(j<d\)), each customer enters immediately to queue \(j+1\), and after the service completion at queue \(d\), the customers leave the system. The system is assumed to be stable, that is \(\int_{0}^\infty x\mathrm{d}A(x)>\int_{0}^\infty x\mathrm{d}B^{(j)}(x) \). The paper studies three different variations of the probability that the number of customers in the system reaches some high level \(N\), namely during a busy cycle, in steady state, and upon arrival of a new customer. The authors show that the decay rates for large \(N\) have the same value, and they give an expression for this value.
    0 references
    0 references
    0 references
    0 references
    0 references
    tandem queues
    0 references
    decay rate
    0 references
    large deviations
    0 references
    0 references
    0 references