Scheduling video streams in a large-scale video-on-demand server

✍ Scribed by Jinsung Cho; Heonshik Shin

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 869 KB
• Volume: 23
• Category: Article
• ISSN: 0167-8191
• DOI: 10.1016/s0167-8191(97)00085-9

✦ Synopsis

This paper addresses the design problems concerning a large-scale, parallel video-on-demand server that consists of multiple clusters of nodes connected by a high performance interconnection network. In order to efficiently control the flow of video streams, we propose two scheduling algorithms for data retrieval and communication. First, we present a disk scheduling algorithm called round scheduling which fully utilizes disk bandwidth, minimizing the disk idle time while the server retrieves data blocks. Second, a communication scheduling algorithm is developed to guarantee conflict-free communication over the multistage interconnection network that is topologically equivalent to the Omega network. We also show some simulation results on the server configuration. Analysis of tradeoffs between the server utilization and the start-up latency helps to determine the proper number and size of server clusters for a set of given nodes. 0 1997 Elsevier Science B.V.