An Improved Time-Window-Based Content Caching Algorithm

Movie-on-demand services often cost a lot of storage and transport bandwidth. To increase the efficiency of these resources is the key issue of deploying large scale movie-on-demand network. In this paper, the sequence of movies accessed by the subscribers was analyzed. Based on this analysis, a movie-access-model with content updating was built. Then an improved time-window-based content caching algorithm was proposed to solve the problem caused by content updating. And the algorithm was investigated through network simulation. The simulation results show that this algorithm can meet the requirement of content updating.

[1]  Walter Willinger,et al.  Long-range dependence in variable-bit-rate video traffic , 1995, IEEE Trans. Commun..

[2]  Brad Cain,et al.  Known Content Network (CN) Request-Routing Mechanisms , 2003, RFC.

[3]  Chae-Sub Lee.  IPTV over Next Generation Networks in ITU-T , 2007, 2007 2nd IEEE/IFIP International Workshop on Broadband Convergence Networks.

[4]  Reinaldo Penno,et al.  An Architecture for Open Pluggable Edge Services (OPES) , 2004, RFC.

[5]  George Pallis,et al.  Content Delivery Networks: Status and Trends , 2003, IEEE Internet Comput..