IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v12y2006i1d10.1007_s10878-006-8903-1.html
   My bibliography  Save this article

Resource allocation for restoration of compromised systems

Author

Listed:
  • Qunwei Zheng

    (University of Alabama)

  • Sibabrata Ray

    (University of Alabama)

  • Xiaoyan Hong

    (University of Alabama)

Abstract

Computer systems are constantly under the threats of being attacked and in many cases these attacks succeed. Today’s networked systems are thus built to be intrusion tolerant. In a large scale, the progresses of compromising the networked system and recovering the damage will carry on in parallel, allowing services to be continued (at a degraded level). One of the key problems in the restoration procedure regards to the resource allocation strategies and the cost associated with, specifically, a minimal cost is desired. In this paper we model the cost as a sum of service loss and resource expense that incur during the restoration procedure. We investigate the achievable minimal total cost and corresponding resource allocation strategy for different situations. The situations include both constant rates and time-variant rates in terms of the speed of compromising and recovering. We also consider the fact that the restoration rate is constrained by the resource allocated. The relationship can be either linear or obeying the law of diminishing marginal utility. We present both analytical and numerical results in the paper. The results show the impact from various system parameters on the critical conditions for a successful system restoration and on the minimal cost.

Suggested Citation

  • Qunwei Zheng & Sibabrata Ray & Xiaoyan Hong, 2006. "Resource allocation for restoration of compromised systems," Journal of Combinatorial Optimization, Springer, vol. 12(1), pages 35-56, September.
  • Handle: RePEc:spr:jcomop:v:12:y:2006:i:1:d:10.1007_s10878-006-8903-1
    DOI: 10.1007/s10878-006-8903-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-8903-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-006-8903-1?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:12:y:2006:i:1:d:10.1007_s10878-006-8903-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.