Optimal scheduling for parallel CBR video servers

Parallel video servers are necessary for large-scale video-on-demand and ot her multimedia systems. This paper addresses the scheduling problem of para llel video servers. We discuss scheduling requirements of constant bit rate (CBR) video streams. Optimal algorithms are presented for conflict-free sc heduling, delay minimization, request relocation, and admission control. Wi th these algorithms, video streams can be precisely scheduled for Quality o f Service requirements. Performance of these algorithms is also presented.