Proxy cache replacement strategies based on bytes benefit of streaming media file

This paper discusses the problem about cache replacement strategy on the proxy where the remote streaming media files were replicated by which the client startup delay, the server traffic and the wide area network bandwidth could be reduced. Cache replacement strategy is an approach by which the proxy can collect available space in order to cache object by filtering out the least valuable object in the cache one by one. The least valuable object is determined by ranking object values. Thus, the value function is a key issue having a great impact on performance measurement such as hit ratio and byte hit ratio. By formulating a model of replacement algorithm based on the analysis of cache replacement in streaming media systems, authors put forword the concept of bytes benefit of streaming media file and apply it to the design of replacement algorithms, and propose BB, BBLRU-K and BBLCB-K replacement algorithms. The concept is formed by the fact that someone does not usually use a streaming media file completely, which means that we can evaluate the file's values based on the used bytes number of the file. Simulation indicates that among these algorithms and existing algorithms such as LRU-2, LFU, LCB-2, and LRU, BBLCB-2 has the best average performance, while BB is simple and efficient, only relate to the bytes benefit of streaming media file and its performance is very close to the BBLCB-2.EI0121633-16412