Peer Caching Algorithm Based on Global Segment Popularity for P2P VoD System

Author

Jie, Liu ; Yi-na, Liu ; Ling-ling, Cheng ; Jun-cai, Tao

Author_Institution

Coll. of Inf. Sci. & Eng., Nanchang Univ., Nanchang, China

Volume

1

fYear

2009

fDate

March 31 2009-April 2 2009

Firstpage

140

Lastpage

144

Abstract

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 itpsilas 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.

Keywords

media streaming; peer-to-peer computing; statistical analysis; video on demand; GSP-K algorithm; P2P VoD system; cache space utilization rate; global segment popularity; media segment popularity; peer caching algorithm; segment hit radio; statistic precision; Algorithm design and analysis; Computer science; Educational technology; Frequency; IP networks; Peer to peer computing; Pollution; Statistics; Streaming media; Video on demand; Caching Algorithm; Global Segment Popularity; P2P; VoD;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Information Engineering, 2009 WRI World Congress on

Conference_Location

Los Angeles, CA

Print_ISBN

978-0-7695-3507-4

Type

conf

DOI

10.1109/CSIE.2009.425

Filename

5171150