Sojourn times in closed queueing networks (Q3662409)

From MaRDI portal
Revision as of 15:39, 17 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sojourn times in closed queueing networks
scientific article

    Statements

    title
    Sojourn times in closed queueing networks (English)
    0 references
    author
    F. P. Kelly
    0 references
    Philip K. Pollett
    0 references
    publication date
    1983
    0 references
    zbMATH Keywords
    overtake-free path
    0 references
    embedded jump chains
    0 references
    sojourn times
    0 references
    Gordon-Newell network
    0 references

    Identifiers

    DOI
    10.2307/1426623
    0 references
    Mathematics Subject Classification ID
    60K25
    0 references
    68M20
    0 references
    90B22
    0 references
    60J27
    0 references
    zbMATH DE Number
    3814725
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3662409&oldid=8091329"
      Powered by MediaWiki