An event-based model for continuous media data on heterogeneous disk servers

Kasim Candan, E. Hwang, V. S. Subrahmanian

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Over the last few years, there has been intense work on the problem of retrieval of continuous media (CM) data from disk. However, no single unified framework exists within which such retrieval problems can be studied. In this paper, we first propose a formal model for CM data retrieval from heterogeneous disk servers. This model can be used to characterize CM data retrieval problems independently of how data is laid out on disk, and what objectives (e.g., minimize client delay, maximize buffer utilization, etc.) the system manager is interested in. We then show how using this formal model, we can neatly define what it means to optimally handle events that occur in movie-on-demand (MOD) systems. Examples of such events include new clients entering the system, old clients leaving the system, continuing clients doing pause, rewind and fast-forward operations. Multiple events may occur simultaneously and we show how such events trigger state transitions in the system. We then develop an algorithm called the QuickSOL algorithm that handles events occurring in MOD systems. This algorithm works in two phases: in the first phase, it quickly finds a way of handling as many of the events occurring at time t as possible. In the second phase, it optimizes the solution found in the first phase. The advantage is that the algorithm can be interrupted anytime after the first phase is completed. We report on experiments showing that QuickSOL works well in practice.

Original languageEnglish (US)
Pages (from-to)251-270
Number of pages20
JournalMultimedia Systems
Volume6
Issue number4
StatePublished - 1998

Fingerprint

Servers
Server
Retrieval
Formal Model
Model
Managers
State Transition
Trigger
Buffer
Maximise
Optimise
Minimise
Experiments
Experiment
Demand

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Cite this

An event-based model for continuous media data on heterogeneous disk servers. / Candan, Kasim; Hwang, E.; Subrahmanian, V. S.

In: Multimedia Systems, Vol. 6, No. 4, 1998, p. 251-270.

Research output: Contribution to journalArticle

Candan, K, Hwang, E & Subrahmanian, VS 1998, 'An event-based model for continuous media data on heterogeneous disk servers', Multimedia Systems, vol. 6, no. 4, pp. 251-270.
Candan, Kasim ; Hwang, E. ; Subrahmanian, V. S. / An event-based model for continuous media data on heterogeneous disk servers. In: Multimedia Systems. 1998 ; Vol. 6, No. 4. pp. 251-270.
@article{32fea90f43f7421ea0da2b193d843989,
title = "An event-based model for continuous media data on heterogeneous disk servers",
abstract = "Over the last few years, there has been intense work on the problem of retrieval of continuous media (CM) data from disk. However, no single unified framework exists within which such retrieval problems can be studied. In this paper, we first propose a formal model for CM data retrieval from heterogeneous disk servers. This model can be used to characterize CM data retrieval problems independently of how data is laid out on disk, and what objectives (e.g., minimize client delay, maximize buffer utilization, etc.) the system manager is interested in. We then show how using this formal model, we can neatly define what it means to optimally handle events that occur in movie-on-demand (MOD) systems. Examples of such events include new clients entering the system, old clients leaving the system, continuing clients doing pause, rewind and fast-forward operations. Multiple events may occur simultaneously and we show how such events trigger state transitions in the system. We then develop an algorithm called the QuickSOL algorithm that handles events occurring in MOD systems. This algorithm works in two phases: in the first phase, it quickly finds a way of handling as many of the events occurring at time t as possible. In the second phase, it optimizes the solution found in the first phase. The advantage is that the algorithm can be interrupted anytime after the first phase is completed. We report on experiments showing that QuickSOL works well in practice.",
author = "Kasim Candan and E. Hwang and Subrahmanian, {V. S.}",
year = "1998",
language = "English (US)",
volume = "6",
pages = "251--270",
journal = "Multimedia Systems",
issn = "0942-4962",
publisher = "Springer Verlag",
number = "4",

}

TY - JOUR

T1 - An event-based model for continuous media data on heterogeneous disk servers

AU - Candan, Kasim

AU - Hwang, E.

AU - Subrahmanian, V. S.

PY - 1998

Y1 - 1998

N2 - Over the last few years, there has been intense work on the problem of retrieval of continuous media (CM) data from disk. However, no single unified framework exists within which such retrieval problems can be studied. In this paper, we first propose a formal model for CM data retrieval from heterogeneous disk servers. This model can be used to characterize CM data retrieval problems independently of how data is laid out on disk, and what objectives (e.g., minimize client delay, maximize buffer utilization, etc.) the system manager is interested in. We then show how using this formal model, we can neatly define what it means to optimally handle events that occur in movie-on-demand (MOD) systems. Examples of such events include new clients entering the system, old clients leaving the system, continuing clients doing pause, rewind and fast-forward operations. Multiple events may occur simultaneously and we show how such events trigger state transitions in the system. We then develop an algorithm called the QuickSOL algorithm that handles events occurring in MOD systems. This algorithm works in two phases: in the first phase, it quickly finds a way of handling as many of the events occurring at time t as possible. In the second phase, it optimizes the solution found in the first phase. The advantage is that the algorithm can be interrupted anytime after the first phase is completed. We report on experiments showing that QuickSOL works well in practice.

AB - Over the last few years, there has been intense work on the problem of retrieval of continuous media (CM) data from disk. However, no single unified framework exists within which such retrieval problems can be studied. In this paper, we first propose a formal model for CM data retrieval from heterogeneous disk servers. This model can be used to characterize CM data retrieval problems independently of how data is laid out on disk, and what objectives (e.g., minimize client delay, maximize buffer utilization, etc.) the system manager is interested in. We then show how using this formal model, we can neatly define what it means to optimally handle events that occur in movie-on-demand (MOD) systems. Examples of such events include new clients entering the system, old clients leaving the system, continuing clients doing pause, rewind and fast-forward operations. Multiple events may occur simultaneously and we show how such events trigger state transitions in the system. We then develop an algorithm called the QuickSOL algorithm that handles events occurring in MOD systems. This algorithm works in two phases: in the first phase, it quickly finds a way of handling as many of the events occurring at time t as possible. In the second phase, it optimizes the solution found in the first phase. The advantage is that the algorithm can be interrupted anytime after the first phase is completed. We report on experiments showing that QuickSOL works well in practice.

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

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

M3 - Article

AN - SCOPUS:0005077886

VL - 6

SP - 251

EP - 270

JO - Multimedia Systems

JF - Multimedia Systems

SN - 0942-4962

IS - 4

ER -