Bounding On-Off Sources -- Variability Ordering and Majorization to the Rescue

Simple item page
dc.contributor.authorMakowski, Armand M.en_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:11:16Z
dc.date.available2007-05-23T10:11:16Z
dc.date.issued2001en_US
dc.description.abstractWe consider the problem of bounding the loss rates of the aggregation of on-off sources in a bufferless model by the loss rates associated with the aggregation of i.i.d. on-off sources. We use well-known results from the theory of variability orderings to establish a conjecture ofRasmussen et. al., a recent upper bound of Mao and Habibi, and to discussa new conjectured upper bound by these authors.en_US
dc.format.extent238674 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6229
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2001-13en_US
dc.relation.ispartofseriesCSHCN; TR 2001-6en_US
dc.subjectGlobal Communication Systemsen_US
dc.titleBounding On-Off Sources -- Variability Ordering and Majorization to the Rescueen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2001-13.pdf
Size:
233.08 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports