Distributed video presentations

Een Jun Hwang, V. S. Subrahmanian, B. Prabhakaran

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Editors Anon
Place of PublicationLos Alamitos, CA, United States
PublisherIEEE Comp Soc
Pages268-275
Number of pages8
Publication statusPublished - 1998 Jan 1
Externally publishedYes
EventProceedings of the 1998 14th International Conference on Data Engineering - Orlando, FL, USA
Duration: 1998 Feb 231998 Feb 27

Other

OtherProceedings of the 1998 14th International Conference on Data Engineering
CityOrlando, FL, USA
Period98/2/2398/2/27

Fingerprint

Servers
Bandwidth

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Hwang, E. J., Subrahmanian, V. S., & Prabhakaran, B. (1998). Distributed video presentations. In Anon (Ed.), Proceedings - International Conference on Data Engineering (pp. 268-275). Los Alamitos, CA, United States: IEEE Comp Soc.

Distributed video presentations. / Hwang, Een Jun; Subrahmanian, V. S.; Prabhakaran, B.

Proceedings - International Conference on Data Engineering. ed. / Anon. Los Alamitos, CA, United States : IEEE Comp Soc, 1998. p. 268-275.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hwang, EJ, Subrahmanian, VS & Prabhakaran, B 1998, Distributed video presentations. in Anon (ed.), Proceedings - International Conference on Data Engineering. IEEE Comp Soc, Los Alamitos, CA, United States, pp. 268-275, Proceedings of the 1998 14th International Conference on Data Engineering, Orlando, FL, USA, 98/2/23.
Hwang EJ, Subrahmanian VS, Prabhakaran B. Distributed video presentations. In Anon, editor, Proceedings - International Conference on Data Engineering. Los Alamitos, CA, United States: IEEE Comp Soc. 1998. p. 268-275
Hwang, Een Jun ; Subrahmanian, V. S. ; Prabhakaran, B. / Distributed video presentations. Proceedings - International Conference on Data Engineering. editor / Anon. Los Alamitos, CA, United States : IEEE Comp Soc, 1998. pp. 268-275
@inproceedings{7d6849c84473454985959bd23c18f45d,
title = "Distributed video presentations",
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.",
author = "Hwang, {Een Jun} and Subrahmanian, {V. S.} and B. Prabhakaran",
year = "1998",
month = "1",
day = "1",
language = "English",
pages = "268--275",
editor = "Anon",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "IEEE Comp Soc",

}

TY - GEN

T1 - Distributed video presentations

AU - Hwang, Een Jun

AU - Subrahmanian, V. S.

AU - Prabhakaran, B.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031701178&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031701178&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0031701178

SP - 268

EP - 275

BT - Proceedings - International Conference on Data Engineering

A2 - Anon, null

PB - IEEE Comp Soc

CY - Los Alamitos, CA, United States

ER -