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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11134-006-6264-1 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11134-006-6264-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969920600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The customer response times in the processor sharing queue are associated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the M/G/1 processor-sharing queue with bulk arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The processor‐sharing queueing model for time‐shared systems with bulk arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sojourn times in a processor sharing queue with service interruptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sojourn time in the <i>GI/M/</i>1 queue by processor sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical problems in the theory of processor-sharing queueing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sojourn time asymptotics in the \(M/G/1\) processor sharing queue / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11134-006-6264-1 / rank
 
Normal rank

Latest revision as of 00:40, 19 December 2024

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
    0 references