Continuous media servers are increasingly used to support a number of application domains, e.g., entertainment industry, library information systems, educational applications etc. Objects of continuous media data type are large in size and their retrieval and display are subject to real-time constraints. Servers are required to accommodate these objects and ensure their continuous display. In this thesis, we introduce a model for resource scheduling of a video storage server delivering continuous media VBR video data with real-time requirements. The video streams are assumed to be stored in CDL format and distributed across multiple disks. Within a server-network-client model, our framework translates the requirements imposed by video and resource availability into constraints on prefetching in the real-time domain. We present a novel algorithm RT-OPT for optimally prefetching blocks into the server buffer. We show that if the schedule created by RT-OPT fails to meet the deadline of any block, then no feasible schedule is possible for the same buffer size, data placement and single-disk scheduling policy. Simulations with MPEG traces show that RT-OPT achieves high scalability by dynamically multiplexing the buffer among different clients and disks optimally. The number of clients supported is shown to be uniformly superior to intuitive but suboptimal algorithms like GREED-EDF that aggressively keep the disks busy fetching in order of deadlines
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.