DISTRIBUTED VIDEO PLACEMENT ARCHITECTURE AND ALGORITHMS FOR VIDEO ON DEMAND (VOD) SERVERS.

摘要

The task of allocating multimedia files to the video server is currently handled by an experienced operator which implies a suboptimal and personnel -dependent solution. The complexity of such a problem increases exponentially with the number of files and disks increases in the video servers. The levels of difficulty thereby escalate and the current solution will give rise to higher request blocking ratio and dissatisfaction to customers. The newly designed Methods determine how many replicas of a video should be created as well as the devices on which the replicas should be placed. The method is an online video placement method, i.e., as the expected number of viewers on a video object changes, it dynamically creates and/or deletes existing replicas to better match the characteristics of the devices and their stored objects. The objective of research is to provide optimal video placement in distributed interactive Video-on-demands (VoD) systems. Also there is no algorithm which gives the maximum utilization of the disks in terms of bandwidth and space. The proposed algorithm successfully provides it utilization space and Bandwidth of Disks. Initial phase of video placement requires the calculation of rank of the videos and the number of replicas to be placed on each proxy servers. The result of proposed algorithms shows an efficient solution for this problem. The rank and the numbers of replicas should be updated according to the access requests of the videos dynamically and also the maximum utilization of the disks should be considered. The algorithms with the help of BSR provides maximum disk utilization and the rank algorithm helps to calculate the rank of video and numbers of copies of the videos to be placed/removed.