Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/64538
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorWang, JV-
dc.creatorFok, KY-
dc.creatorCheng, CT-
dc.creatorTse, CK-
dc.date.accessioned2017-03-03T03:50:26Z-
dc.date.available2017-03-03T03:50:26Z-
dc.identifier.isbn978-1-5090-2616-6 (electronic)en_US
dc.identifier.isbn978-1-5090-2617-3 (print on demand(PoD))en_US
dc.identifier.urihttp://hdl.handle.net/10397/64538-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.rightsThe following publication J. V. Wang, K. Y. Fok, C. T. Cheng and C. K. Tse, "A Stable Matching-Based Virtual Machine Allocation Mechanism for Cloud Data Centers," 2016 IEEE World Congress on Services (SERVICES), San Francisco, CA, 2016, pp. 103-106 is available at http://dx.doi.org/10.1109/SERVICES.2016.21en_US
dc.subjectCloud computingen_US
dc.subjectStable matchingen_US
dc.subjectVM allocationen_US
dc.titleA stable matching-based virtual machine allocation mechanism for cloud data centersen_US
dc.typeConference Paperen_US
dc.identifier.spage103en_US
dc.identifier.epage106en_US
dc.identifier.doi10.1109/SERVICES.2016.21en_US
dcterms.abstractVirtualization is the enabling technology that makes resource provisioning in Cloud computing feasible. With virtualization, virtual machines (VMs) can be migrated across physical hosts to achieve better utilization of resource with a minimum impact on service quality. The VM allocation problem can be formulated as a stable matching problem. In this paper, we propose a VM allocation mechanism based on stable matching. A deferred acceptance procedure is adopted to handle conflicts among preferences of VMs and physical hosts. Unlike ordinary stable matching problems, both involving party groups in our matching process are having a mutual objective, that is to reduce the overall energy consumption of a Cloud data center while maintaining a high level of Quality of Service. The proposed mechanism is evaluated using CloudSim with real-world workload data. Simulation results show that Cloud data centers with the proposed mechanism can reduce energy consumption and avoid violations of Service-Level Agreement.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation2016 IEEE World Congress on Services (SERVICES), San Francisco, CA, 27 June-2 July, 2016, p. 103-106-
dcterms.issued2016-
dc.identifier.isiWOS:000389457600020-
dc.identifier.scopus2-s2.0-84988850775-
dc.identifier.ros2016005632-
dc.relation.conferenceIEEE World Congress on Services [SERVICES]en_US
dc.source.typeProceedings Paper-
dc.identifier.rosgroupid2016005381-
dc.description.ros2016-2017 > Academic research: refereed > Refereed conference paperen_US
dc.description.validate201803_a bcwhen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0056-n03en_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Wang_Stable_Matching-Based_Virtual.pdfPre-published version90.6 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

128
Last Week
0
Last month
Citations as of Oct 1, 2023

Downloads

224
Citations as of Oct 1, 2023

SCOPUSTM   
Citations

21
Last Week
0
Last month
Citations as of Sep 28, 2023

WEB OF SCIENCETM
Citations

14
Last Week
0
Last month
Citations as of Sep 28, 2023

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.