A Dynamic Caching Algorithm Based on the Pheromone for Content Distribution Networks

被引:0
作者
Park, Jeman [1 ]
Joe, Inwhee [1 ]
机构
[1] Hanyang Univ, Dept Elect Comp Engn, Seoul 133791, South Korea
来源
COMPUTER APPLICATIONS FOR GRAPHICS, GRID COMPUTING, AND INDUSTRIAL ENVIRONMENT | 2012年 / 351卷
关键词
CDN; segment based caching; pheromone;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A content distribution network (CDN) is a system to improve the delivery of content to the end users on the Internet, in which popular content may be cached or replicated at a number of servers, placed closer to some client populations. The design of a CDN consists of defining which content should be replicated at each server, the number of servers, where they should be placed in the network, which server a client's requests should be sent to, and how server responses should be routed to the clients. CDNs were originally designed for traditional web files. However, given the increase in streaming media content on the Internet, the development of efficient CDN design methods that take into account the special characteristics of media objects, is of great interest. These characteristics include sustained high bandwidth requirements and faster response time by multicast delivery. The main goal of this paper is to propose an algorithm for designing a streaming media CDN with the efficient byte hit ratio and fast response time. We propose the segment-based dynamic caching mechanism with the pheromone that is defined a kind of lifetime of each segment. We evaluate this algorithm in simulations using CDNsim.
引用
收藏
页码:61 / 67
页数:7
相关论文
共 7 条
[1]   Silo, rainbow, and caching token: Schemes for scalable, fault tolerant stream caching [J].
Chae, YS ;
Guo, K ;
Buddhikot, MM ;
Suri, S ;
Zegura, EW .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2002, 20 (07) :1328-1344
[2]  
Chen S., 2005, IEEE MULTIMEDIA, V12
[3]  
Chesire M., P 3 USENIX S INT
[4]  
Rejaie R., 1999, P WCW 1999 APR
[5]  
SEN S, 1999, P IEEE INFOCOM 1999
[6]  
Stamos K., 2009, ACM T M IN PRESS FEB
[7]  
Wu Kun-Lung., 2001, P 10 INT C WORLD WID, P36