Drum Models Using an Iterative Solution for Closed Queueing Networks

Simple item page
dc.contributor.authorHine, J.H.en_US
dc.contributor.authorFitzwater, D.R.en_US
dc.date.accessioned2012-03-15T16:23:25Z
dc.date.available2012-03-15T16:23:25Z
dc.date.created1974en_US
dc.date.issued1974en
dc.description.abstractAn algorithm by Buzen to find the normalizing constant and marginal probabilities in a closed queueing network is generalized to the model of Muntz and Baskett. A technique involving the iterative solution of a closed queueing network to implement queue dependent completion time distribution is presented. An accurate model of a paging drum for queueing networks is given as an example.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR200en
dc.identifier.urihttp://digital.library.wisc.edu/1793/57844
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleDrum Models Using an Iterative Solution for Closed Queueing Networksen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR200.pdf
Size:
2.44 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports