File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Conference Paper: Cost-minimizing dynamic migration of content distribution services into hybrid clouds
  • Basic View
  • Metadata View
  • XML View
TitleCost-minimizing dynamic migration of content distribution services into hybrid clouds
 
AuthorsQiu, X1
Li, H1
Wu, C1
Li, Z2
Lau, FCM1
 
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
 
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-2575 [How to Cite?]
DOI: http://dx.doi.org/10.1109/INFCOM.2012.6195655
 
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
 
ISBN978-1-4673-0775-8
 
ISSN0743-166X
2012 SCImago Journal Rankings: 1.703
 
DOIhttp://dx.doi.org/10.1109/INFCOM.2012.6195655
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorQiu, X
 
dc.contributor.authorLi, H
 
dc.contributor.authorWu, C
 
dc.contributor.authorLi, Z
 
dc.contributor.authorLau, FCM
 
dc.date.accessioned2012-06-26T06:32:51Z
 
dc.date.available2012-06-26T06:32:51Z
 
dc.date.issued2012
 
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.
 
dc.description.naturepublished_or_final_version
 
dc.descriptionMini-Conference - MC3: Cloud Computing
 
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.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-2575 [How to Cite?]
DOI: http://dx.doi.org/10.1109/INFCOM.2012.6195655
 
dc.identifier.doihttp://dx.doi.org/10.1109/INFCOM.2012.6195655
 
dc.identifier.epage2575
 
dc.identifier.hkuros202424
 
dc.identifier.isbn978-1-4673-0775-8
 
dc.identifier.issn0743-166X
2012 SCImago Journal Rankings: 1.703
 
dc.identifier.scopuseid_2-s2.0-84861591911
 
dc.identifier.spage2571
 
dc.identifier.urihttp://hdl.handle.net/10722/152047
 
dc.languageeng
 
dc.publisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359
 
dc.publisher.placeUnited States
 
dc.relation.ispartofIEEE Infocom Proceedings
 
dc.relation.referencesReferences in Scopus
 
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 clouds
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Qiu, X</contributor.author>
<contributor.author>Li, H</contributor.author>
<contributor.author>Wu, C</contributor.author>
<contributor.author>Li, Z</contributor.author>
<contributor.author>Lau, FCM</contributor.author>
<date.accessioned>2012-06-26T06:32:51Z</date.accessioned>
<date.available>2012-06-26T06:32:51Z</date.available>
<date.issued>2012</date.issued>
<identifier.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</identifier.citation>
<identifier.isbn>978-1-4673-0775-8</identifier.isbn>
<identifier.issn>0743-166X</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/152047</identifier.uri>
<description>Mini-Conference - MC3: Cloud Computing</description>
<description.abstract>The 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. &#169; 2012 IEEE.</description.abstract>
<language>eng</language>
<publisher>IEEE Computer Society. The Journal&apos;s web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359</publisher>
<relation.ispartof>IEEE Infocom Proceedings</relation.ispartof>
<rights>IEEE Infocom Proceedings. Copyright &#169; IEEE Computer Society.</rights>
<rights>&#169;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.</rights>
<rights>Creative Commons: Attribution 3.0 Hong Kong License</rights>
<subject>Arrival patterns</subject>
<subject>Computing technology</subject>
<subject>Content distribution</subject>
<subject>Content providers</subject>
<subject>Data centers</subject>
<title>Cost-minimizing dynamic migration of content distribution services into hybrid clouds</title>
<type>Conference_Paper</type>
<description.nature>published_or_final_version</description.nature>
<identifier.doi>10.1109/INFCOM.2012.6195655</identifier.doi>
<identifier.scopus>eid_2-s2.0-84861591911</identifier.scopus>
<identifier.hkuros>202424</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-84861591911&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.spage>2571</identifier.spage>
<identifier.epage>2575</identifier.epage>
<publisher.place>United States</publisher.place>
<description.other>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</description.other>
<bitstream.url>http://hub.hku.hk/bitstream/10722/152047/1/Content.pdf</bitstream.url>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. University of Calgary