IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v65y2018i1p221-241.html
   My bibliography  Save this article

Optimal Resource Capacity Management for Stochastic Networks

Author

Listed:
  • A. B. Dieker

    (Industrial Engineering and Operations Research, Columbia University, New York, New York 10027)

  • S. Ghosh

    (Mathematical Sciences Department, IBM Research, Yorktown Heights, New York 10598)

  • M. S. Squillante

    (Mathematical Sciences Department, IBM Research, Yorktown Heights, New York 10598)

Abstract

We develop a framework for determining the optimal resource capacity of each station composing a stochastic network, motivated by applications arising in computer capacity planning and business process management. The problem is mathematically intractable in general and therefore one typically resorts to either simplistic analytical approximations or time-consuming simulation-based optimization methods. Our solution framework includes an iterative methodology that relies only on the capability of observing the queue lengths at all network stations for a given resource capacity allocation. We theoretically investigate this proposed methodology for single-class Brownian tree networks and illustrate the use of our framework and the quality of its results through computational experiments.

Suggested Citation

  • A. B. Dieker & S. Ghosh & M. S. Squillante, 2017. "Optimal Resource Capacity Management for Stochastic Networks," Operations Research, INFORMS, vol. 65(1), pages 221-241, February.
    • Handle: RePEc:inm:oropre:v:65:y:2018:i:1:p:221-241
    DOI: 10.287/opre.2016.1554
    as

    Download full text from publisher

    File URL: https://doi.org/10.287/opre.2016.1554
    Download Restriction: no
    File URL: https://libkey.io/10.287/opre.2016.1554?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Le An & Pham Tao, 2005. "The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems," Annals of Operations Research, Springer, vol. 133(1), pages 23-46, January.
    2. Boxma, O. J. & Rinnooy Kan, A. H. G. & van Vliet, M., 1990. "Machine allocation problems in manufacturing networks," European Journal of Operational Research, Elsevier, vol. 45(1), pages 47-54, March.
    3. Martin I. Reiman, 1984. "Open Queueing Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 441-458, August.
    4. P.K. Pollett, 2009. "Optimal capacity assignment in general queueing networks," Springer Optimization and Its Applications, in: Charles Pearce & Emma Hunt (ed.), Optimization, edition 1, chapter 0, pages 261-272, Springer.
    5. Pierre L'Ecuyer & Peter W. Glynn, 1994. "Stochastic Optimization by Simulation: Convergence Proofs for the GI/G/1 Queue in Steady-State," Management Science, INFORMS, vol. 40(11), pages 1562-1578, November.
    6. Joseph Abate & Ward Whitt, 2006. "A Unified Framework for Numerically Inverting Laplace Transforms," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 408-421, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Janusz SZPYTKO & Yorlandys SALGADO DUARTE, 2021. "Robust Simulation Method Of Complex Technical Transport Systems," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 16(2), pages 101-112, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. A. B. Dieker & S. Ghosh & M. S. Squillante, 2017. "Optimal Resource Capacity Management for Stochastic Networks," Operations Research, INFORMS, vol. 65(1), pages 221-241, February.
    2. Bitran, Gabriel R. & Morabito, Reinaldo., 1994. "Open queueing networks : optimization and performance evaluation models for discrete manufacturing systems," Working papers 3743-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Min Tao & Jiang-Ning Li, 2023. "Error Bound and Isocost Imply Linear Convergence of DCA-Based Algorithms to D-Stationarity," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 205-232, April.
    4. Sokolov, Andrey & Melatos, Andrew & Kieu, Tien, 2010. "Laplace transform analysis of a multiplicative asset transfer model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(14), pages 2782-2792.
    5. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2013. "Expected Tardiness Computations in Multiclass Priority M / M / c Queues," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 364-376, May.
    6. Hoai An Le Thi & Van Ngai Huynh & Tao Pham Dinh, 2018. "Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 103-126, October.
    7. João Carlos O. Souza & Paulo Roberto Oliveira & Antoine Soubeyran, 2016. "Global convergence of a proximal linearized algorithm for difference of convex functions," Post-Print hal-01440298, HAL.
    8. Yuan, Quan & Liu, Binghui, 2021. "Community detection via an efficient nonconvex optimization approach based on modularity," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    9. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    10. Dassios, Angelos & Li, Luting, 2020. "Explicit asymptotic on first passage times of diffusion processes," LSE Research Online Documents on Economics 103087, London School of Economics and Political Science, LSE Library.
    11. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    12. Amarjit Budhiraja & Chihoon Lee, 2009. "Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 45-56, February.
    13. Dassios, Angelos & Qu, Yan & Zhao, Hongbiao, 2018. "Exact simulation for a class of tempered stable," LSE Research Online Documents on Economics 86981, London School of Economics and Political Science, LSE Library.
    14. Budhiraja, Amarjit & Lee, Chihoon, 2007. "Long time asymptotics for constrained diffusions in polyhedral domains," Stochastic Processes and their Applications, Elsevier, vol. 117(8), pages 1014-1036, August.
    15. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
    16. Crystal T. Nguyen & Daniel J. Luckett & Anna R. Kahkoska & Grace E. Shearrer & Donna Spruijt‐Metz & Jaimie N. Davis & Michael R. Kosorok, 2020. "Estimating individualized treatment regimes from crossover designs," Biometrics, The International Biometric Society, vol. 76(3), pages 778-788, September.
    17. David Landriault & Bin Li & Hongzhong Zhang, 2014. "On the Frequency of Drawdowns for Brownian Motion Processes," Papers 1403.1183, arXiv.org.
    18. Leippold, Markus & Vasiljević, Nikola, 2017. "Pricing and disentanglement of American puts in the hyper-exponential jump-diffusion model," Journal of Banking & Finance, Elsevier, vol. 77(C), pages 78-94.
    19. M. Bierlaire & M. Thémans & N. Zufferey, 2010. "A Heuristic for Nonlinear Global Optimization," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 59-70, February.
    20. Illés Horváth & András Mészáros & Miklós Telek, 2020. "Numerical Inverse Transformation Methods for Z-Transform," Mathematics, MDPI, vol. 8(4), pages 1-18, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:65:y:2018:i:1:p:221-241. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.