Impact of bursty traffic on queues (Q1862208): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Philippe Nain / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Helmut Wegmann / rank
Normal rank
 
Property / author
 
Property / author: Philippe Nain / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Helmut Wegmann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1021232808938 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1583502482 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:00, 30 July 2024

scientific article
Language Label Description Also known as
English
Impact of bursty traffic on queues
scientific article

    Statements

    Impact of bursty traffic on queues (English)
    0 references
    10 March 2003
    0 references
    In a discrete single server queue with deterministic service the tail distribution of the stationary queue length \(q\) is analysed. The special feature of the paper is the bursty/self-similar/long-range dependent input. The number of entering customers per time unit is modelled by the number of busy servers of an M/G/\(\infty\) queue with a heavy-tailed service time distribution \(G(x)\). Unlike the case of Poisson-type traffic, where the tail of the distribution of \(q\) decreases exponentially, in the bursty case the tail \(P(q>x)\) of the queue length decreases slower as some (definite) power of \(\int_x^\infty(1-G(t))dt\) as \(x\to \infty\).
    0 references
    self-similar processes
    0 references
    long-range dependence
    0 references
    subexponential distribution
    0 references
    queue
    0 references
    performance evaluation
    0 references
    data network
    0 references
    0 references

    Identifiers