IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v12y2016i3p3479247.html
   My bibliography  Save this article

Optimization Approach for Resource Allocation on Cloud Computing for IoT

Author

Listed:
  • Yeongho Choi
  • Yujin Lim

Abstract

Combinatorial auction is a popular approach for resource allocation in cloud computing. One of the challenges in resource allocation is that QoS (Quality of Service) constraints are satisfied and provider's profit is maximized. In order to increase the profit, the penalty cost for SLA (Service Level Agreement) violations needs to be reduced. We consider execution time constraint as SLA constraint in combinatorial auction system. In the system, we determine winners at each bidding round according to the job's urgency based on execution time deadline, in order to efficiently allocate resources and reduce the penalty cost. To analyze the performance of our mechanism, we compare the provider's profit and success rate of job completion with conventional mechanism using real workload data.

Suggested Citation

  • Yeongho Choi & Yujin Lim, 2016. "Optimization Approach for Resource Allocation on Cloud Computing for IoT," International Journal of Distributed Sensor Networks, , vol. 12(3), pages 3479247-347, March.
    • Handle: RePEc:sae:intdis:v:12:y:2016:i:3:p:3479247
    DOI: 10.1155/2016/3479247
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/3479247
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/3479247?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:sae:intdis:v:12:y:2016:i:3:p:3479247. 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: SAGE Publications (email available below). General contact details of provider: .

    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.