Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

901 A Flexible Real-time Hierarchical Multimedia Archive
Home Policy Brochure Browse Search User Area Contact Help

Lijding, M.E.M. and Jansen, P.G. and Mullender, S.J. (2002) A Flexible Real-time Hierarchical Multimedia Archive. In: Joint Int. Workshop on Interactive Distributed Multimedia Systems / Protocols for Multimedia Systems (IDMS/PROMS), Coimbra, Portugal. pp. 229-240. Springer-Verlag. ISBN 3-540-00169-7

Full text available as:


272 Kb
Open Access

Official URL:


We present a hierarchical multimedia archive that can serve complex multimedia requests from tertiary storage. Requests can consist of multiple request units of streamed and non-streamed data. The request units can have arbitrary synchronization patterns. Our scheduler Promote-IT promotes data from tertiary to secondary storage with real-time guarantees. Promote-IT uses an on-line heuristic algorithm to compute feasible schedules and a separate ASAP dispatcher to increase the efficiency of the resource usage. The heuristic algorithm runs in polynomial time. Schedules are optimized to give short response times to incoming requests. Three major problems complicate this scheduling problem. First, the fragments of requested real-time data and their synchronization are unpredictable. Second, the medium switching times in tertiary storage are high, and the number of drives and robots is low compared to the number of removable media. Third, the shared resources in the tertiary storage system create resource contention problems.

Item Type:Conference or Workshop Paper (Proceedings UNSPECIFIED, Presentation Type UNSPECIFIED)
Research Group:EWI-DIES: Distributed and Embedded Security
Research Program:CTIT-UBRICKS: Building Blocks for Ubiquitous Computing and Communication
Research Project:@HA: @ Home Anywhere
Additional Information:Imported from DIES
ID Code:901
Deposited On:12 December 2005
More Information:statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item