Open Access

Medusa: A Novel Stream-Scheduling Scheme for Parallel Video Servers

EURASIP Journal on Advances in Signal Processing20042004:967232

Received: 6 December 2002

Published: 4 March 2004


Parallel video servers provide highly scalable video-on-demand service for a huge number of clients. The conventional stream-scheduling scheme does not use I/O and network bandwidth efficiently. Some other schemes, such as batching and stream merging, can effectively improve server I/O and network bandwidth efficiency. However, the batching scheme results in long start-up latency and high reneging probability. The traditional stream-merging scheme does not work well at high client-request rates due to mass retransmission of the same video data. In this paper, a novel stream-scheduling scheme, called Medusa, is developed for minimizing server bandwidth requirements over a wide range of client-request rates. Furthermore, the start-up latency raised by Medusa scheme is far less than that of the batching scheme.

Keywords and phrases

video-on-demand (VOD)stream batchingstream mergingmulticastunicast

Authors’ Affiliations

School of Computer Science and Technology, Huazhong University of Science and Technology


© Jin et al. 2004