Three stage tandem queue with blocking (Q759644): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/0377-2217(85)90176-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979035936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequence of Two Servers with No Intermediate Queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Arrays of Waiting Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two queues in tandem with multiple facilities and restricted waiting space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the waiting time of a two-stage queueing system with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking / rank
 
Normal rank

Latest revision as of 16:21, 14 June 2024

scientific article
Language Label Description Also known as
English
Three stage tandem queue with blocking
scientific article

    Statements

    Three stage tandem queue with blocking (English)
    0 references
    0 references
    0 references
    1985
    0 references
    An analysis is given of the state and first-come, first-served waiting time processes for a three stage queueing system with no waiting space between stages, but with limited space before the first. Although the basic processes are exponential, no detailed analysis in this generality appears to have been made before; the nearest analyses entail the simplifying assumption that the first stage is never empty. A sufficient condition is derived easily for equilibrium to exist and it can be asserted with virtual certainty that it is also necessary; the complexity of calculation has so far excluded a proper proof, though this is in principle a possibility. The objective is to provide a theoretical framework easily adaptable for a numerical assessment of system performance to be made. Some typical tables with comments are given.
    0 references
    0 references
    blocking
    0 references
    stochastic processes
    0 references
    communications
    0 references
    system performance
    0 references
    first-come, first-served waiting time processes
    0 references
    three stage queueing system
    0 references
    equilibrium
    0 references
    0 references