Video streams are important elements in multimedia service environment. Video streams require high I/O bandwidth as well as large amounts of memory. Due to these properties, in a video server, an efficient video placement and access method is required to gurantee continuous and real-time services.
In this thesis, we propose a dynamic access strategy along with two video placement algorithms. Video placement algorithms allocate replicas of each video stream to proper disk-array-based clusters depending on expected access rates. The dynamic access algorithm determines an appropriate cluster to the user requests and dynamically creates replica of a video stream to reduce the failure rate. We show by simulation experiments that the proposed method works better than the static access algorithms proposed earlier.
