Information and Memory in Dynamic Resource Allocation

References

• Ananthanarayanan G, Hung MC-C, Ren X, Stoica I, Wierman A, Yu M (2014) GRASS: Trimming stragglers in approximation analytics. Proc. 11th USENIX Sympos. Networked Systems Design Implementation (NSDI 14), 289–302Google Scholar
• Armbrust M, Fox A, Griffith R, Joseph A, Katz R, Konwinski A, Lee G, et al. (2010) Above the clouds: A view of cloud computing. Comm. ACM 53(4):50–58.Crossref, Google Scholar
• Atar R, Lipschutz D (2019) Heavy-traffic limits for join-the-shortest-estimated-queue policy using delayed information. Technical report, Technion, Haifa, Israel.Google Scholar
• Badonnel R, Burgess M (2008). Dynamic pull-based load balancing for autonomic servers. Network Oper. Management Sympos. 2008 (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 751–754.Google Scholar
• Baharian G, Tezcan T (2011) Stability analysis of parallel server systems under longest queue first. Math. Methods Oper. Res. 74(2):257–279.Crossref, Google Scholar
• Carter AJ, Davis KA, Evans LV, Cone DC (2009) Information loss in emergency medical services handover of trauma patients. Prehospital Emergency Care 13(3):280–285.Crossref, Google Scholar
• Chen H, Harrison JM, Mandelbaum A, van Ackere A, Wein L (1988) Empirical evaluation of a queueing network model for semiconductor wafer fabrication. Oper. Res. 36(2):202–215.Link, Google Scholar
• Chowdhury M, Stoica I (2015) Efficient coflow scheduling without prior knowledge. Proc. ACM Conf. Special Interest Group Data Comm. (Association for Computing Machinery, New York).Google Scholar
• Dai JG, Lin W (2005) Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2):197–218.Google Scholar
• Dai JG, Prabhakar B (2000) The throughput of data switches with and without speedup. Proc. IEEE Infocom (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 556–564.Google Scholar
• Dimakis A, Walrand J (2006) Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits. Adv. Appl. Probab. 38(2):505–521.Crossref, Google Scholar
• Gamarnik D, Tsitsiklis JN, Zubeldia M (2018) Delay, memory, and messaging tradeoffs in distributed service systems. Stochastic Systems 8(1):45–74.Link, Google Scholar
• Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2):79–177.Google Scholar
• Hajek B (2015) Random Processes for Engineers (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Harrison JM (2000) Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10(1):75–103.Crossref, Google Scholar
• Harrison JM (2002) Stochastic networks and activity analysis. Translations of the American Mathematical Society: Series 2, vol. 207 (American Mathematical Society, Providence, RI), 53–76.Crossref, Google Scholar
• Harrison JM (2003) Correction: “Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 16(3):1703–1732.Crossref, Google Scholar
• Harrison JM, Zeevi A (2005) A method for staffing large call centers based on stochastic fluid models. Manufacturing Service Oper. Management 7(1):20–36.Link, Google Scholar
• Krishnasamy S, Arapostathis A, Johari R, Shakkottai S (2018) On learning the cμ rule in single and parallel server networks. Proc. 56th Annual Allerton Conf. Commun. Control Comput. (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 153–154.Google Scholar
• Krishnasamy S, Sen R, Johari R, Shakkottai S (2016) Regret of queueing bandits. Lee DD, Sugiyama M, Luxburg UV, Guyon I, Garnett R, eds. Advances in Neural Information Processing Systems, vol. 29 (Curran Associates, Red Hook, NY), 1669–1677.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.Crossref, Google Scholar
• Mandelbaum A, Stolyar AL (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6):836–855.Link, Google Scholar
• Manojlovich M, Adler-Milstein J, Harrod M, Sales A, Hofer TP, Saint S, Krein SL (2015) The effect of health information technology on health care provider communication: A mixed-method protocol. JMIR Res. Protocols 4(2):e72.Crossref, Google Scholar
• McKeown N, Anantharam V, Walrand J (1996) Achieving 100% throughput in an input-queued switch. Proc. IEEE Infocom (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 296–302.Google Scholar
• Mitzenmacher M (2001) The power of two choices in randomized load balancing. IEEE Trans. Parallel Distributed Systems 12(10):1094–1104.Crossref, Google Scholar
• Pedarsani R, Walrand J, Zhong Y (2017) Robust scheduling for flexible processing networks. Adv. Appl. Probab. 49(2):603–628.Crossref, Google Scholar
• Pender J, Rand R, Wesson E (2020) A stochastic analysis of queues with customer choice and delayed information. Math. Oper. Res. 45(3):1104–1126.Link, Google Scholar
• Pothier D, Monteiro P, Mooktiar M, Shaw A (2005) Pilot study to show the loss of important data in nursing handover. British J. Nursing 14(20):1090–1093.Crossref, Google Scholar
• Roberts JW, Massoulié L (2000) Bandwidth sharing and admission control for elastic traffic. Telecomm. Systems 15(1–2):185–201.Google Scholar
• Sahai A, Mitter S (2006) The necessity and sufficiency of anytime capacity for stabilization of a linear system over a noisy communication link—part I: Scalar systems. IEEE Trans. Inform. Theory 8(52):3369–3395.Crossref, Google Scholar
• Shah D, Wischik D (2012) Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. 22(1):70–127.Crossref, Google Scholar
• Spencer J, Sudan M, Xu K (2014) Queuing with future information. Ann. Appl. Probab. 24(5):2091–2142.Crossref, Google Scholar
• Stolyar A, Yudovina E (2012) Tightness of invariant distributions of a large-scale flexible service system under a priority discipline. Stochastic Systems 2(2):381–408.Link, Google Scholar
• Stolyar AL (2004) Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14(1):1–53.Crossref, Google Scholar
• Stolyar AL (2015) Pull-based load distribution in large-scale heterogeneous service systems. Queueing Systems 80(4):341–361.Crossref, Google Scholar
• Stolyar AL (2017) Pull-based load distribution among heterogeneous parallel servers: The case of multiple routers. Queueing Systems 85(1–2):31–65.Crossref, Google Scholar
• Tassiulas L, Ephremides A (1992) Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automatic Control 37(12):1936–1948.Crossref, Google Scholar
• Tatikonda S, Mitter S (2004) Control-under communication constraints. IEEE Trans. Automatic Control 49(7):1056–1068.Crossref, Google Scholar
• Tsitsiklis JN, Xu K (2012) On the power of (even a little) resource pooling. Stochastic Systems 2(1):1–66.Link, Google Scholar
• Vvedenskaya ND, Dobrushin RL, Karpelevich FI (1996) Queueing system with selection of the shortest of two queues: An asymptotic approach. Problemy Peredachi Informatsii 32(1):20–34.Google Scholar
• Ward AR, Armony M (2013) Blind fair routing in large-scale service systems with heterogeneous customers and servers. Oper. Res. 61(1):228–243.Link, Google Scholar
• Xu K (2015) Necessity of future information in admission control. Oper. Res. 63(5):1213–1226.Link, Google Scholar
• Yüksel S, Başar T (2013) Stochastic Networked Control Systems: Stabilization and Optimization under Information Constraints (Springer Science & Business Media, New York).Crossref, Google Scholar
• Zats D, Iyer AP, Ananthanarayanan G, Agarwal R, Katz R, Stoica I, Vahdat A (2015) Fastlane: Making short flows shorter with agile drop notification. Proc. 6th ACM Sympos. Cloud Comput. (ACM, New York), 84–96.Google Scholar