Optimal Resource Capacity Management for Stochastic Networks

References

• Abate J, Whitt W (2006) A unified framework for numerically inverting Laplace transforms. INFORMS J. Comput. 18(4):408–421.Link, Google Scholar
• Adler RJ (1990) An Introduction to Continuity, Extrema, and Related Topics for General Gaussian Processes (Institute of Mathematical Statistics, Hayward, CA).Google Scholar
• An LTH, Tao PD (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1-4):23–46.Crossref, Google Scholar
• Asmussen S, Glynn PW (2007) Stochastic Simulation: Algorithms and Analysis (Springer, New York).Crossref, Google Scholar
• Baskett F, Chandy KM, Muntz RR, Palacios-Gomez F (1975) Open, closed and mixed networks of queues with different classes of customers. J. ACM 22(2):248–260.Crossref, Google Scholar
• Bertsekas DP (2004) Nonlinear Programming, 2nd ed. (Athena Scientific, Belmont, MA).Google Scholar
• Boxma OJ, Rinnooy Kan AHG, van Vliet M (1990) Machine allocation problems in manufacturing networks. Eur. J. Oper. Res. 45:47–54.Crossref, Google Scholar
• Chen EJ, Kelton WD (2007) A procedure for generating batch-means confidence intervals for simulation: Checking independence and normality. Simulation 83(10):683–694.Crossref, Google Scholar
• Chen H, Yao DD (2001) Fundamentals of Queueing Networks, Vol. 46 (Springer-Verlag, New York).Crossref, Google Scholar
• Conn A, Gould N, Toint P (2000) Trust-Region Methods (SIAM, Philadelphia).Crossref, Google Scholar
• Dai JG, Harrison JM (1992) Reflected Brownian motion in an orthant: Numerical methods for steady-state analysis. Ann. Appl. Probab. 2(1):65–86.Crossref, Google Scholar
• Dȩbicki K, Dieker AB, Rolski T (2007) Quasi-product forms for Lévy-driven fluid networks. Math. Oper. Res. 32(3):629–647.Link, Google Scholar
• Dieker AB, Gao X (2014) Sensitivity analysis for diffusion processes constrained to an orthant. Ann. Appl. Probab. 24(5):1918–1945.Crossref, Google Scholar
• Dikaiakos MD, Katsaros D, Mehra P, Pallis G, Vakali A (2009) Cloud computing: Distributed Internet computing for IT and scientific research. IEEE Internet Comput. 13(5):10–13.Crossref, Google Scholar
• Ghosh S, Heching AR, Squillante MS (2013) A two-phase approach for stochastic optimization of complex business processes. Proc. Winter Simulation Conf., WSC ’13 (IEEE, Piscataway, NJ), 1856–1868.Crossref, Google Scholar
• Glasserman P (1991) Gradient Estimation via Perturbation Analysis (Kluwer, Amsterdam).Google Scholar
• Glover F, Kelly J, Laguna M (1999) New advances for wedding optimization and simulation. Farrington PA, Black Nembhard H, Sturrock DT, Evans GW, eds. Proc. 31st Conf. Winter Simulation Conf., WSC ’99 (IEEE, Piscataway, NJ), 255–260.Crossref, Google Scholar
• Guarisco J, Samuelson DA (2011) Rx for the ER: Service delivery model greatly improves emergency department performance. OR/MS Today 38(5):30–35.Google Scholar
• Harrison JM, Nguyen V (1990) The QNET method for two-moment analysis of open queueing networks. Queueing Systems Theory Appl. 6(1):1–32.Crossref, Google Scholar
• Harrison JM, Williams RJ (1987) Brownian models of open queueing networks with homogeneous customer populations. Stochastics 22(2):77–115.Crossref, Google Scholar
• Harrison JM, Williams RJ (1992) Brownian models of feedforward queueing networks: Quasireversibility and product form solutions. Ann. Appl. Probab. 2(2):263–293.Crossref, Google Scholar
• Heching AR, Squillante MS (2013) Stochastic decision-making in information technology services delivery. Faulin J, Juan AA, Grasman SE, Fry MJ, eds. Decision Making in Service Industries: A Practical Approach, Chap. 1 (CRC Press, Boca Raton), 3–36.Google Scholar
• Heching AR, Squillante MS (2014) Optimal capacity management and planning in services delivery centers. Performance Evaluation 80(C):63–81.Crossref, Google Scholar
• Ho YC, Cao X, Cassandras C (1983) Infinitesimal and finite perturbation analysis for queueing networks. Automatica 19(4):439–445.Crossref, Google Scholar
• Ishikawa S (1974) Fixed points by a new iteration method. Proc. American Math. Soc. 44(1):147–150.Crossref, Google Scholar
• Iyoob IM, Zarifoglu E, Dieker AB (2012) Cloud computing Operations Research. J. Service Sci. 5(2):88–101.Link, Google Scholar
• Jacod J, Protter PE (2003) Probability Essentials, Universitext (1979) (Springer, Berlin).Google Scholar
• Kelly FP (1991) Loss networks. Ann. Appl. Probab. 1(3):319–378.Crossref, Google Scholar
• Kingman JFC (1962) On queues in heavy traffic. J. Roy. Statist. Soc. Ser. B 24(2):383–392.Google Scholar
• Kleinrock L (1964) Communication Nets: Stochastic Message Flow and Delay (McGraw-Hill, New York).Google Scholar
• Kumagai S (1980) An implicit function theorem: Comment. J. Optim. Theory Appl. 31(2):285–288.Crossref, Google Scholar
• Kushner HJ, Yin GG (2003) Kushner HJ, Yin GG, eds. Stochastic Approximation and Recursive Algorithms and Applications (Springer, New York).Google Scholar
• Kushner HJ, Clark DS (1978) Stochastic approximation methods for constrained and unconstrained systems. Applied Math. Sciences, Vol. 26 (Springer-Verlag, New York).Crossref, Google Scholar
• Laguna M, Marklund J (2004) Business Process Modeling, Simulation and Design (Prentice Hall, Upper Saddle River, NJ).Google Scholar
• Latouche G, Ramaswami V (1999) Introduction to Matrix Analytic Methods in Stochastic Modeling (SIAM, Philadelphia).Crossref, Google Scholar
• L’Ecuyer P, Glynn PW (1994) Stochastic optimization by simulation: Convergence proofs for the GI/G/1 queue in steady-state. Management Sci. 40(11):1562–1578.Link, Google Scholar
• Mann WR (1953) Mean value methods in iteration. Proc. Amer. Math. Soc. 4:506–510.Crossref, Google Scholar
• Menasce D, Almeida V (1998) Capacity Planning for Web Performance: Metrics, Models, and Methods (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Menasce D, Almeida V, Dowdy L (2004) Performance by Design: Computer Capacity Planning by Example (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Nelson BL, Henderson SG, eds. (2007) Handbooks in OR and MS: Simulation (North-Holland, Amsterdam).Google Scholar
• Neuts M (1981) Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach New torks 13(2):311–312.Google Scholar
• Neuts M (1989) Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York).Google Scholar
• Pollett P (2009) Optimal capacity assignment in general queueing networks. Optimization: Structure and Applications, Vol. 32 (Springer, New York), 261–272.Crossref, Google Scholar
• Reiman MI (1984) Open queueing networks in heavy traffic. Math. Oper. Res. 9(3):441–458.Link, Google Scholar
• Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Saure D, Glynn P, Zeevi A (2009) A linear programming algorithm for computing the stationary distribution of semi-martingale reflected Brownian motion. Technical report, Columbia Business School, New York.Google Scholar
• Spall JC (1992) Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. Automatic Control, IEEE Trans. 37(3):332–341.Crossref, Google Scholar
• Squillante MS (2011) Stochastic analysis and optimization of multiserver systems. Ardagna D, Zhang L, eds. Run-time Models for Self-managing Systems and Applications, Chap. 1 (Birkhäuser, Basel, Switzerland), 1–24.Google Scholar
• Stoyan D (1983) Daley DJ, ed. Comparison Methods for Queues and Other Stochastic Models (John Wiley & Sons, New York).Google Scholar
• Wein LM (1989) Capacity allocation in generalized Jackson networks. Oper. Res. Lett. 8(3):143–146.Crossref, Google Scholar