Patterns of buffer overflow in a class of queues with long memory in the input stream (Q1379720)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Patterns of buffer overflow in a class of queues with long memory in the input stream |
scientific article; zbMATH DE number 1121391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Patterns of buffer overflow in a class of queues with long memory in the input stream |
scientific article; zbMATH DE number 1121391 |
Statements
Patterns of buffer overflow in a class of queues with long memory in the input stream (English)
0 references
19 January 1999
0 references
The authors consider a G/G/1/\(L\) queue with finite buffer capacity \(L\) and determine time to buffer overflow. The arrival process is produced by an on/off source with heavy tailed on-distribution. The mean time to overflow increases polynomially fast with increasing capacity \(L\), contrary to the classical case with light tales for the on-distribution. Pooling of resources in case of superposition of several such arrival processes is investigated.
0 references
long range dependence
0 references
heavy tails
0 references
G/G/1
0 references
level crossing
0 references
0 references
0 references
0.8652412295341492
0 references
0.811771035194397
0 references
0.8083565831184387
0 references
0.8059656620025635
0 references
0.8005058169364929
0 references
