DocumentCode
2141250
Title
A proxy caching algorithm based on popularity for streaming media
Author
Ge Yang
Author_Institution
Coll. of Inf. Sci. & Technol., Beijing Normal Univ., Zhuhai, China
fYear
2013
fDate
23-25 July 2013
Firstpage
1520
Lastpage
1525
Abstract
A novel proxy caching algorithm P2CASM (Proxy Caching Algorithm Based on Popularity for Streaming Media) based on segment popularity for streaming media was proposed. A proxy caching admission and replacement algorithm based on the segment popularity for streaming media objects was implemented. The principle was obeyed that the data cached for each streaming media objects were in proportion to their popularity on the proxy server. The size of the caching window was updated periodically according to the average access time of the clients. P2P replica could be cached on a P2P proxy. Simulation results showed that this algorithm was more adaptive than A2LS (Adaptive and Lazy Segmentation Algorithm) algorithm for the variety of the proxy server cache. It could gain more average number of cached streaming media objects and less delayed requested ratio while byte-hit ratio of P2CASM algorithm was close to or exceeded A2LS algorithm under the circumstance of the same proxy cache space.
Keywords
cache storage; media streaming; peer-to-peer computing; P2P proxy; P2P replica; P2CASM; average access time; byte-hit ratio; proxy caching admission algorithm; proxy caching algorithm-based-on-popularity-for-streaming media; proxy caching replacement algorithm; proxy server cache; requested ratio; Algorithm design and analysis; Delays; Educational institutions; Media; Phase change random access memory; Servers; Streaming media; caching algorithm; replication technology; segment popularity; streaming media;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation (ICNC), 2013 Ninth International Conference on
Conference_Location
Shenyang
Type
conf
DOI
10.1109/ICNC.2013.6818222
Filename
6818222
Link To Document