Abstract
In this paper, we consider a distributed video server environment where video movies need not be stored entirely in one server. Blocks of a video movie are allowed to be distributed and replicated over multiple video servers. Customers are served by one video server. This video server, termed originating server, might have to interact with other servers for down-loading missing blocks of the requested movie. We present three types of presentation plans that an originating server can possibly construct for satisfying a customer's request. A presentation plan can be considered as a detailed (temporally synchronized) sequence of steps carried out by the originating server for presenting the requested movie to the customer. Creation of presentation plans involves obtaining commitments from other video servers and the network service provider, as well as making commitments of local resources, within the limitations of available bandwidth, available buffer, and customer consumption rates. For evaluating the goodness of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer, and minimizing access bandwidth. We present algorithms for computing optimal presentation plans, and compare experimentally their performance. We have also mathematically proved certain results for the presentation plans.
| Original language | English |
|---|---|
| Pages | 268-275 |
| Number of pages | 8 |
| Publication status | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 14th International Conference on Data Engineering - Orlando, FL, USA Duration: 1998 Feb 23 → 1998 Feb 27 |
Other
| Other | Proceedings of the 1998 14th International Conference on Data Engineering |
|---|---|
| City | Orlando, FL, USA |
| Period | 98/2/23 → 98/2/27 |
ASJC Scopus subject areas
- Software
- Signal Processing
- Information Systems