Robustness of threshold policies in beneficiary-donor model
Authors:
Open Access
- 1 September 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 33 (2) , 36-38
Abstract
A common problem in multiserver systems is deciding how to allocate resources among jobs so as to minimize mean response time. Since good parameter settings typically depend on environmental conditions such as system loads, an allocation policy that is optimal in one environment may provide poor performance when the environment changes, or when the prediction of the environment is wrong. We say that such a policy is not robust. In this paper, we analytically compare the robustness of several threshold-based allocation policies, in a dual server beneficiary-donor model. We introduce two types of robustness: static robustness , which measures robustness against mis-estimation of the true load, and dynamic robustness , which measures robustness against fluctuations in the load. We find that policies employing multiple thresholds offer significant benefit over single threshold policies with respect to static robustness. Yet they surprisingly offer much less benefit with respect to dynamic robustness.Keywords
This publication has 9 references indexed in Scilit:
- Optimal control of a flexible serverAdvances in Applied Probability, 2004
- Telephone Call Centers: Tutorial, Review, and Research ProspectsManufacturing & Service Operations Management, 2003
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policyThe Annals of Applied Probability, 2001
- Threshold-based priority policies for parallel-server systems with affinity scheduling2001
- Sequencing and Routing in Multiclass Queueing Networks Part I: Feedback RegulationSIAM Journal on Control and Optimization, 2001
- On dynamic scheduling of a parallel server system with complete resource pooling2000
- Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policiesThe Annals of Applied Probability, 1998
- A Queueing System with General-Use and Limited-Use ServersOperations Research, 1985
- Queues1971