Show simple item record

Monotonicity of Throughput in Non-Markovian Networks.

dc.contributor.authorTsoucas, P.en_US
dc.contributor.authorWalrand, J.en_US
dc.date.accessioned2007-05-23T09:42:20Z
dc.date.available2007-05-23T09:42:20Z
dc.date.issued1988en_US
dc.identifier.urihttp://hdl.handle.net/1903/4822
dc.description.abstractMonotonicity of throughput is established in some non-Markovian queueing networks by means of path-wise comparisons. In a series of DOT/GI/s/N queues with loss at the first node it is proved that increasing the waiting room and/or the number of servers increases the throughput. For a closed network of DOT/GI/s queues it is shown that the throughput increases as the total number of jobs increases. The technique used for these results does not apply to blocking systems with finite buffers and feedback. Using a stronger coupling argument we prove throughput monotonicity as a function of buffer size for a series of two DOT/M/1/N queues with loss and feedback from the second to the first node.en_US
dc.format.extent363077 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1988-96en_US
dc.titleMonotonicity of Throughput in Non-Markovian Networks.en_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record