The BCD queue and its ramifications (Q1206497): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Palm probabilities and stationary queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LCFS finite buffer model with batch input and non-exponential services / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LCFS finite buffer model with finite source batch input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queueing systems with restricted workload: an explicit solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insensitivity of steady-state distributions of generalized semi-Markov processes. I / rank
 
Normal rank

Latest revision as of 15:33, 17 May 2024

scientific article
Language Label Description Also known as
English
The BCD queue and its ramifications
scientific article

    Statements

    The BCD queue and its ramifications (English)
    0 references
    0 references
    0 references
    1 April 1993
    0 references
    This paper contains generalizations and unifications of certain classes of queueing systems with the aim to obtain tractable steady state solutions which resemble the product-form results and quasi-reversibility of Kelly's symmetric queues. The versatility of the new model depends on using an environmental process which substitutes the birth-death process as the starting point for defining symmetric queues. This environment process resembles the usual LCFS-preemptive resume queueing system with different customer types --- resulting at the same time in modelling a reasonably general environment and a birth-death type steady state. Having at hand this explicit environment distribution arrival and service mechanism for customers of different classes are incorporated still yielding explicit steady state distributions. It is shown that the environment process as well as the derived queueing process show insensitivity under change of ``service time'' distributions as long as their means are fixed. Several examples are given.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    classes of queueing systems
    0 references
    steady state solutions
    0 references
    product-form results
    0 references
    quasi-reversibility
    0 references
    birth-death process
    0 references
    insensitivity
    0 references
    0 references