Burst reduction properties of rate-control throttles: downstream queue behavior
IEEE/ACM Transactions on Networking (TON)
Efficient search server assignment in a disproportionate system environment
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
In this paper we consider the problem of routing customers to identical servers, each with its own infinite capacity queue. Under the assumptions that the service times form a sequence of independent and identically distributed random variables with increasing failure rate distribution and state information is not available, we establish that the round robin policy minimizes, in the sense of a separable increasing convex ordering, the customer response times and the numbers of customers in the queues. This work was supported in part by the National Science Foundation under grant ASC 88-8802764 and NCR-9116183. ******************************