A matrix analytical method for the discrete time Lindley equation using the generalized Schur decomposition

Date
2006
Advisor
Instructor
Source Title
SMCTools'06: Proceeding from the 2006 Workshop on Tools for Solving Structured Markov Chains
Print ISSN
Electronic ISSN
Publisher
ACM
Volume
Issue
Pages
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Abstract

In this paper, we study the discrete time Lindley equation governing an infinite size GI/GI/1 queue. In this queuing system, the arrivals and services are independent and identically distributed but they obey a discrete time matrix geometric distribution not necessarily with finite support. Our GI/GI/1 model allows geometric batch arrivals and also treats late, early, and hybrid arrival models in a unified manner. We reduce the problem of finding the steady state probabilities for the Lindley equation to finding the generalized ordered Schur form of a matrix pair (E, A) where the size of these matrices are the sum, not the product, of the orders of individual arrival and service distributions. The approach taken in this paper is purely matrix analytical and we obtain a matrix geometric representation for the related quantities (queue lengths or waiting times) for the discrete time GI/GI/1 queue using this approach.

Course
Other identifiers
Book Title
Keywords
Discrete-time queues, Generalized ordered Schur decomposition, Lindley equation, Matrix geometric distribution, Matrix analytical methods, Probability distributions, Queueing networks
Citation
Published Version (Please cite this version)