Metaheuristic approaches to virtual machine placement in cloud computing: a review

Dabiah Ahmed Alboaneen, Huaglory Tianfield, Yan Zhang

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    98 Downloads (Pure)

    Abstract

    Virtual machine placement (VMP) is mapping virtual machines (VMs) to appropriate physical machines (PMs) to achieve satisfactory objectives such as minimised energy consumption or maximised performance. VMP is considered as a non-deterministic polynomial-time hard (NP-hard) problem. Metaheuristic techniques are able to find near-optimal solutions to NP-hard problems. This paper presents a review upon metaheuristic approaches to VMP in cloud computing.
    Original languageEnglish
    Title of host publication15th International Symposium on Parallel and Distributed Computing (ISPDC), 2016
    PublisherIEEE
    Number of pages8
    ISBN (Electronic)9781509041527
    DOIs
    Publication statusPublished - 24 Apr 2017

    Fingerprint

    Cloud computing
    Polynomials
    Energy utilization
    Virtual machine

    Keywords

    • cloud computing
    • metaheuristic
    • virtual machine allocation
    • virtual machine placement

    Cite this

    Alboaneen, D. A., Tianfield, H., & Zhang, Y. (2017). Metaheuristic approaches to virtual machine placement in cloud computing: a review. In 15th International Symposium on Parallel and Distributed Computing (ISPDC), 2016 IEEE. https://doi.org/10.1109/ISPDC.2016.37
    Alboaneen, Dabiah Ahmed ; Tianfield, Huaglory ; Zhang, Yan. / Metaheuristic approaches to virtual machine placement in cloud computing: a review. 15th International Symposium on Parallel and Distributed Computing (ISPDC), 2016 . IEEE, 2017.
    @inproceedings{e20074ce71734f249c980ef6b4f09cf1,
    title = "Metaheuristic approaches to virtual machine placement in cloud computing: a review",
    abstract = "Virtual machine placement (VMP) is mapping virtual machines (VMs) to appropriate physical machines (PMs) to achieve satisfactory objectives such as minimised energy consumption or maximised performance. VMP is considered as a non-deterministic polynomial-time hard (NP-hard) problem. Metaheuristic techniques are able to find near-optimal solutions to NP-hard problems. This paper presents a review upon metaheuristic approaches to VMP in cloud computing.",
    keywords = "cloud computing, metaheuristic, virtual machine allocation, virtual machine placement",
    author = "Alboaneen, {Dabiah Ahmed} and Huaglory Tianfield and Yan Zhang",
    note = "Acceptance email in SAN AAM uploaded 23-3-17",
    year = "2017",
    month = "4",
    day = "24",
    doi = "10.1109/ISPDC.2016.37",
    language = "English",
    booktitle = "15th International Symposium on Parallel and Distributed Computing (ISPDC), 2016",
    publisher = "IEEE",

    }

    Alboaneen, DA, Tianfield, H & Zhang, Y 2017, Metaheuristic approaches to virtual machine placement in cloud computing: a review. in 15th International Symposium on Parallel and Distributed Computing (ISPDC), 2016 . IEEE. https://doi.org/10.1109/ISPDC.2016.37

    Metaheuristic approaches to virtual machine placement in cloud computing: a review. / Alboaneen, Dabiah Ahmed; Tianfield, Huaglory; Zhang, Yan.

    15th International Symposium on Parallel and Distributed Computing (ISPDC), 2016 . IEEE, 2017.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    TY - GEN

    T1 - Metaheuristic approaches to virtual machine placement in cloud computing: a review

    AU - Alboaneen, Dabiah Ahmed

    AU - Tianfield, Huaglory

    AU - Zhang, Yan

    N1 - Acceptance email in SAN AAM uploaded 23-3-17

    PY - 2017/4/24

    Y1 - 2017/4/24

    N2 - Virtual machine placement (VMP) is mapping virtual machines (VMs) to appropriate physical machines (PMs) to achieve satisfactory objectives such as minimised energy consumption or maximised performance. VMP is considered as a non-deterministic polynomial-time hard (NP-hard) problem. Metaheuristic techniques are able to find near-optimal solutions to NP-hard problems. This paper presents a review upon metaheuristic approaches to VMP in cloud computing.

    AB - Virtual machine placement (VMP) is mapping virtual machines (VMs) to appropriate physical machines (PMs) to achieve satisfactory objectives such as minimised energy consumption or maximised performance. VMP is considered as a non-deterministic polynomial-time hard (NP-hard) problem. Metaheuristic techniques are able to find near-optimal solutions to NP-hard problems. This paper presents a review upon metaheuristic approaches to VMP in cloud computing.

    KW - cloud computing

    KW - metaheuristic

    KW - virtual machine allocation

    KW - virtual machine placement

    U2 - 10.1109/ISPDC.2016.37

    DO - 10.1109/ISPDC.2016.37

    M3 - Conference contribution

    BT - 15th International Symposium on Parallel and Distributed Computing (ISPDC), 2016

    PB - IEEE

    ER -

    Alboaneen DA, Tianfield H, Zhang Y. Metaheuristic approaches to virtual machine placement in cloud computing: a review. In 15th International Symposium on Parallel and Distributed Computing (ISPDC), 2016 . IEEE. 2017 https://doi.org/10.1109/ISPDC.2016.37

    Documents and Links