|
DRUM >
College of Computer, Mathematical & Natural Sciences >
Computer Science >
Technical Reports from UMIACS >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1903/712
|
| Title: | Numerical Methods for M/G/1 Type Queues |
| Authors: | Stewart, G. W. |
| Type: | Technical Report |
| Issue Date: | 15-Oct-1998 |
| Series/Report no.: | UM Computer Science Department; CS-TR-3440
UMIACS; UMIACS-TR-95-37 |
| Abstract: | Queues of M/G/1 type give rise to infinite embedded
Markov chains whose transition matrices are upper block Hessenberg. The
traditional algorithms for solving these queues have involved the
computation of an intermediate matrix G. Recently a recursive descent
method for solving block Hessenberg systems has been proposed. In this
paper we explore the interrelations of the two methods.
(Also cross-referenced as UMIACS-TR-95-37) |
| URI: | http://hdl.handle.net/1903/712 |
| Appears in Collections: | Technical Reports of the Computer Science Department
Technical Reports from UMIACS
|
All items in DRUM are protected by copyright, with all rights reserved.
|
