A generic approximate transient analysis applied to a priority queue
- 1 May 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 28-35
Abstract
In this paper, we develop an efficient method to approximate the transient behavior of queueing systems. More precisely, it is shown how singularity analysis of a known transform function of a transient sequence leads to an approximation of this sequence. To illustrate our approach, the transient system contents of both classes in a two-class discrete-time priority queue are investigated. By means of some numerical examples, we then validate our approximations and demonstrate the usefulness of our approach.Keywords
This publication has 16 references indexed in Scilit:
- Transient Analysis of the D-BMAP/G/1 Queue with an Application to the Dimensioning of a Playout Buffer for VBR VideoLecture Notes in Computer Science, 2004
- Performance analysis of a single-server ATM queue with a priority schedulingComputers & Operations Research, 2003
- Let us teach this generalization of the final-value theoremEuropean Journal of Physics, 2003
- On the numerical inversion of busy-period related transformsOperations Research Letters, 2002
- Systems of functional equationsRandom Structures & Algorithms, 2000
- Calculating the M/G/1 busy-period density and LIFO waiting-time distribution by direct numerical transform inversionOperations Research Letters, 1995
- Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queuesEuropean Journal of Operational Research, 1994
- Singularity Analysis of Generating FunctionsSIAM Journal on Discrete Mathematics, 1990
- A transient solution to anM/M/1 queue: a simple approachAdvances in Applied Probability, 1987
- Asymptotic Methods in EnumerationSIAM Review, 1974