A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications (Q2494553)

From MaRDI portal
Revision as of 07:33, 5 August 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
A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
scientific article

    Statements

    A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications (English)
    0 references
    0 references
    0 references
    28 June 2006
    0 references
    Processor sharing
    0 references
    Sojourn time
    0 references
    Waiting time
    0 references
    Busy period
    0 references
    Sample path
    0 references
    First come first served
    0 references
    Comparative analysis
    0 references
    Mean sojourn time approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references