skip to main content
article

Robustness of threshold policies in beneficiary-donor model

Published: 01 September 2005 Publication History

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.

References

[1]
H. Ahn, I. Duenyas, and R. Zhang. Optimal control of a flexible server. Advances in Applied Probability, 36:139--170, 2004.
[2]
S. Bell and R. Williams. Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: Asymptotic optimality of a continuous review threshold policy. Annals of Applied Probability, 11:608--649, 2001.
[3]
D. Cox and W. Smith. Queues. Kluwer Academic Publishers, 1971.
[4]
N. Gans, G. Koole, and A. Mandelbaum. Telephone call centers: Tutorial, review and research prospects. Manufacturing and Service Operations Management, 5(2):79--141, 2003.
[5]
L. Green. A queueing system with general use and limited use servers. Operations Research, 33(1):168--182, 1985.
[6]
J. M. Harrison. Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete review policies. Annals of Applied Probability, 8(3):822--848, 1998.
[7]
S. Meyn. Sequencing and routing in multiclass queueing networks part i: Feedback regulation. SIAM Journal on Control Optimization, 40(3):741--776, 2001.
[8]
T. Osogami, M. Harchol-Balter, A. Scheller-Wolf, and L. Zhang. Exploring threshold-based policies for load sharing. In 42nd Annual Allerton Conference on Communication, Control, and Computing, Sept. 2004.
[9]
M. Squillante, C. Xia, D. Yao, and L. Zhang. Threshold-based priority policies for parallel-server systems with affinity scheduling. In IEEE American Control Conference, pages 2992--2999, June 2001.
[10]
R. Williams. On dynamic scheduling of a parallel server system with complete resource pooling. In D. McDonald and S. Turner, editors, Analysis of Communication Networks: Call Centers, Traffic and Performance. American Mathematical Society, 2000.

Cited By

View all
  • (2008)To Pool or Not to Pool in Call CentersProduction and Operations Management10.3401/poms.1080.002917:3(296-305)Online publication date: 1-May-2008
  • (2008)An Exact and Efficient Algorithm for the Constrained Dynamic Operator Staffing Problem for Call CentersManagement Science10.1287/mnsc.1070.081954:2(339-353)Online publication date: Feb-2008

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 33, Issue 2
Special issue on the workshop on MAthematical performance Modeling And Analysis (MAMA 2005)
September 2005
43 pages
ISSN:0163-5999
DOI:10.1145/1101892
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 2005
Published in SIGMETRICS Volume 33, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2008)To Pool or Not to Pool in Call CentersProduction and Operations Management10.3401/poms.1080.002917:3(296-305)Online publication date: 1-May-2008
  • (2008)An Exact and Efficient Algorithm for the Constrained Dynamic Operator Staffing Problem for Call CentersManagement Science10.1287/mnsc.1070.081954:2(339-353)Online publication date: Feb-2008

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media