Presentation planning for distributed VoD systems

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.

Original languageEnglish
Pages (from-to)1059-1077
Number of pages19
JournalIEEE Transactions on Knowledge and Data Engineering
Volume14
Issue number5
DOIs
Publication statusPublished - 2002 Sep 1
Externally publishedYes

Fingerprint

Video on demand
Servers
Planning
Bandwidth
Computer networks

Keywords

  • Distributed VoD
  • Optimal presentation
  • Presentation plan
  • Video server

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Artificial Intelligence
  • Information Systems

Cite this

Presentation planning for distributed VoD systems. / Hwang, Een Jun; Prabhakaran, B.; Subrahmanian, V. S.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 14, No. 5, 01.09.2002, p. 1059-1077.

Research output: Contribution to journalArticle

Hwang, Een Jun ; Prabhakaran, B. ; Subrahmanian, V. S. / Presentation planning for distributed VoD systems. In: IEEE Transactions on Knowledge and Data Engineering. 2002 ; Vol. 14, No. 5. pp. 1059-1077.
@article{83290940d33a4ee3b4eca315e24fcb76,
title = "Presentation planning for distributed VoD systems",
abstract = "A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.",
keywords = "Distributed VoD, Optimal presentation, Presentation plan, Video server",
author = "Hwang, {Een Jun} and B. Prabhakaran and Subrahmanian, {V. S.}",
year = "2002",
month = "9",
day = "1",
doi = "10.1109/TKDE.2002.1033774",
language = "English",
volume = "14",
pages = "1059--1077",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - Presentation planning for distributed VoD systems

AU - Hwang, Een Jun

AU - Prabhakaran, B.

AU - Subrahmanian, V. S.

PY - 2002/9/1

Y1 - 2002/9/1

N2 - A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.

AB - A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.

KW - Distributed VoD

KW - Optimal presentation

KW - Presentation plan

KW - Video server

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

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

U2 - 10.1109/TKDE.2002.1033774

DO - 10.1109/TKDE.2002.1033774

M3 - Article

AN - SCOPUS:0036708978

VL - 14

SP - 1059

EP - 1077

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 5

ER -