摘要： 目前对内容分发网络的能耗问题都集中在请求重定向、缓存内容调度及链路能耗控制方面,缓存服务器没有有效的部署机制,造成资源分配不均衡、服务器利用率低、网络能效及服务质量低的问题。为此,提出一种在内容分发网络中基于复杂网络节点性质合理部署缓存服务器的算法。对网络进行社团结构划分,选取初始凝聚社团进行节点收缩,针对收缩后的节点根据相似度函数迭代地进行社团扩张,通过设定阈值形成社团,进而部署缓存服务器,以达到网络负载均衡,降低缓存服务器闲时的资源浪费,提高缓存服务器的利用率。实验结果表明,与谱平均法和GN算法等相比,该算法具有较低的复杂度和较好的划分细粒度。
关键词:
内容分发网络,
复杂网络,
社团结构,
相似度函数,
缓存服务器
Abstract: Studies in Content Delivery Network(CDN) of energy consumption are focused on redirection of requests,scheduling of caches and controlling about links consumption nowadays.However,there is a lack of efficient solution toward unbalance distribution of resource,low utilization of servers,energy inefficiency and poor service quality caused by absence of reasonable deployment mechanism of cache servers.This paper proposes a scheme of deploying based on the property of nodes of complex networks in CDN.The algorithm divides the network into communities firstly,during which it chooses then converges an initial community at the beginning,then iterates to expand the community in terms of similarity function.A threshold is set to get exact community,then cache servers can be deployed in proper places to balance the network load,reduce the resource waste while cache servers are idle and improve the utilization of servers.Experimental results show that this algorithm has lower computational complexity and fine granularity compared with spectrum average method and GN algorithm and so on.
Key words:
Content Delivery Network(CDN),
complex network,
community structure,
similarity function,
cache server
中图分类号: