Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss - MaRDI portal

Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss (Q1332957)

From MaRDI portal





scientific article; zbMATH DE number 633816
Language Label Description Also known as
English
Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss
scientific article; zbMATH DE number 633816

    Statements

    Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss (English)
    0 references
    0 references
    0 references
    0 references
    31 October 1995
    0 references
    The paper begins by providing an approximation to the output process of 2-\(MMBP/GEO/1/K\) queue using another 2-\(MMBP\) (two-state Markov modulated Bernoulli process). The burstiness and the correlation of the output process are shown to be well approximated by the 2-\(MMBP\). The output approximation is achieved by matching the average output rate, its squared coefficient of variation, the autocorrelation coefficients of the interdeparture times and the number of departures per slot. A tandem configuration of five notes is analysed using the approximation in a decomposition algorithm and the result compared to simulation, with good agreement.
    0 references
    two-state Markov modulated Bernoulli process
    0 references
    output approximation
    0 references
    autocorrelation coefficients of the interdeparture times
    0 references
    decomposition algorithm
    0 references
    simulation
    0 references

    Identifiers