Share Email Print

Proceedings Paper

Performance study on media server scheduling in video-on-demand systems
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Media server scheduling in video-on-demand systems includes video content allocation and request migration among servers. In this paper, we present a greedy algorithm to allocate video copies to media servers. It uses a graph model and minimizes the average shortest distance among media servers at each step. In order to study the request migration process, we introduce a state matrix representation that stores the service load information of each media server and plays an important role in the determination of migration paths. Based on this representation, we develop a state transition method to simulate the request migration process and calculate the performance metrics such as failure rates and service delay. The derived results match very well with numerical experiments. It is further demonstrated that the random early migration (REM) algorithm proposed in our previous work outperforms the normal migration scheme with lower failure rates and shorter service delay.

Paper Details

Date Published: 8 August 2003
PDF: 12 pages
Proc. SPIE 5108, Visual Information Processing XII, (8 August 2003); doi: 10.1117/12.486820
Show Author Affiliations
Yinqing Zhao, Univ. of Southern California (United States)
C.-C. J. Jay Kuo, Univ. of Southern California (United States)

Published in SPIE Proceedings Vol. 5108:
Visual Information Processing XII
Zeno J. Geradts; Zia-ur Rahman; Lenny I. Rudin; Robert A. Schowengerdt; Stephen E. Reichenbach, Editor(s)

© SPIE. Terms of Use
Back to Top