中国科学技术大学学报
中國科學技術大學學報
중국과학기술대학학보
JOURNAL OF UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA
2014年
7期
554-562
,共9页
云存储%CDN%副本部署%负载均衡
雲存儲%CDN%副本部署%負載均衡
운존저%CDN%부본부서%부재균형
cloud storage%CDN%replica placement%load balance
在线视频服务无法离开CDN(content delivery network)的支持。与传统CDN相比,使用云存储节点作为CDN的节点对视频内容进行分发可以节省大量运营费用。在线视频服务的内容文件要尽量预先部署到离用户较近的边缘节点上,以保证用户的QoS (quality of service )。现有的GS (greedy site)内容预部署算法在有历史记录的前提下,有着较小的货币开销,且能满足QoS需求。然而,GS算法会导致云存储节点的负载均衡情况较差。为此,提出了一种称为GUCP(greedy user core preallocation )的部署算法,该算法利用 k-means算法将负载过重节点上的用户分配到负载较轻的节点以平衡负载,解决GS算法在负载均衡方面存在的不足。实验表明,GUCP算法在系统使用费用、QoS性能方面与GS算法十分接近,在负载均衡性能上远远优于GS算法。
在線視頻服務無法離開CDN(content delivery network)的支持。與傳統CDN相比,使用雲存儲節點作為CDN的節點對視頻內容進行分髮可以節省大量運營費用。在線視頻服務的內容文件要儘量預先部署到離用戶較近的邊緣節點上,以保證用戶的QoS (quality of service )。現有的GS (greedy site)內容預部署算法在有歷史記錄的前提下,有著較小的貨幣開銷,且能滿足QoS需求。然而,GS算法會導緻雲存儲節點的負載均衡情況較差。為此,提齣瞭一種稱為GUCP(greedy user core preallocation )的部署算法,該算法利用 k-means算法將負載過重節點上的用戶分配到負載較輕的節點以平衡負載,解決GS算法在負載均衡方麵存在的不足。實驗錶明,GUCP算法在繫統使用費用、QoS性能方麵與GS算法十分接近,在負載均衡性能上遠遠優于GS算法。
재선시빈복무무법리개CDN(content delivery network)적지지。여전통CDN상비,사용운존저절점작위CDN적절점대시빈내용진행분발가이절성대량운영비용。재선시빈복무적내용문건요진량예선부서도리용호교근적변연절점상,이보증용호적QoS (quality of service )。현유적GS (greedy site)내용예부서산법재유역사기록적전제하,유착교소적화폐개소,차능만족QoS수구。연이,GS산법회도치운존저절점적부재균형정황교차。위차,제출료일충칭위GUCP(greedy user core preallocation )적부서산법,해산법이용 k-means산법장부재과중절점상적용호분배도부재교경적절점이평형부재,해결GS산법재부재균형방면존재적불족。실험표명,GUCP산법재계통사용비용、QoS성능방면여GS산법십분접근,재부재균형성능상원원우우GS산법。
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 w hich 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 .