TY - GEN
T1 - Intra-cloud lightning
T2 - IEEE Conference on Computer Communications, INFOCOM 2012
AU - Chen, Fangfei
AU - Guo, Katherine
AU - Lin, John
AU - La Porta, Thomas
PY - 2012
Y1 - 2012
N2 - Content distribution networks (CDNs) using storage clouds have recently started to emerge. Compared to traditional CDNs, storage cloud-based CDNs have the advantage of cost effectively offering hosting services to Web content providers without owning infrastructure. However, existing work on replica placement in CDNs does not readily apply in the cloud. In this paper, we investigated the joint problem of building distribution paths and placing Web server replicas in cloud CDNs to minimize the cost incurred on the CDN providers while satisfying QoS requirements for user requests. We formulate the cost optimization problem with accurate cost models and QoS requirements and show that the monthly cost can be as low as 2.62 US Dollars for a small Web site. We develop a suite of offline, online-static and online-dynamic heuristic algorithms that take as input network topology and work load information such as user location and request rates. We then evaluate the heuristics via Web trace-based simulation, and show that our heuristics behave very close to optimal under various network conditions.
AB - Content distribution networks (CDNs) using storage clouds have recently started to emerge. Compared to traditional CDNs, storage cloud-based CDNs have the advantage of cost effectively offering hosting services to Web content providers without owning infrastructure. However, existing work on replica placement in CDNs does not readily apply in the cloud. In this paper, we investigated the joint problem of building distribution paths and placing Web server replicas in cloud CDNs to minimize the cost incurred on the CDN providers while satisfying QoS requirements for user requests. We formulate the cost optimization problem with accurate cost models and QoS requirements and show that the monthly cost can be as low as 2.62 US Dollars for a small Web site. We develop a suite of offline, online-static and online-dynamic heuristic algorithms that take as input network topology and work load information such as user location and request rates. We then evaluate the heuristics via Web trace-based simulation, and show that our heuristics behave very close to optimal under various network conditions.
UR - http://www.scopus.com/inward/record.url?scp=84861626923&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84861626923&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2012.6195782
DO - 10.1109/INFCOM.2012.6195782
M3 - Conference contribution
AN - SCOPUS:84861626923
SN - 9781467307758
T3 - Proceedings - IEEE INFOCOM
SP - 433
EP - 441
BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012
Y2 - 25 March 2012 through 30 March 2012
ER -