On a Random Sum Formula for the Busy Period of the M|G|Infinity Queue with Applications

Simple item page
dc.contributor.authorMakowski, Armand M.en_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:11:13Z
dc.date.available2007-05-23T10:11:13Z
dc.date.issued2001en_US
dc.description.abstractA random sum formula is derived for the forward recurrence time associated with the busy period length of the M|G|infinity queue. This result is then used to (1) provide a necessary and sufficient condition for the subexponentiality of this forward recurrence time, and (2) establish a stochastic comparison in the convex increasing (variability) ordering betweenthe busy periods in two M|G|infinity queues with service times comparablein the convex increasing ordering.en_US
dc.format.extent695548 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6227
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2001-9en_US
dc.relation.ispartofseriesCSHCN; TR 2001-4en_US
dc.subjectGlobal Communication Systemsen_US
dc.titleOn a Random Sum Formula for the Busy Period of the M|G|Infinity Queue with Applicationsen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2001-9.pdf
Size:
679.25 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports