Numerical Methods for M/G/1 Type Queues
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T22:31:16Z | |
| dc.date.available | 2004-05-31T22:31:16Z | |
| dc.date.created | 1995-03 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.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) | en_US |
| dc.format.extent | 167256 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/712 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3440 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-95-37 | en_US |
| dc.title | Numerical Methods for M/G/1 Type Queues | en_US |
| dc.type | Technical Report | en_US |