Performance benchmarks for an interactive video-on-demand system

Little and Venkatesh conjectured that, for an interactive VoD system with a single random trial resource selection scheme, the blocking probability of a user´s request is minimized when the overall movie traffic load is spread uniformly on each disk in the system. In this paper, we generalize this conjecture to the situation where there can be repeated random trials or where a least busy fit resource selection scheme is used. We support our conjecture with a simulation of a realistic system, and propose a metric following the idea of our conjecture to assess the goodness of movie assignment in the system.