SMDP

Minimizing buffer requirements for continuous media servers

Youjip Won, Jaideep Srivastava

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

Excessive buffer requirement to handle continuous-media playbacks is an impediment to cost-effective provisioning for on-line video retrieval. Given the skewed distribution of video popularity, it is expected that often there are concurrent playbacks of the same video file within a short time interval. This creates an opportunity to batch multiple requests and to service them with a single stream from the disk without violating the on-demand constraint. However, there is a need to keep data in memory between successive uses to do this. This leads to a buffer space trade-off between servicing a request in memory mode vs. servicing it in disk-mode. In this work, we develop a novel algorithm to minimize the buffer requirement to support a set of concurrent playbacks. One of the beauties of the proposed scheme is that it enables the server to dynamically adapt to the changing workload while minimizing the total buffer space requirement. Our algorithm makes a significant contribution in decreasing the total buffer requirement, especially when the user access pattern is biased in favor of a small set of files. The idea of the proposed scheme is modeled in detail using an analytical formulation, and optimality of the algorithm is proved. An analytical framework is developed so that the proposed scheme can be used in combination with various existing disk-scheduling strategies. Our simulation results confirm that under certain circumstances, it is much more resource efficient to support some of the playbacks in memory mode and subsequently the proposed scheme enables the server to minimize the overall buffer space requirement.

Original languageEnglish
Pages (from-to)105-117
Number of pages13
JournalMultimedia Systems
Volume8
Issue number2
Publication statusPublished - 2000
Externally publishedYes

Fingerprint

Buffer
Servers
Server
Data storage equipment
Requirements
Concurrent
Disk Scheduling
Scheduling
Minimise
Video Retrieval
Skewed Distribution
Batch
Biased
Workload
Costs
Optimality
Trade-offs
Resources
Interval
Formulation

Keywords

  • Buffer management
  • Data retrieval
  • Disk scheduling
  • Multimedia
  • Synchronization

ASJC Scopus subject areas

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

Cite this

SMDP : Minimizing buffer requirements for continuous media servers. / Won, Youjip; Srivastava, Jaideep.

In: Multimedia Systems, Vol. 8, No. 2, 2000, p. 105-117.

Research output: Contribution to journalArticle

@article{d95dc378ae1e4d3d880843f0cbda875f,
title = "SMDP: Minimizing buffer requirements for continuous media servers",
abstract = "Excessive buffer requirement to handle continuous-media playbacks is an impediment to cost-effective provisioning for on-line video retrieval. Given the skewed distribution of video popularity, it is expected that often there are concurrent playbacks of the same video file within a short time interval. This creates an opportunity to batch multiple requests and to service them with a single stream from the disk without violating the on-demand constraint. However, there is a need to keep data in memory between successive uses to do this. This leads to a buffer space trade-off between servicing a request in memory mode vs. servicing it in disk-mode. In this work, we develop a novel algorithm to minimize the buffer requirement to support a set of concurrent playbacks. One of the beauties of the proposed scheme is that it enables the server to dynamically adapt to the changing workload while minimizing the total buffer space requirement. Our algorithm makes a significant contribution in decreasing the total buffer requirement, especially when the user access pattern is biased in favor of a small set of files. The idea of the proposed scheme is modeled in detail using an analytical formulation, and optimality of the algorithm is proved. An analytical framework is developed so that the proposed scheme can be used in combination with various existing disk-scheduling strategies. Our simulation results confirm that under certain circumstances, it is much more resource efficient to support some of the playbacks in memory mode and subsequently the proposed scheme enables the server to minimize the overall buffer space requirement.",
keywords = "Buffer management, Data retrieval, Disk scheduling, Multimedia, Synchronization",
author = "Youjip Won and Jaideep Srivastava",
year = "2000",
language = "English",
volume = "8",
pages = "105--117",
journal = "Multimedia Systems",
issn = "0942-4962",
publisher = "Springer Verlag",
number = "2",

}

TY - JOUR

T1 - SMDP

T2 - Minimizing buffer requirements for continuous media servers

AU - Won, Youjip

AU - Srivastava, Jaideep

PY - 2000

Y1 - 2000

N2 - Excessive buffer requirement to handle continuous-media playbacks is an impediment to cost-effective provisioning for on-line video retrieval. Given the skewed distribution of video popularity, it is expected that often there are concurrent playbacks of the same video file within a short time interval. This creates an opportunity to batch multiple requests and to service them with a single stream from the disk without violating the on-demand constraint. However, there is a need to keep data in memory between successive uses to do this. This leads to a buffer space trade-off between servicing a request in memory mode vs. servicing it in disk-mode. In this work, we develop a novel algorithm to minimize the buffer requirement to support a set of concurrent playbacks. One of the beauties of the proposed scheme is that it enables the server to dynamically adapt to the changing workload while minimizing the total buffer space requirement. Our algorithm makes a significant contribution in decreasing the total buffer requirement, especially when the user access pattern is biased in favor of a small set of files. The idea of the proposed scheme is modeled in detail using an analytical formulation, and optimality of the algorithm is proved. An analytical framework is developed so that the proposed scheme can be used in combination with various existing disk-scheduling strategies. Our simulation results confirm that under certain circumstances, it is much more resource efficient to support some of the playbacks in memory mode and subsequently the proposed scheme enables the server to minimize the overall buffer space requirement.

AB - Excessive buffer requirement to handle continuous-media playbacks is an impediment to cost-effective provisioning for on-line video retrieval. Given the skewed distribution of video popularity, it is expected that often there are concurrent playbacks of the same video file within a short time interval. This creates an opportunity to batch multiple requests and to service them with a single stream from the disk without violating the on-demand constraint. However, there is a need to keep data in memory between successive uses to do this. This leads to a buffer space trade-off between servicing a request in memory mode vs. servicing it in disk-mode. In this work, we develop a novel algorithm to minimize the buffer requirement to support a set of concurrent playbacks. One of the beauties of the proposed scheme is that it enables the server to dynamically adapt to the changing workload while minimizing the total buffer space requirement. Our algorithm makes a significant contribution in decreasing the total buffer requirement, especially when the user access pattern is biased in favor of a small set of files. The idea of the proposed scheme is modeled in detail using an analytical formulation, and optimality of the algorithm is proved. An analytical framework is developed so that the proposed scheme can be used in combination with various existing disk-scheduling strategies. Our simulation results confirm that under certain circumstances, it is much more resource efficient to support some of the playbacks in memory mode and subsequently the proposed scheme enables the server to minimize the overall buffer space requirement.

KW - Buffer management

KW - Data retrieval

KW - Disk scheduling

KW - Multimedia

KW - Synchronization

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

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

M3 - Article

VL - 8

SP - 105

EP - 117

JO - Multimedia Systems

JF - Multimedia Systems

SN - 0942-4962

IS - 2

ER -