ISSN 0253-2778

CN 34-1054/N

open
Free to Publish. Free to Read.
Open AccessOpen Access JUSTC Original Paper

A novel video replica placement strategy for storage cloud-based CDN

  • Department of Automation, University of Science and Technology of China, Hefei 230027, China

Cite this:
https://doi.org/10.3969/j.issn.0253-2778.2014.07.003
  • Received Date: 11 October 2013
  • Accepted Date: 29 April 2014
  • Rev Recd Date: 29 April 2014
  • Publish Date: 30 July 2014
    Abstract

  • Abstract

    Online video service needs the support of CDN (content delivery network) which can be costly. Using cloud storage nodes to deliver video content can help solve the problem. To guarantee the users QoS, CDN should pre-deploy the content files of online video service to the edge nodes which are close to the users. The existing GS (greedy site) placement algorithm can satisfy the QoS requirements at a relatively smaller cost when the historical log is provided. However, the GS algorithm will result in bad load balance among cloud storage nodes. A novel replica placement algorithm named GUCP (greedy user core preallocation) was proposed to solve this problem. The algorithm assigned users on overloaded nodes to lightly-loaded ones using the k-means algorithm, in order to balance the load. The numerical experimental results show that the cost and QoS performance of GUCP are very close to those of GS, while its performance of load balance is much better than that of GS.

    Abstract

    Online video service needs the support of CDN (content delivery network) which can be costly. Using cloud storage nodes to deliver video content can help solve the problem. To guarantee the users QoS, CDN should pre-deploy the content files of online video service to the edge nodes which are close to the users. The existing GS (greedy site) placement algorithm can satisfy the QoS requirements at a relatively smaller cost when the historical log is provided. However, the GS algorithm will result in bad load balance among cloud storage nodes. A novel replica placement algorithm named GUCP (greedy user core preallocation) was proposed to solve this problem. The algorithm assigned users on overloaded nodes to lightly-loaded ones using the k-means algorithm, in order to balance the load. The numerical experimental results show that the cost and QoS performance of GUCP are very close to those of GS, while its performance of load balance is much better than that of GS.
    • FullText(HTML)
  • loading
    • References(25)
  • [1]
    Rayburn D. Content delivery networking pricing, costs for outsourced video delivery[EB/OL]. http://www.scribemedia.org/2007/12/12/cdn-pricing-video/.
    [2]
    Elson J, Howell J. Handling flash crowds from your garage[C]// Proceedings of the USENIX Annual Technical Conference. Santa Clara, USA: USENIX Association, 2008: 171-184.
    [3]
    Gottfrid D. Self-service, prorated super computing fun![EB/OL]. http://open.blogs.nytimes.com/2007/11/01/self-service-prorated-super-com-putting-fun(0).
    [4]
    MacAskill D. Scalability: Set Amazons servers on fire, not yours[EB/OL]. hhttp:// blogs.smugmug.com/don/files/ETech-SmugMug-Amazon-2007.pdfi (0).
    [5]
    Broberg J, Buyya R, Tari Z. MetaCDN: Harnessing storage clouds for high performance content delivery[J]. Journal of Network and Computer Applications, 2009, 32(5): 1 012-1 022.
    [6]
    Li B, Golin M J, Italiano G F, et al. On the optimal placement of web proxies in the internet[C]// Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies. IEEEPress, 1999, 3: 1 282-1 290.
    [7]
    Krishnan P, Raz D, Shavitt Y. The cache location problem[J]. IEEE/ACM Transactions on Networking, 2000, 8(5): 568-582.
    [8]
    Qiu L, Padmanabhan V N, Voelker G M. On the placement of web server replicas[C]// Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies. Anchorage, USA: IEEE Press, 2001: 1 587-1 596.
    [9]
    Radoslavov P, Govindan R, Estrin D. Topology-informed internet replica placement[J]. Computer Communications, 2002, 25(4): 384-392.
    [10]
    Cronin E, Jamin S, Cheng J, et al. Constrained mirror placement on the internet[J]. IEEE Journal on Selected Areas in Communications, 2002, 20(7): 1 369-1 382.
    [11]
    Xu J, Li B, Lee D L. Placement problems for transparent data replication proxy services[J]. IEEE Journal on Selected Areas in Communications, 2002, 20(7): 1 383-1 398.
    [12]
    Jia X, Li D, Hu X, et al. Placement of web-server proxies with consideration of read and update operations on the internet[J]. The Computer Journal, 2003, 46(4): 378-390.
    [13]
    Cidon I, Kutten S, Soffer R. Optimal allocation of electronic content[C]// Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies. Anchorage, USA: IEEE Press, 2001, 3: 1 773-1 780.
    [14]
    Kalpakis K, Dasgupta K, Wolfson O. Optimal placement of replicas in trees with read, write, and storage costs[J]. IEEE Transactions on Parallel and Distributed Systems, 2001, 12(6): 628-637.
    [15]
    Tang X Y, Xu J L. QoS-aware replica placement for content distribution[J]. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(10): 921-932.
    [16]
    Wang H, Liu P, Wu J J. A QoS-aware heuristic algorithm for replica placement[C]// Proceedings of the 7th IEEE/ACM International Conference on Grid Computing. Bacelona, Spain: IEEE Computer Society, 2006: 96-103.
    [17]
    Rodolakis G, Siachalou S, Georgiadis L. Replicated server placement with QoS constraints[J]. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(10): 1 151-1 162.
    [18]
    He J, Wu D, Zeng Y P, et al. Towards optimal deployment of cloud-assisted video distribution services[J]. IEEE Transactions on Circuit and System for Video Technologies, 2013, 23(10): 1 717-1 728.
    [19]
    Zhu W, Luo C, Wang J, et al. Multimedia cloud computing: Directions and applications[J]. Signal Processing Magazine, 2011, 28(3): 59-69.
    [20]
    Wu Y, Wu C, Li B, et al. CloudMedia: When cloud on demand meets video on demand[C]// Proceedings of the 31st International Conference on Distributed Computing Systems. Minneapolis, USA: IEEE Press, 2011: 268-277.
    [21]
    Li H T, Zhong L L, Liu J C, et al. Cost-effective partial migration of VoD services to content clouds[C]// Proceedings of the International Conference on Cloud Computing. Washington, USA: IEEE Press, 2011: 203-210.
    [22]
    Wang F, Liu J C, Chen M H. CALMS: Cloud-assisted live media streaming for globalized demands with time/region diversities[C]// Proceedings IEEE INFOCOM. Orlando, USA: IEEE Press, 2012: 199-207.
    [23]
    Chen F F, Guo K, Lin J, et al. Intra-cloud lightning: Building CDNs in the cloud[C]// Proceedings IEEE INFOCOM. Orlando, USA: IEEE Press, 2012: 433-441.
    [24]
    郭成城, 晏蒲柳. 一种异构 Web 服务器集群动态负载均衡算法[J]. 计算机学报, 2005, 28(2): 179-184.
    [25]
    Godfrey B, Lakshminarayanan K, Surana S, et al. Load balancing in dynamic structured P2P systems[C]// Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies. Hong Kang, China: IEEE Press, 2004, 4: 2 253-2 262.
    • Supplements(0)
    • Related Articles
    • Track Citations
  • 加载中

Catalog

    |
    Get Citation
    PDF
    XML
    [1]
    Rayburn D. Content delivery networking pricing, costs for outsourced video delivery[EB/OL]. http://www.scribemedia.org/2007/12/12/cdn-pricing-video/.
    [2]
    Elson J, Howell J. Handling flash crowds from your garage[C]// Proceedings of the USENIX Annual Technical Conference. Santa Clara, USA: USENIX Association, 2008: 171-184.
    [3]
    Gottfrid D. Self-service, prorated super computing fun![EB/OL]. http://open.blogs.nytimes.com/2007/11/01/self-service-prorated-super-com-putting-fun(0).
    [4]
    MacAskill D. Scalability: Set Amazons servers on fire, not yours[EB/OL]. hhttp:// blogs.smugmug.com/don/files/ETech-SmugMug-Amazon-2007.pdfi (0).
    [5]
    Broberg J, Buyya R, Tari Z. MetaCDN: Harnessing storage clouds for high performance content delivery[J]. Journal of Network and Computer Applications, 2009, 32(5): 1 012-1 022.
    [6]
    Li B, Golin M J, Italiano G F, et al. On the optimal placement of web proxies in the internet[C]// Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies. IEEEPress, 1999, 3: 1 282-1 290.
    [7]
    Krishnan P, Raz D, Shavitt Y. The cache location problem[J]. IEEE/ACM Transactions on Networking, 2000, 8(5): 568-582.
    [8]
    Qiu L, Padmanabhan V N, Voelker G M. On the placement of web server replicas[C]// Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies. Anchorage, USA: IEEE Press, 2001: 1 587-1 596.
    [9]
    Radoslavov P, Govindan R, Estrin D. Topology-informed internet replica placement[J]. Computer Communications, 2002, 25(4): 384-392.
    [10]
    Cronin E, Jamin S, Cheng J, et al. Constrained mirror placement on the internet[J]. IEEE Journal on Selected Areas in Communications, 2002, 20(7): 1 369-1 382.
    [11]
    Xu J, Li B, Lee D L. Placement problems for transparent data replication proxy services[J]. IEEE Journal on Selected Areas in Communications, 2002, 20(7): 1 383-1 398.
    [12]
    Jia X, Li D, Hu X, et al. Placement of web-server proxies with consideration of read and update operations on the internet[J]. The Computer Journal, 2003, 46(4): 378-390.
    [13]
    Cidon I, Kutten S, Soffer R. Optimal allocation of electronic content[C]// Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies. Anchorage, USA: IEEE Press, 2001, 3: 1 773-1 780.
    [14]
    Kalpakis K, Dasgupta K, Wolfson O. Optimal placement of replicas in trees with read, write, and storage costs[J]. IEEE Transactions on Parallel and Distributed Systems, 2001, 12(6): 628-637.
    [15]
    Tang X Y, Xu J L. QoS-aware replica placement for content distribution[J]. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(10): 921-932.
    [16]
    Wang H, Liu P, Wu J J. A QoS-aware heuristic algorithm for replica placement[C]// Proceedings of the 7th IEEE/ACM International Conference on Grid Computing. Bacelona, Spain: IEEE Computer Society, 2006: 96-103.
    [17]
    Rodolakis G, Siachalou S, Georgiadis L. Replicated server placement with QoS constraints[J]. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(10): 1 151-1 162.
    [18]
    He J, Wu D, Zeng Y P, et al. Towards optimal deployment of cloud-assisted video distribution services[J]. IEEE Transactions on Circuit and System for Video Technologies, 2013, 23(10): 1 717-1 728.
    [19]
    Zhu W, Luo C, Wang J, et al. Multimedia cloud computing: Directions and applications[J]. Signal Processing Magazine, 2011, 28(3): 59-69.
    [20]
    Wu Y, Wu C, Li B, et al. CloudMedia: When cloud on demand meets video on demand[C]// Proceedings of the 31st International Conference on Distributed Computing Systems. Minneapolis, USA: IEEE Press, 2011: 268-277.
    [21]
    Li H T, Zhong L L, Liu J C, et al. Cost-effective partial migration of VoD services to content clouds[C]// Proceedings of the International Conference on Cloud Computing. Washington, USA: IEEE Press, 2011: 203-210.
    [22]
    Wang F, Liu J C, Chen M H. CALMS: Cloud-assisted live media streaming for globalized demands with time/region diversities[C]// Proceedings IEEE INFOCOM. Orlando, USA: IEEE Press, 2012: 199-207.
    [23]
    Chen F F, Guo K, Lin J, et al. Intra-cloud lightning: Building CDNs in the cloud[C]// Proceedings IEEE INFOCOM. Orlando, USA: IEEE Press, 2012: 433-441.
    [24]
    郭成城, 晏蒲柳. 一种异构 Web 服务器集群动态负载均衡算法[J]. 计算机学报, 2005, 28(2): 179-184.
    [25]
    Godfrey B, Lakshminarayanan K, Surana S, et al. Load balancing in dynamic structured P2P systems[C]// Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies. Hong Kang, China: IEEE Press, 2004, 4: 2 253-2 262.
    Recommended articles
    TrendMD
    Volume 44 Issue 7 page: 554-562
    Cover

    Article Metrics

    Article views (39) PDF downloads(65)
    Proportional views

    Copyright © Editorial Office of JUSTC, All Rights Reserved. 皖ICP备05002528号

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return