Studies Work ExperiencePublicationsContact InformationLinks

Access Time Minimization for Distributed Multimedia Applications

Abstract

The problem of minimizing the access time of a requested multimedia (MM) document on a network based environment is addressed. A generalized version of this problem is formulated and retrieval strategies that minimize the access time of the user-requested MM document from a pool of MM servers are proposed. To this end, we propose  single-installment and multi-installment MM document retrieval strategies, through which the minimization of access time can be carried out. 

We first introduce a directed flow graph (DFG) model to represent the retrieval process and generate a set of recursive equations using this DFG. Then, we derive closed-form solutions for the portions of the MM document downloaded from the various servers and the corresponding access time.  We present rigorous analysis for these strategies and show their performance under MPEG I and MPEG II video streams playback rates. Their behavior under different network bandwidths is also examined, revealing in-depth information about their expected performance. 

We also show that in the case of a multi-installment strategy, the access time can be completely controlled by fine tuning the number of installments.  Trade-off studies with respect to the number of servers involved in the retrieval process and the number of installments are presented. In the case of a heterogeneous network employing a single-installment strategy, we prove that the access time is independent of the server sequence used. Illustrative examples are provided for ease of understanding.