Delay-Join the Shortest Queue Routing for a Parallel Queueing System with Removable Servers

Published Online:https://doi.org/10.1287/stsy.2021.0090

References

  • Aalto S, Lassila P (2019) Near-optimal dispatching policy for energy-aware server clusters. Performance Evaluation 135:102034.Google Scholar
  • Badian-Pessot P, Lewis ME, Down DG (2021) Optimal control policies for an M/M/1 queue with a removable server and dynamic service rates. Probab. Engrg. Inform. Sci. 35(2):189–209.Google Scholar
  • Barroso LA, Hölzle U (2007) The case for energy-proportional computing. IEEE Comput. 40(12):33–37.Google Scholar
  • Chen H (1995) Fluid approximations and stability of multiclass queueing networks: Work-conserving disciplines. Ann. Appl. Probab. 5(3):637–665.Google Scholar
  • Chen Y, Das A, Qin W, Sivasubramaniam A, Wang Q, Gautam N (2005) Managing server energy and operational costs in hosting centers. ACM SIGMETRICS Performance Evaluation Rev. 33(1):303–314.Google Scholar
  • Dahmus JB, Gutowski TG (2004) An environmental analysis of machining. ASME 2004 Internat. Mechanical Engrg. Congress Exposition (American Society of Mechanical Engineers, Manufacturing Engineering Division, MED). 10.1115/IMECE2004-62600.Google Scholar
  • Dai JG (1995) On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. 5(1):49–77.Google Scholar
  • Dai JG, Meyn SP (1995) Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Trans. Automatic Control 40(11):1889–1904.Google Scholar
  • Duflou JR, Sutherland JW, Dornfeld D, Herrmann C, Jeswiet J, Kara S, Hauschild M, Kellens K (2012) Toward energy and resource efficient manufacturing: A processes and systems approach. CIRP Ann. 61(2):587–609.Google Scholar
  • Foss S, Chernova N (1998) On the stability of a partially accessible multi-station queue with state-dependent routing. Queueing Systems 29(1):55–73.Google Scholar
  • Frigerio N, Matta A (2014) Energy-efficient control strategies for machine tools with stochastic arrivals. IEEE Trans. Automation Sci. Engrg. 12(1):50–61.Google Scholar
  • Frigerio N, Matta A (2015) Analysis on energy efficient switching of machine tool with stochastic arrivals and buffer information. IEEE Trans. Automation Sci. Engrg. 13(1):238–246.Google Scholar
  • Fysikopoulos A, Pastras G, Vlachou A, Chryssolouris G (2014) An approach to increase energy efficiency using shutdown and standby machine modes. IFIP Internat. Conf. Adv. Production Management Systems (Springer, Berlin), 205–212.Google Scholar
  • Gandhi A, Harchol-Balter M, Adan I (2010a) Server farms with setup costs. Performance Evaluation 67(11):1123–1138.Google Scholar
  • Gandhi A, Harchol-Balter M, Kozuch MA (2012) Are sleep states effective in data centers? 2012 Internat. Green Comput. Conf. (IGCC) (IEEE, Piscataway, NJ), 1–10.Google Scholar
  • Gandhi A, Doroudi S, Harchol-Balter M, Scheller-Wolf A (2013) Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward. Proc. ACM SIGMETRICS/Internat. Conf. Measurement Model. Comput. Systems (ACM, New York), 153–166.Google Scholar
  • Gandhi A, Gupta V, Harchol-Balter M, Kozuch MA (2010b) Optimality analysis of energy-performance trade-off for server farm management. Performance Evaluation 67(11):1155–1171.Google Scholar
  • Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manufacturing Service Oper. Management 4(3):208–227.LinkGoogle Scholar
  • Gog I, Schwarzkopf M, Gleave ANM, Watson R, Hand S (2013) Firmament: Fast, centralized cluster scheduling at scale. 12th USENIX Sympos. Operating Systems Design Implementation (USENix Corporation, Berkeley, CA).Google Scholar
  • Guo X, Zhou S, Niu Z, Kumar P (2013) Optimal wake-up mechanism for single base station with sleep mode. Proc. 2013 25th Internat. Teletraffic Congress (ITC) (IEEE, Piscataway, NJ), 1–8.Google Scholar
  • Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.LinkGoogle Scholar
  • Hyytiä E, Down D, Lassila P, Aalto S (2018) Dynamic control of running servers. Internat. Conf. Measurement Model. Evaluation Comput. Systems (Springer, New York), 127–141.Google Scholar
  • Koole G, Mandelbaum A (2002) Queueing models of call centers: An introduction. Ann. Oper. Res. 113(1-4):41–59.Google Scholar
  • Krioukov A, Mohan P, Alspaugh S, Keys L, Culler D, Katz R (2011) NapSAC: Design and implementation of a power-proportional web cluster. ACM SIGCOMM Comput. Comm. Rev. 41(1):102–108.Google Scholar
  • Lin M, Wierman A, Andrew LL, Thereska E (2012) Dynamic right-sizing for power-proportional data centers. IEEE/ACM Trans. Networking 21(5):1378–1391.Google Scholar
  • Lu Y, Xie Q, Kliot G, Geller A, Larus JR, Greenberg A (2011) Join-idle-queue: A novel load balancing algorithm for dynamically scalable web services. Performance Evaluation 68(11):1056–1071.Google Scholar
  • Maccio VJ, Down DG (2015) On optimal policies for energy-aware servers. Performance Evaluation 90:36–52.Google Scholar
  • Maccio VJ, Down DG (2018) Asymptotic performance of energy-aware multiserver queueing systems with setup times. 2018 Annual Amer. Control Conf. (ACC) (IEEE, Piscataway, NJ), 6266–6272.Google Scholar
  • Marzano L, Frigerio N, Matta A (2019) Energy efficient state control of machine tools: A time-based dynamic control policy. IEEE 15th Internat. Conf. Automation Sci. Engrg. (CASE) (IEEE, Piscataway, NJ), 596–601.Google Scholar
  • Masanet E, Shehabi A, Lei N, Smith S, Koomey J (2020) Recalibrating global data center energy-use estimates. Science 367(6481):984–986.Google Scholar
  • Mukherjee D, Dhara S, Borst SC, van Leeuwaarden JS (2017) Optimal service elasticity in large-scale distributed systems. Proc. ACM Measurement Anal. Comput. Systems 1(1):1–28.Google Scholar
  • Reiman MI (1984) Some diffusion approximations with state space collapse. Baccelli F, Fayolle G, eds. Modelling and Performance Evaluation Methodology (Springer, Berlin), 207–240.Google Scholar
  • Resnick SI (1992) Adventures in Stochastic Processes (Birkhauser, Boston).Google Scholar
  • Stolyar AL (2005) Optimal routing in output-queued flexible server systems. Probab. Engrg. Inform. Sci. 19(2):141–189.Google Scholar
  • Sze DY (1984) A queueing model for telephone operator staffing. Oper. Res. 32(2):229–249.LinkGoogle Scholar
  • Weber RR (1978) On the optimal assignment of customers to parallel servers. J. Appl. Probab. 15(2):406–413.Google Scholar
  • Whitt W (2002) Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and their Application to Queues (Springer Science & Business Media, Berlin).Google Scholar
  • Winston W (1977) Optimality of the shortest line discipline. J. Appl. Probab. 14(1):181–189.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.