USING SINGULARITY ANALYSIS TO APPROXIMATE TRANSIENT CHARACTERISTICS IN QUEUEING SYSTEMS
From MaRDI portal
Publication:3645161
DOI10.1017/S0269964809000199zbMath1173.90367OpenAlexW2140139794MaRDI QIDQ3645161
Joris Walraevens, Marc Moeneclaey, Dieter Fiems
Publication date: 16 November 2009
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964809000199
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems, Combined Analysis of Transient Delay Characteristics and Delay Autocorrelation Function in theGeoX/G/1Queue, On two generalisations of the final value theorem: scientific relevance, first applications, and physical foundations
Cites Work
- Unnamed Item
- Solving probability transform functional equations for numerical inversion
- Numerical inversion of probability generating functions
- Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues
- Multidimensional transform inversion with applications to the transient \(M/G/1\) queue
- Performance analysis of a single-server ATM queue with a priority scheduling.
- On the numerical inversion of busy-period related transforms
- Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion
- The transient solution to \(M/E_{k}/1\) queue
- On the application of Rouché's theorem in queueing theory
- Singularity Analysis of Generating Functions
- A transient solution to an M/M/1 queue: a simple approach
- Asymptotic Methods in Enumeration
- Let us teach this generalization of the final-value theorem