Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
type: Item
instance of: scholarly article
title: Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
zbMATH Open document ID: 1030.60081
DOI: 10.1007/BF02579008
author: Attahiru Sule Alfa
published in: Top
publication date: 2003-05-20T00:00:00Z
review text: The paper is expository dealing with discrete time analysis of queues using matrix-analytic methods. In the present moment, there are many practical situations (e.g. telecommunication systems) based more on digital technology than analog one. On the other hand, sometimes it is easier to study discrete time analysis than continuous one, however, the paper provides both the advantages and disadvantages of discrete time analysis. The paper presents several queueing systems as discrete time quasi-birth-death processes and then shows how to use matrix-geometric method which in many situations gives much simpler approach. Finally, the paper is accompanied by discussions given by J. Garcia-Vidal, A. Gómez-Corral, W. K. Grassmann, Qi-Ming He, Wei Li, B. Van Houdt, Quiang Ye.
reviewed by: Anatolij Dvurečenskij
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 1907710
zbMATH Keywords: queueing system
zbMATH Keywords: discrete time
zbMATH Keywords: matrix-analytic method
zbMATH Keywords: matrix-geometric methods
MaRDI profile type: Publication
cites work: Computing the Waiting Time Distribution for the G/G/1 Queue by Signal Processing Methods
cites work: A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service
cites work: Discrete time analysis of MAP/PH/1 vacation queue with gated time-limited service
cites work: Combined elapsed time and matrix-analytic method for the discrete time \(GI/G/1\) and \(GI^X/G/1\) systems
cites work: Matrix?geometric analysis of the discrete time Gi/G/1 system
cites work: Modelling Vehicular Traffic Using the Discrete Time Markovian Arrival Process
cites work: Performance analysis of the discrete-time GI/Geom/1/N queue
cites work: Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\)
cites work: Q5641897
cites work: A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue
cites work: A Class of Approximations for the Waiting Time Distribution in aGI/G/1 Queueing System
cites work: Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
cites work: Simultaneity in discrete-time single server queues with Bernoulli inputs
cites work: Q4943598
cites work: Birth-and-death processes on the integers with phases and general boundaries
cites work: Q3326556
cites work: An Elementary Solution of the Queuing System G/G/1
cites work: A logarithmic reduction algorithm for quasi-birth-death processes
cites work: Introduction to Matrix Analytic Methods in Stochastic Modeling
cites work: A single-server queue with vacations and gated time-limited service
cites work: Q3546273
cites work: Q3923308
cites work: On the stationary waiting-time distribution in the GI/G/1 queue, I: Transform methods and almost-phase-type distributions
cites work: Phase-type representations for matrix-geometric solutions
cites work: Q5690359
cites work: Operator-geometric stationary distributions for markov chains, with application to queueing models
cites work: On steady-state queue size distributions of the discrete-time GI/G/1 queue
description: scientific article; zbMATH DE number 1907710