Stability of an M\(|G|1\) queue with thick tails and excess capacity (Q1585947): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3938929 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Influence of the Maximum Term in the Addition of Independent Random Variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the asymptotic behaviour of the distributions of the busy period and service time in <i>M/G/</i>1 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3952958 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3900799 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The steady-state distribution of spent service times present in the<i>M/G/</i>1 foreground–background processor-sharing queue / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Processor-sharing queues: Some progress in analysis / rank | |||
Normal rank |
Latest revision as of 17:28, 30 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Stability of an M\(|G|1\) queue with thick tails and excess capacity |
scientific article |
Statements
Stability of an M\(|G|1\) queue with thick tails and excess capacity (English)
0 references
16 December 2001
0 references
In computer networks queues are encountered which receive mostly jobs with a small required service time and only occasionally a job with a large service time, as compared to the interarrival times of jobs. The authors consider an M/G/1 queue of this type, where the traffic intensity is infinite. Under the first-come-first-served discipline the occasional long job will generate a long queue. In computer systems one therefore prefers something like the foreground-background (FB) discipline: at any given time the jobs with the least amount of service time received are being served, at a rate inversely proportional to the number of such jobs. This will, for one effect, increase the time it takes to build up a long queue, i.e. the queue, which is unstable under both disciplines, will be `more stable' under FB. Such stability aspects of the behaviour of the given M/G/1 queue under FB are the topic of the paper.
0 references
M/G/1 queue
0 references
foreground-background service
0 references
0 references