A decomposition-related throughput property of tandem queueing networks with blocking (Q2368084): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A Sequence of Two Servers with No Intermediate Queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of finite queue, tandem server systems / 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: Bounds and heuristics for assembly-like queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic processes and their network representations associated with a production line queueing model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalencies of blocking mechanisms in queueing networks with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of throughput in non-Markovian networks / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01149261 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977779965 / rank
 
Normal rank

Latest revision as of 11:51, 30 July 2024

scientific article
Language Label Description Also known as
English
A decomposition-related throughput property of tandem queueing networks with blocking
scientific article

    Statements

    A decomposition-related throughput property of tandem queueing networks with blocking (English)
    0 references
    0 references
    0 references
    22 August 1993
    0 references
    The authors consider a standard tandem queueing network with blocking, in which a number of servers are arranged in series. Further the blocking mechanism of the system is either production blocking (i.e., a server is blocked only when a finished job cannot be released to the next server) or communication blocking (i.e., a server is blocked whenever there is no available space in the next server). The authors discuss a general throughput property that relates existing decomposition methods to throughput bounds by using the sample path approach.
    0 references
    tandem queueing network with blocking
    0 references
    throughput property
    0 references
    decomposition methods
    0 references

    Identifiers