|
|
|
| A Dynamic Scheduling Algorithm for Streaming Media Based on the Cache Window and Segment Patch Pre-fetching |
| Yang Ge①②; Zhu Xiao-min①; Liao Jian-xin①; Huang Hai① |
| ①State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;②College of Information Science and Technology, Liaoning University, Shenyang 110036, China |
|
|
|
|
Abstract A novel dynamic scheduling algorithm for mobile streaming media based on the cache window and segment patch pre-fetching is proposed. It employs the scheme that the cache window size can be increased or decreased adaptively according to the popularity of the requested object and the patch bytes that are segmented and cached. The principle is obeyed that the data cached for each mobile streaming media object are in proportion to their popularity at the proxy server. Simulation results show that this strategy is more adaptive than conventional algorithm for the variety of the request arrival rates. It can significantly reduce patching data through patching channel under the circumstance of the same maximum cache space. This can effectively reduce the server load and network bandwidth usage on backbone link. It can faster cache the media object than P3S2A algorithm. It reduces the average occupied cache space at the proxy.
|
|
Received: 14 April 2006
|
|
|
|
|
|
|
|
|
2007, Vol. 29 
