Interchange Arguments in Stochastic Scheduling.
| dc.contributor.author | Nain, P. | en_US |
| dc.contributor.author | Walrand, J. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:42:19Z | |
| dc.date.available | 2007-05-23T09:42:19Z | |
| dc.date.issued | 1988 | en_US |
| dc.description.abstract | Interchange arguments are applied to establish the optimality of priority list policies in three problems. First, we prove that in a multi-class tandem of two M 1 queues it is always optimal in the second node to serve according to the "c MU" rule. The result holds more generally if the first node is replaced by a multi- class network consisting of M 1 queues with Bernoulli routing. Next, for scheduling a single server in a multi-class node with feedback a simplified proof of Klimov's result is given. From it follows the optimality of the index rule among idling policies for general service time distributions, and among pre-emptive policies when the service time distributions are exponential. Lastly, we consider the problem of minimizing the blocking in a communication link with lossy channels and exponential holding times. | en_US |
| dc.format.extent | 463311 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4821 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1988-95 | en_US |
| dc.title | Interchange Arguments in Stochastic Scheduling. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1