Performance bounds for scheduling queueing networks (Q1198582)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Performance bounds for scheduling queueing networks
scientific article

    Statements

    Performance bounds for scheduling queueing networks (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    Some general classes of multi-customer networks are compared with (partially very) simplified derivates. Roughly the idea is: Forget about those structures of the system which makes analysis complex and try to do this in a way such that the new model when run in parallel to the old one can be strictly compared either by pathwise comparison of the describing processes or by comparing the steady-state expectations of the performance measure. Some of the bounds and concerned numerical results are called ``moderately encouraging'' by the authors.
    0 references
    simulation
    0 references
    performance bounds
    0 references
    scheduling
    0 references
    queueing networks
    0 references
    non- productform systems
    0 references
    numerical results
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references