IDEAS home Printed from https://ideas.repec.org/a/wly/apsmbi/v29y2013i1p61-78.html
   My bibliography  Save this article

Software rejuvenation and resource reservation policies for optimizing server resource availability using cyclic nonhomogeneous Markov chains

Author

Listed:
  • V. P. Koutras
  • A. N. Platis
  • G. A. Gravvanis

Abstract

Software rejuvenation is modeled in a client–server system, which provides resources to priority classes of users. To assure availability, resource reservation policies are adopted for the higher priority classes. In addition software rejuvenation is proposed to optimize resource availability. The system is modeled by a cyclic nonhomogeneous Markov chain to capture the variation of the arrival and service rates during a day period. An optimization problem is solved based on a similar previous work and given the optimal resource reservation policy obtained by its solution, rejuvenation is performed and the optimal rejuvenation policy is determined. As a measure of resource availability the blocking probability of each priority class is used. Performability indicators expressing the total cost are also derived, with respect to the optimal resource reservation and optimal rejuvenation policies, to examine whether rejuvenation benefits the system in terms of cost. To derive the blocking probabilities, the limiting probability distribution is computed using explicit generalized approximate inverse preconditioning for solving efficiently sparse linear systems of algebraic equations. Copyright © 2012 John Wiley & Sons, Ltd.

Suggested Citation

  • V. P. Koutras & A. N. Platis & G. A. Gravvanis, 2013. "Software rejuvenation and resource reservation policies for optimizing server resource availability using cyclic nonhomogeneous Markov chains," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 29(1), pages 61-78, January.
    • Handle: RePEc:wly:apsmbi:v:29:y:2013:i:1:p:61-78
    DOI: 10.1002/asmb.945
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asmb.945
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asmb.945?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:wly:apsmbi:v:29:y:2013:i:1:p:61-78. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1526-4025 .

    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.