Monotonicity of Throughput in Non-Markovian Networks.
| dc.contributor.author | Tsoucas, P. | en_US |
| dc.contributor.author | Walrand, J. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:42:20Z | |
| dc.date.available | 2007-05-23T09:42:20Z | |
| dc.date.issued | 1988 | en_US |
| dc.description.abstract | Monotonicity 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.extent | 363077 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4822 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1988-96 | en_US |
| dc.title | Monotonicity of Throughput in Non-Markovian Networks. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1