Convexity Results for Parallel Queues with Bernoulli Routing

Simple item page
dc.contributor.authorGun, Leventen_US
dc.contributor.authorJean-Marie, Alainen_US
dc.contributor.authorMakowski, Armand M.en_US
dc.contributor.authorTedijanto, T.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:46:08Z
dc.date.available2007-05-23T09:46:08Z
dc.date.issued1990en_US
dc.description.abstractIn this note, we derive various convexity and monotonicity properties of performance measures in parallel GI/GI/1 queues with Bernoulli routing. We then use these results to establish that the equilikely assignment is optimal among all Bernoulli routing. The main tools are notions of stochastic convexity recently introduced by Shaked and Shanthikumar. The optimality results are couched in terms of the stochastic orderings st and icx.en_US
dc.format.extent752394 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5000
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1990-52en_US
dc.subjectBernoulli routingen_US
dc.subjectstochastic convexityen_US
dc.subjectLindley recursionen_US
dc.subjectequilikely assignmenten_US
dc.subjectCommunication en_US
dc.subjectSignal Processing Systemsen_US
dc.titleConvexity Results for Parallel Queues with Bernoulli Routingen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_90-52.pdf
Size:
734.76 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports