A dynamic optimizing adjustment model for file storage distribution in content delivery network

被引:0
作者
Huang, Yongsheng [1 ]
Tian, Xiaoyu [2 ]
Liu, Yazhi [2 ]
机构
[1] Tangshan Key Laboratory of Irrformationization Technologies and Engineering Control, School of Management, Hebei United University
[2] School of Information Engineering, Hebei United University
来源
Huang, Y. | 1788年 / Asian Network for Scientific Information卷 / 12期
关键词
Ant colony algorithm; Competitive neural network; Content delivery network; File storage distribution;
D O I
10.3923/itj.2013.1788.1795
中图分类号
学科分类号
摘要
In Content Delivery Network (CDN), optimized the file storage distribution in the servers is a proper approach to balance the storage capacity of the servers and the cost of the file location. However, the active users and the files they require are varying with the time going. In this study, a dynamic optimizing adjustment model is proposed to adjusting the file storage distribution corresponding to the variation of the active users of the CDN. In the proposed model, the ant colony optimization algorithm with the competitive neural network algorithm involved is used to adjust the file storage distribution efficiently and effectively. The simulative experimental results testifies that the proposed model can achieve not only steadily smaller time cost of optimization procedure in consideration of the variation of the user scale but also higher hit ratio of file request. © 2031 Asian Network for Scientific Information.
引用
收藏
页码:1788 / 1795
页数:7
相关论文
共 21 条
[1]  
Adler M., Sitaraman R.K., Venkataramani H., Algorithms for optimizing the bandwidth cost of content delivery, Computer Networks, 55, pp. 4007-4020, (2011)
[2]  
Borst S., Gupta V., Wahd A., Self-organizing algorithms for cache cooperation in content distribution networks, Bell. Labs. Technical. J., 14, pp. 113-125, (2009)
[3]  
Calafate C.T., Fortino G., Fritsch S., Monteiro J., Cano J.C., Et al., An efficient and robust content delivery solution for IEEE 802.11p vehicular environments, J. Network. Comput. Applic, 35, pp. 753-762, (2012)
[4]  
Costa F., Suva L., Fedakaudi G., Kelley, Optimizing data distribution in desktop grid platforms, Parall. Proces. Lett, 18, pp. 391-410, (2008)
[5]  
Di S., Wang C.L., Dynamic optimization of multiattribute resource allocation in self-organizing clouds, Trans. Paral. Distrib. Syst., 24, pp. 464-478, (2013)
[6]  
Fang Y., Cohen M.A., Kmcaid T.G., Dynamic analysis of a general class of winner-take-all competitive neural networks, Trans. Neural Networks, 21, pp. 771-783, (2010)
[7]  
Foo B., Turaga D.S., Verscheure O., Van Der Schaar M., Amini L., Configuring trees of classifiers in distributed multimedia stream mining systems, IEEE Trans. Circuits Syst. Video Technol, 21, pp. 245-258, (2011)
[8]  
Gao Q., Fei L., Zhang J., Peng X., Performance optimisation of a medium access control protocol with multiple contention slots in multiple-input multiple-output ad hoc networks, IET. Communie, 4, pp. 562-572, (2010)
[9]  
Halinger G., Hartleb F., Content delivery and caching from a network provider's perspective, Computer Networks, 55, pp. 3991-4006, (2011)
[10]  
Javidi T., Cooperative and non-cooperative resource sharing in networks: A delay perspective, Trans. Automatic Contr., 53, pp. 2134-2142, (2008)