The customer response times in the processor sharing queue are associated (Q1813543): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: François Baccelli / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Helmut Schellhaas / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An End-to-End Approach to the Resequencing Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acyclic fork-join queuing networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4158362 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sharing a Processor Among Many Job Classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5602045 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Processor-sharing queues: Some progress in analysis / rank | |||
Normal rank |
Latest revision as of 08:37, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The customer response times in the processor sharing queue are associated |
scientific article |
Statements
The customer response times in the processor sharing queue are associated (English)
0 references
25 June 1992
0 references
The authors consider an egalitarian processor sharing queue with renewal inputs and general independent service times. Assuming that the service times and the negative interarrival times are associated random variables the authors prove their main result that the customer response times are associated. Notice that the property holds in the special case of independent and i.i.d. service and interarrival times. By an application to a resequencing queue the usefulness of the result is demonstrated.
0 references
association of random variables
0 references
stochastic ordering
0 references
processor sharing queue
0 references