Exploiting the Toeplitz structure in certain queueing problems

DOI10.1007/BF02576006MaRDI QIDQ1127955zbMATH OpenOpenAlexFDO

Authors B. Meini, Dario A. Bini

Publication date 10 August 1998

Published in Calcolo (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsqueueing theoryMarkov chainsfast Fourier transformSchur complementToeplitz matricesdisplacement rankfast polynomial computations

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• Solving certain queueing problems modelled by Toeplitz matrices
• An approach to a class of queuing problems
• Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory
• scientific article; zbMATH DE number 956796
• A queueing model and a set of orthogonal polynomials
• scientific article; zbMATH DE number 1031390
• scientific article; zbMATH DE number 3069542
• scientific article; zbMATH DE number 1301681
• An application of Gegenbauer polynomials in queueing theory

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 19235 (Why is no real title available?)
• scientific article; zbMATH DE number 510837 (Why is no real title available?)
• scientific article; zbMATH DE number 956796 (Why is no real title available?)
• scientific article; zbMATH DE number 956824 (Why is no real title available?)
• A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
• A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service
• A logarithmic reduction algorithm for quasi-birth-death processes
• A stable recursion for the steady state vector in markov chains of m/g/1 type
• An M/G/1 queuing system with multiple vacations to assess the performance of a simplified deficit round robin model.
• An improved FFT-based version of Ramaswami's formula
• Displacement Structure: Theory and Applications
• Displacement ranks of a matrix
• Experimental results on matrix-analytical solution techniques–extensions and comparisons
• Improved cyclic reduction for solving queueing problems
• Improved parallel computations with Toeplitz-like and Hankel-like matrices
• Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: Application to queueing problems
• LU decomposition of M-matrices by elimination without pivoting
• New convergence results on functional iteration techniques for the numerical solution of M/G/1 type Markov chains
• Newton's iteration for non-linear equations in Markov chains
• Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains
• Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
• On Direct Methods for Solving Poisson’s Equations
• On a two-level multigrid solution method for finite Markov chains
• On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
• On the solution of block Hessenberg systems
• Regenerative Analysis and Steady State Distributions for Markov Chains
• Some steady-state distributions for theMAP /SM /1 queue
• Spectral and computational properties of band symmetric Toeplitz matrices

Cited in

(4)

• Computing the exponential of large block-triangular block-Toeplitz matrices encountered in fluid queues
• A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain
• Matrix structures in queuing models
• Solving certain queueing problems modelled by Toeplitz matrices

Describes a project that uses

Uses Software

• na12

This page was built for publication: Exploiting the Toeplitz structure in certain queueing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127955)