Simple Proofs of Some Folk Theorems for Parallel Queues.

Simple item page
dc.contributor.authorMakowski, Armand M.en_US
dc.contributor.authorPhilips, T.K.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:43:35Z
dc.date.available2007-05-23T09:43:35Z
dc.date.issued1989en_US
dc.description.abstractWe present simple proofs of some folk theorems for systems of identical single server queues operating in parallel. In particular we establish a monotonicity property in the number of servers, and show that round-robin customer assignment outperforms random customer assignment. The results are couched in terms of stochastic orderings and hold in great generality.en_US
dc.format.extent619355 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4885
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1989-37en_US
dc.titleSimple Proofs of Some Folk Theorems for Parallel Queues.en_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_89-37.pdf
Size:
604.84 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports