A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations

DOI10.1007/BF01159395zbMath0851.90036OpenAlexW2063763878MaRDI QIDQ1919823

Nail Akar, Erdal Arikan

Publication date: 8 December 1996

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01159395

zbMATH Keywords

Padé approximationsMarkov modulated Poisson processMarkovian arrival processATM networksloss probabilitystate-space representationsfinite buffer queuesstationary virtual waiting time distribution

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Related Items (11)

A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of \(\mathrm{BDMMAP}/\mathrm{G}/1\) queue ⋮ Analytical and computational studies of the BMAP/G(a,Y)/1 queue ⋮ Extended analysis and computationally efficient results for the GI/Ma,b/1 queueing system ⋮ Analysis of queueing-time distributions for MAP/D_N/1 queue ⋮ Analytical and computational aspects of the infinite buffer single server \(N\) policy queue with batch renewal input ⋮ Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control ⋮ A difference equation approach for analysing a batch service queue with the batch renewal arrival process ⋮ Modelling and analysis of \(GI/BMSP/1\) queueing system ⋮ Waiting-time analysis of D-BMAP/G/1 queueing system ⋮ Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\) ⋮ A Queueing System with Batch Renewal Input and Negative Arrivals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Fourier-series method for inverting transforms of probability distributions
• Linear multivariable control. A geometric approach
• Analysis of separable Markov-modulated rate models for information-handling systems
• New results on the single server queue with a batch markovian arrival process
• A single-server queue with server vacations and a class of non-renewal arrival processes
• Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
• The n/g/l finite capacity queue
• A versatile Markovian point process
• The N/G/1 queue and its detailed analysis
• Nineteen Dubious Ways to Compute the Exponential of a Matrix
• A logarithmic reduction algorithm for quasi-birth-death processes
• Asymptotics for steady-state tail probabilities in structured markov queueing models
• The transient BMAP/G/l queue
• Analysis of the loss probability of the map/g/1/k queue part i: asymptotic theory
• Analysis of the loss probability of the map/g/1/k queue part ii: approximations and numerical results
• An invariant subspace approach in m/g/l and g/m/l type markov chains
• Experimental results on matrix-analytical solution techniques–extensions and comparisons
• Numerical Inversion of Laplace Transforms of Probability Distributions
• Marked point processes as limits of Markovian arrival streams
• The Interrupted Poisson Process As An Overflow Process

This page was built for publication: A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations