Performance of Cloud Computing Centers with Multiple Priority Classes

W. Ellens, Miroslav Zivkovic, J. Akkerboom, R. Litjens, Hans Leo van den Berg

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    29 Citations (Scopus)
    63 Downloads (Pure)

    Abstract

    In this paper we consider the general problem of resource provisioning within cloud computing. We analyze the problem of how to allocate resources to different clients such that the service level agreements (SLAs) for all of these clients are met. A model with multiple service request classes generated by different clients is proposed to evaluate the performance of a cloud computing center when multiple SLAs are negotiated between the service provider and its customers. For each class, the SLA is specified by the request rejection probabilities of the clients in that class. The proposed solution supports cloud service providers in the decision making about 1) defining realistic SLAs, 2) the dimensioning of data centers, 3) whether to accept new clients, and 4) the amount of resources to be reserved for high priority clients. We illustrate the potential of the solution by a number of experiments conducted for a large and therefore realistic number of resources.
    Original languageUndefined
    Title of host publicationProceedings of the 5th International Conference on Cloud Computing, CLOUD 2012
    Place of PublicationUSA
    PublisherIEEE Computer Society
    Pages245-252
    Number of pages8
    ISBN (Print)978-1-4673-2892-0
    DOIs
    Publication statusPublished - Jun 2012
    Event5th International Conference on Cloud Computing, CLOUD 2012 - Honolulu, HI, USA
    Duration: 24 Jun 201229 Jun 2012

    Publication series

    Name
    PublisherIEEE Computer Society
    ISSN (Print)2159-6182

    Conference

    Conference5th International Conference on Cloud Computing, CLOUD 2012
    Period24/06/1229/06/12
    Other24-29 June 2012

    Keywords

    • IR-82842
    • EWI-21987
    • METIS-293166

    Cite this