Delay-Minimizing Capacity Allocation in an Infinite Server-Queueing System

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

References

  • Apostol TM (1974) Mathematical Analysis (Pearson, New York).Google Scholar
  • Armony M (2005) Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems 51(3/4):287–329.Google Scholar
  • Atar R, Goswami A, Shwartz A (2013) Risk-sensitive control for the parallel server model. SIAM J. Control Optim. 51(6):4363–4386.Google Scholar
  • Balsamo S, Donatiello L, Dijk NMV (1998) Bound performance models of heterogeneous parallel processing systems. IEEE Trans. Parallel Distributed Systems 9(10):1041–1056.Google Scholar
  • Barbu V, Precupanu T (2012) Convexity and Optimization in Banach Spaces (Kluwer, Hingham, MA).Google Scholar
  • Coffman EG Jr, Kadota T, Shepp LA (1985) A stochastic model of fragmentation in dynamic storage allocation. SIAM J. Comput. 14(2):416–425.Google Scholar
  • Cooper RB (1976) Queues with ordered servers that work at different rates. Opsearch 13(2):69–78.Google Scholar
  • Cooper RB, Palakurthi S (1989) Heterogeneous-server loss systems with ordered entry: An anomaly. Oper. Res. Lett. 8(6):347–349.Google Scholar
  • Eschenfeldt P, Gamarnik D (2018) Join the shortest queue with many servers. The heavy-traffic asymptotics. Math. Oper. Res. 43(3):867–886.LinkGoogle Scholar
  • Foss S, Korshunov D, Zachary S (2011) An Introduction to Heavy-Tailed and Subexponential Distributions (Springer, Hoboken, NJ).Google Scholar
  • Grinold R (1983) Convex infinite horizon programs. Math. Programming 25(1):64–82.Google Scholar
  • Hassin R, Shaki YY, Yovel U (2015) Optimal service-capacity allocation in a loss system. Naval Res. Logist. 62(2):81–97.Google Scholar
  • Khazaei H, Misic J, Misic VB (2012) Performance analysis of cloud computing centers using M/G/m/m+r queuing systems. IEEE Trans. Parallel Distributed Systems 23(5):936–943.Google Scholar
  • Khazaei H, Misic J, Misic VB (2013) A fine-grained performance model of cloud computing centers. IEEE Trans. Parallel Distributed Systems 24(11):2138–2147.Google Scholar
  • Kleinrock L (1976) Computer Applications, Queueing Systems, vol. 2 (Wiley, Hoboken, NJ).Google Scholar
  • Knessl C (2004) Some asymptotic results for the M/M/∞queue with ranked servers. Queueing Systems 47(3):201–250.Google Scholar
  • Nath GB, Enns EG (1981) Optimal service rates in the multiserver loss system with heterogeneous servers. J. Appl. Probab. 18(3):776–781.Google Scholar
  • Newell GF (1984) The M/M∞ Service System with Ranked Servers in Heavy Traffic (Springer, Hoboken, NJ).Google Scholar
  • Riordan J (1962) Stochastic Service Systems (Wiley, New York).Google Scholar
  • Rosberg Z, Makowski AM (1990) Optimal routing to parallel heterogeneous servers-small arrival rates. IEEE Trans. Automatic Control 35(7):789–796.Google Scholar
  • Ross SM (2014) Optimal server selection in a queueing loss model with heterogeneous exponential servers, discriminating arrivals, and arbitrary arrival times. J. Appl. Probab. 51(3):880–884.Google Scholar
  • Shanthikumar JG, Yao DD (1987) Optimal server allocation in a system of multi-server stations. Management Sci. 33(9):1173–1180.LinkGoogle Scholar
  • Tahara A, Nishida T (1975) Optimal allocation of service rates for multi-server markovian queue. J. Oper. Res. Soc. Japan 18(1/2):90–95.Google Scholar
  • Takacs L (1959) On the limiting distribution of the number of coincidences concerning telephone traffic. Ann. Math. Statist. 30(1):134–142.Google Scholar
  • Vilaplana J, Solsona F, Teixidó I, Mateo J, Abella F, Rius J (2014) A queuing theory model for cloud computing. J. Supercomput. 69(1):492–507.Google Scholar
  • Wei Q, Guo X (2011) Markov decision processes with state-dependent discount factors and unbounded rewards/costs. Oper. Res. Lett. 39(5):369–374.Google Scholar
  • Whitt W (1984) Heavy-traffic approximations for service systems with blocking. AT&T Bell Labs Tech. J. 63(5):689–708.Google Scholar
  • Yao DD (1986) Convexity properties of the overflow in an ordered-entry system with heterogeneous servers. Oper. Res. Lett. 5(3):145–147.Google Scholar
  • Yao DD (1987) The arrangement of servers in an ordered-entry system. Oper. Res. 35(5):759–763.LinkGoogle Scholar
  • Zreikat A, Bolch G, Sztrik J (2003) Performance modelling of nonhomogeneous unreliable multiserver systems using mosel. Comput. Math. Appl. 46(2):293–312.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.