Share Email Print

Proceedings Paper

Online media server scheduling design for content delivery networks
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Online media server scheduling algorithms in distributed video-on-demand (VoD) systems are studied in this work. We first formulate a general server scheduling problem based on the VoD service model, where the failure rate and the server-side network bandwidth consumption are identified as two main cost factors in the system. The distributed server scheduler consists of two parts; namely, the request migration scheme and the dynamic content update strategy. By improving the random early migration (REM) scheme, we propose a cost-aware REM (CAREM) scheme to reduce the network bandwidth consumption in the migration process. Furthermore, to accommodate the video popularity and/or client population change, we use the server-video affinity to measure the importance of placing a specific video copy on that server. The dynamic content update strategy uses the server-video affinity metric to reconfigure video copies on media servers. We conduct extensive simulations to measure the performance of proposed algorithms. It can be shown that CAREM together with the dynamic content update strategy can improve the system performance by reducing the request failure rate as well as the server bandwidth consumption.

Paper Details

Date Published: 25 October 2004
PDF: 11 pages
Proc. SPIE 5600, Multimedia Systems and Applications VII, (25 October 2004); doi: 10.1117/12.570806
Show Author Affiliations
Yinqing Zhao, Univ. of Southern California (United States)
C.-C. Jay Kuo, Univ. of Southern California (United States)

Published in SPIE Proceedings Vol. 5600:
Multimedia Systems and Applications VII
Chang Wen Chen; C.-C. Jay Kuo; Anthony Vetro, Editor(s)

© SPIE. Terms of Use
Back to Top