Queues with superposition arrival processes in heavy traffic (Q1070672): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Poisson Approximations for Superposition Arrival Processes in Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4114551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central limit theorems in D[0, 1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy-Traffic Limits for Queues with Many Exponential Servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple channel queues in heavy traffic. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple channel queues in heavy traffic. II: sequences, networks, and batches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for Superposition Arrival Processes in Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Useful Functions for Functional Limit Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating a Point Process by a Renewal Process, I: Two Basic Methods / rank
 
Normal rank

Latest revision as of 11:50, 17 June 2024

scientific article
Language Label Description Also known as
English
Queues with superposition arrival processes in heavy traffic
scientific article

    Statements

    Queues with superposition arrival processes in heavy traffic (English)
    0 references
    0 references
    1985
    0 references
    A multiserver queue with general service time distributions, where the input process is a superposition of n independent, identically distributed stationary renewal processes each with rate \(n^{-1}\) is investigated. Some problems with approximations when \(n\to \infty\) and the traffic intensity increases to 1 are sketched, and suitable limit theorems are proved which give partial answers to questions about heavy traffic approximations.
    0 references
    multiserver queue
    0 references
    stationary renewal processes
    0 references
    limit theorems
    0 references
    heavy traffic approximations
    0 references
    0 references

    Identifiers