This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Peer Caching Algorithm Based on Global Segment Popularity for P2P VoD System
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
This paper proposed a new algorithm named GSP-K, which is a peer caching algorithm based on global segment popularity for P2P VoD system. This algorithm evaluates the cache utility of media segment via gathering the statistics of media segment popularity globally, and makes the numbers of a media segment copies in the whole system vary directly with it’s cache utility. The simulation experiments indicated that GSP-K algorithm has better performance in increasing statistics precision of segment popularity, cache space utilization rate and segment hit radio than others algorithms such as LRU, LFU and LRU-K.
Index Terms:
Caching Algorithm, Global Segment Popularity, P2P, VoD
Citation:
Liu Jie, Liu Yi-na, Cheng Ling-ling, Tao Jun-cai, "Peer Caching Algorithm Based on Global Segment Popularity for P2P VoD System," csie, vol. 1, pp.140-144, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.