Skip to main content

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

Abstract

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.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Hai Jin.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Jin, H., Deng, D. & Pang, L. Medusa: A Novel Stream-Scheduling Scheme for Parallel Video Servers. EURASIP J. Adv. Signal Process. 2004, 967232 (2004). https://doi.org/10.1155/S1110865704310115

Download citation

Keywords and phrases

  • video-on-demand (VOD)
  • stream batching
  • stream merging
  • multicast
  • unicast