Publication | Closed Access
Practical Resource Provisioning and Caching with Dynamic Resilience for Cloud-Based Content Distribution Networks
74
Citations
19
References
2014
Year
Cluster ComputingDynamic ResilienceEngineeringEdge ComputingContent Distribution NetworksCloud ComputingContent DistributionNetwork AnalysisCachingCloud Load BalancingContent Delivery NetworkHigh AvailabilityPractical Resource ProvisioningConventional CdnsCloud Resource ManagementCloud CdnsWeb Cache
Content distribution networks (CDNs) built on clouds have recently started to emerge. Compared to conventional CDNs, cloud-based CDNs have the benefit of cost efficient hosting services without owning infrastructure. However, resource provisioning and replica placement in cloud CDNs involve a number of challenging issues, mainly due to the dynamic nature of demand patterns. To deal with this dynamic nature, this paper proposes a set of novel algorithms to solve the joint problem of resource provisioning and caching (i.e., replica placement) for cloud-based CDNs with an emphasis on handling the dynamic demand patterns. Firstly, we propose a provisioning and caching algorithm framework called Differential Provisioning and Caching (DPC) algorithm, which aims to rent cloud resources to build CDNs and whereby to cache contents so that the total rental cost can be minimized while all demands are served. DPC consists of 2 steps. Step 1 first maximizes total demands supported by unexpired resources. Then, step 2 minimizes the total rental cost for new resources to serve all remaining demands. For each step we design both greedy and iterative heuristics, each with different advantages over the existing approaches. Moreover, to dynamically adjusts the placement of contents and route maps, we further propose the Caching and Request Balancing (CRB) algorithm, which is light-weight and thus can be frequently executed as a companion of DPC to maximize the total demands. Performance evaluation results are presented to demonstrate the effectiveness and competitiveness of our approaches when compared to existing algorithms.
| Year | Citations | |
|---|---|---|
Page 1
Page 1