IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i10p909-d272523.html
   My bibliography  Save this article

Optimal Resource Allocation Model and Algorithm for Elastic Enterprise Applications Migration to the Cloud

Author

Listed:
  • Shiyong Li

    (School of Economics and Management, Yanshan University, Qinhuangdao 066004, China
    These authors contributed equally to this work.)

  • Yue Zhang

    (School of Economics and Management, Yanshan University, Qinhuangdao 066004, China
    These authors contributed equally to this work.)

  • Wei Sun

    (School of Economics and Management, Yanshan University, Qinhuangdao 066004, China
    These authors contributed equally to this work.)

Abstract

Cloud computing has been widely used in various industries in recent years. However, when migrating enterprise applications into the cloud, enterprise users face a problem with minimizing migration time and cloud resource providers face a dilemma of resource allocation problem, with the objective of maximizing the migration utility of enterprise users while minimizing the cost of cloud resource providers. In order to achieve them, this paper considered cloud migration objectives including cloud migration time, cloud migration utility, and cloud data center cost, and proposed a resource allocation model for enterprise applications migration into the cloud. The model is divided into two stages: the bandwidth allocation for enterprise applications migration to the cloud and the physical resource allocation of cloud resource providers for enterprise applications deployment into the cloud. In the first stage, we aim to minimize the cloud migration time for enterprise applications, and propose a scheme of bandwidth allocation for each component of applications. In the second stage, we present the resource allocation of cloud resource providers and propose a gradient-based algorithm which can achieve optimal resource allocation. Finally, we give some numerical simulation results to illustrate the performance of the proposed algorithm.

Suggested Citation

  • Shiyong Li & Yue Zhang & Wei Sun, 2019. "Optimal Resource Allocation Model and Algorithm for Elastic Enterprise Applications Migration to the Cloud," Mathematics, MDPI, vol. 7(10), pages 1-20, October.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:10:p:909-:d:272523
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/10/909/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/10/909/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Shiyong Li & Wei Sun, 2016. "A mechanism for resource pricing and fairness in peer-to-peer networks," Electronic Commerce Research, Springer, vol. 16(4), pages 425-451, December.
    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. Shiyong Li & Wei Sun & Huan Liu, 2022. "Optimal resource allocation for multiclass services in peer-to-peer networks via successive approximation," Operational Research, Springer, vol. 22(3), pages 2605-2630, July.

    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. Satish Kumar & Weng Marc Lim & Nitesh Pandey & J. Christopher Westland, 2021. "20 years of Electronic Commerce Research," Electronic Commerce Research, Springer, vol. 21(1), pages 1-40, March.
    2. Shiyong Li & Wei Sun & Huan Liu, 2022. "Optimal resource allocation for multiclass services in peer-to-peer networks via successive approximation," Operational Research, Springer, vol. 22(3), pages 2605-2630, July.

    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:gam:jmathe:v:7:y:2019:i:10:p:909-:d:272523. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.