Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization
Author
Abstract
Suggested Citation
DOI: 10.1287/ijoc.2019.0888
Download full text from publisher
References listed on IDEAS
- Panos Parpas & Berk Ustun & Mort Webster & Quang Kha Tran, 2015. "Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 358-377, May.
- Mauro Passacantando & Danilo Ardagna & Anna Savi, 2016. "Service Provisioning Problem in Cloud and Multi-Cloud Systems," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 265-277, May.
- William H. Kaczynski & Lawrence M. Leemis & John H. Drew, 2012. "Transient Queueing Analysis," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 10-28, February.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Bo Li & Subodha Kumar, 2022. "Managing Software‐as‐a‐Service: Pricing and operations," Production and Operations Management, Production and Operations Management Society, vol. 31(6), pages 2588-2608, 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.- Xiaotie Chen & David L. Woodruff, 2024. "Distributions and bootstrap for data-based stochastic programming," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
- Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
- Oscar Dowson & Lea Kapelevich, 2021. "SDDP.jl : A Julia Package for Stochastic Dual Dynamic Programming," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 27-33, January.
- Simon Thevenin & Yossiri Adulyasak & Jean-François Cordeau, 2022. "Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3151-3169, November.
- Wei Zhang & Kai Wang & Alexandre Jacquillat & Shuaian Wang, 2023. "Optimized Scenario Reduction: Solving Large-Scale Stochastic Programs with Quality Guarantees," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 886-908, July.
- Bo Li & Subodha Kumar, 2022. "Managing Software‐as‐a‐Service: Pricing and operations," Production and Operations Management, Production and Operations Management Society, vol. 31(6), pages 2588-2608, June.
- Chaithanya Bandi & Nikolaos Trichakis & Phebe Vayanos, 2019. "Robust Multiclass Queuing Theory for Wait Time Estimation in Resource Allocation Systems," Management Science, INFORMS, vol. 65(1), pages 152-187, January.
- Narayanan C. Viswanath, 2022. "Transient study of Markov models with time-dependent transition rates," Operational Research, Springer, vol. 22(3), pages 2209-2243, July.
- Bart P. G. Van Parys & Peyman Mohajerin Esfahani & Daniel Kuhn, 2021. "From Data to Decisions: Distributionally Robust Optimization Is Optimal," Management Science, INFORMS, vol. 67(6), pages 3387-3402, June.
- Hui Dong & Marvin K. Nakayama, 2017. "Quantile Estimation with Latin Hypercube Sampling," Operations Research, INFORMS, vol. 65(6), pages 1678-1695, December.
- Manuel A. Nunez & Xue Bai & Linna Du, 2021. "Leveraging Slack Capacity in IaaS Contract Cloud Services," Production and Operations Management, Production and Operations Management Society, vol. 30(4), pages 883-901, April.
- Rodica Ioana Lung & Noémi Gaskó & Mihai Alexandru Suciu, 2020. "Pareto-based evolutionary multiobjective approaches and the generalized Nash equilibrium problem," Journal of Heuristics, Springer, vol. 26(4), pages 561-584, August.
- Fei, Xin & Gülpınar, Nalân & Branke, Jürgen, 2019. "Efficient solution selection for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 277(3), pages 918-929.
- Tahir Ekin & Stephen Walker & Paul Damien, 2023. "Augmented simulation methods for discrete stochastic optimization with recourse," Annals of Operations Research, Springer, vol. 320(2), pages 771-793, January.
- Rajib L. Saha & Sumanta Singha & Subodha Kumar, 2021. "Does Congestion Always Hurt? Managing Discount Under Congestion in a Game-Theoretic Setting," Information Systems Research, INFORMS, vol. 32(4), pages 1347-1367, December.
- Ekblom, J. & Blomvall, J., 2020. "Importance sampling in stochastic optimization: An application to intertemporal portfolio choice," European Journal of Operational Research, Elsevier, vol. 285(1), pages 106-119.
- Franks, Jordan & Vihola, Matti, 2020. "Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance," Stochastic Processes and their Applications, Elsevier, vol. 130(10), pages 6157-6183.
- Carolina Osorio & Jana Yamani, 2017. "Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks," Transportation Science, INFORMS, vol. 51(3), pages 823-840, August.
- Anna Nagurney & Min Yu & Deniz Besik, 2017. "Supply chain network capacity competition with outsourcing: a variational equilibrium framework," Journal of Global Optimization, Springer, vol. 69(1), pages 231-254, September.
- Narum, Benjamin S. & Fairbrother, Jamie & Wallace, Stein W., 2024. "Problem-based scenario generation by decomposing output distributions," European Journal of Operational Research, Elsevier, vol. 318(1), pages 154-166.
More about this item
Keywords
cloud computing; convex decomposition; Markov chains; network virtualization; ample path randomization;All these keywords.
Statistics
Access and download statisticsCorrections
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:orijoc:v:32:y:2020:i:2:p:321-345. 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.