File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Cost-minimizing dynamic migration of content distribution services into hybrid clouds

TitleCost-minimizing dynamic migration of content distribution services into hybrid clouds
Authors
KeywordsArrival patterns
Computing technology
Content distribution
Content providers
Data centers
Issue Date2012
PublisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359
Citation
The 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL., 25-30 March 2012. In IEEE Infocom Proceedings, 2012, p. 2571-2575 How to Cite?
AbstractThe recent advent of cloud computing technologies has enabled agile and scalable resource access for a variety of applications. Content distribution services are a major category of popular Internet applications. A growing number of content providers are contemplating a switch to cloud-based services, for better scalability and lower cost. Two key tasks are involved for such a move: to migrate their contents to cloud storage, and to distribute their web service load to cloud-based web services. The main challenge is to make the best use of the cloud as well as their existing on-premise server infrastructure, to serve volatile content requests with service response time guarantee at all times, while incurring the minimum operational cost. Employing Lyapunov optimization techniques, we present an optimization framework for dynamic, cost-minimizing migration of content distribution services into a hybrid cloud infrastructure that spans geographically distributed data centers. A dynamic control algorithm is designed, which optimally places contents and dispatches requests in different data centers to minimize overall operational cost over time, subject to service response time constraints. Rigorous analysis shows that the algorithm nicely bounds the response times within the preset QoS target in cases of arbitrary request arrival patterns, and guarantees that the overall cost is within a small constant gap from the optimum achieved by a T-slot lookahead mechanism with known information into the future. © 2012 IEEE.
DescriptionMini-Conference - MC3: Cloud Computing
Persistent Identifierhttp://hdl.handle.net/10722/152047
ISBN
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorQiu, Xen_US
dc.contributor.authorLi, Hen_US
dc.contributor.authorWu, Cen_US
dc.contributor.authorLi, Zen_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:32:51Z-
dc.date.available2012-06-26T06:32:51Z-
dc.date.issued2012en_US
dc.identifier.citationThe 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL., 25-30 March 2012. In IEEE Infocom Proceedings, 2012, p. 2571-2575en_US
dc.identifier.isbn978-1-4673-0775-8-
dc.identifier.issn0743-166Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/152047-
dc.descriptionMini-Conference - MC3: Cloud Computing-
dc.description.abstractThe recent advent of cloud computing technologies has enabled agile and scalable resource access for a variety of applications. Content distribution services are a major category of popular Internet applications. A growing number of content providers are contemplating a switch to cloud-based services, for better scalability and lower cost. Two key tasks are involved for such a move: to migrate their contents to cloud storage, and to distribute their web service load to cloud-based web services. The main challenge is to make the best use of the cloud as well as their existing on-premise server infrastructure, to serve volatile content requests with service response time guarantee at all times, while incurring the minimum operational cost. Employing Lyapunov optimization techniques, we present an optimization framework for dynamic, cost-minimizing migration of content distribution services into a hybrid cloud infrastructure that spans geographically distributed data centers. A dynamic control algorithm is designed, which optimally places contents and dispatches requests in different data centers to minimize overall operational cost over time, subject to service response time constraints. Rigorous analysis shows that the algorithm nicely bounds the response times within the preset QoS target in cases of arbitrary request arrival patterns, and guarantees that the overall cost is within a small constant gap from the optimum achieved by a T-slot lookahead mechanism with known information into the future. © 2012 IEEE.en_US
dc.languageengen_US
dc.publisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359en_US
dc.relation.ispartofIEEE Infocom Proceedingsen_US
dc.rightsIEEE Infocom Proceedings. Copyright © IEEE Computer Society.-
dc.rights©2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectArrival patterns-
dc.subjectComputing technology-
dc.subjectContent distribution-
dc.subjectContent providers-
dc.subjectData centers-
dc.titleCost-minimizing dynamic migration of content distribution services into hybrid cloudsen_US
dc.typeConference_Paperen_US
dc.identifier.emailQiu, X: jackyxjq@hku.hken_US
dc.identifier.emailLi, H: hongxli@hku.hken_US
dc.identifier.emailWu, C: cwu@cs.hku.hk-
dc.identifier.emailLi, Z: zongpeng@ucalgary.ca-
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hk-
dc.identifier.authorityWu, C=rp01397en_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/INFCOM.2012.6195655en_US
dc.identifier.scopuseid_2-s2.0-84861591911en_US
dc.identifier.hkuros202424-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84861591911&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage2571en_US
dc.identifier.epage2575en_US
dc.publisher.placeUnited Statesen_US
dc.description.otherThe 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL., 25-30 March 2012. In IEEE Infocom Proceedings, 2012, p. 2571-2575-
dc.identifier.scopusauthoridLau, FCM=7102749723en_US
dc.identifier.scopusauthoridLi, Z=23467418800en_US
dc.identifier.scopusauthoridWu, C=15836048100en_US
dc.identifier.scopusauthoridLi, H=36063776700en_US
dc.identifier.scopusauthoridQiu, X=35183905700en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats