Abstract

Matrix exponential (ME) distributions not only include the well-known class of phase-type distributions but also can be used to approximate more general distributions (e.g., deterministic, heavy-tailed, etc.). In this paper, a novel mathematical framework and a numerical algorithm are proposed to calculate the matrix exponential representation for the steady-state waiting time in an ME/ME/1 queue. Using state–space algebra, the waiting time calculation problem is shown to reduce to finding the solution of an ordinary differential equation in state–space form with order being the sum of the dimensionalities of the inter-arrival and service time distribution representations. A numerically efficient algorithm with quadratic convergence rates based on the matrix sign function iterations is proposed to find the boundary conditions of the differential equation. The overall algorithm does not involve any transform domain calculations such as root finding or polynomial factorization, which are known to have potential numerical stability problems. Numerical examples are provided to demonstrate the effectiveness of the proposed approach.

Keywords: GI/GI/1 queue; Lindley's equation; Matrix exponential distribution; Realization theory; Matrix sign function

Article Outline

1. Introduction

2. Spectral divide-and-conquer problem and the matrix sign function

3. Waiting times in the ME/ME/1 queue

4. Numerical examples

4.1. Example 1: PH/PH/1 queue

4.2. Example 2: D/ME/1 queue

5. Conclusions

Acknowledgements

References