Continuous-time collaborative prefetching of continuous media

Soohyun Oh, Beshan Kulapala, Andrea Richa, Martin Reisslein

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

The real-time streaming of bursty continuous media, such as variable-bit rate encoded video, to buffered clients over networks can be made more efficient by collaboratively prefetching parts of the ongoing streams into the client buffers. The existing collaborative prefetching schemes have been developed for discrete time models, where scheduling decisions for all ongoing streams are typically made for one frame period at a time. This leads to inefficiencies as the network bandwidth is not utilized for some duration at the end of the frame period when no video frame "fits" into the remaining transmission capacity in the schedule. To overcome this inefficiency, we conduct in this paper an extensive study of collaborative prefetching in a continuous-time model. In the continuous-time model, video frames are transmitted continuously across frame periods, while making sure that frames are only transmitted if they meet their discrete playout deadlines. We specify a generic framework for continuous-time collaborative prefetching and a wide array of priority functions to be used for making scheduling decisions within the framework. We conduct an algorithm-theoretic study of the resulting continuous-time prefetching algorithms and evaluate their fairness and starvation probability performance through simulations. We find that the continuous-time prefetching algorithms give favorable fairness and starvation probability performance.

Original languageEnglish (US)
Article number4415274
Pages (from-to)36-51
Number of pages16
JournalIEEE Transactions on Broadcasting
Volume54
Issue number1
DOIs
StatePublished - Mar 2008

Fingerprint

Scheduling
Bandwidth

Keywords

  • Client buffer
  • Continuous media
  • Continuous-time
  • Fairness
  • Playback starvation
  • Prefetching
  • Prerecorded media
  • Traffic smoothing
  • Video streaming

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Continuous-time collaborative prefetching of continuous media. / Oh, Soohyun; Kulapala, Beshan; Richa, Andrea; Reisslein, Martin.

In: IEEE Transactions on Broadcasting, Vol. 54, No. 1, 4415274, 03.2008, p. 36-51.

Research output: Contribution to journalArticle

@article{c5017e635df349eb87eda8090d4f264c,
title = "Continuous-time collaborative prefetching of continuous media",
abstract = "The real-time streaming of bursty continuous media, such as variable-bit rate encoded video, to buffered clients over networks can be made more efficient by collaboratively prefetching parts of the ongoing streams into the client buffers. The existing collaborative prefetching schemes have been developed for discrete time models, where scheduling decisions for all ongoing streams are typically made for one frame period at a time. This leads to inefficiencies as the network bandwidth is not utilized for some duration at the end of the frame period when no video frame {"}fits{"} into the remaining transmission capacity in the schedule. To overcome this inefficiency, we conduct in this paper an extensive study of collaborative prefetching in a continuous-time model. In the continuous-time model, video frames are transmitted continuously across frame periods, while making sure that frames are only transmitted if they meet their discrete playout deadlines. We specify a generic framework for continuous-time collaborative prefetching and a wide array of priority functions to be used for making scheduling decisions within the framework. We conduct an algorithm-theoretic study of the resulting continuous-time prefetching algorithms and evaluate their fairness and starvation probability performance through simulations. We find that the continuous-time prefetching algorithms give favorable fairness and starvation probability performance.",
keywords = "Client buffer, Continuous media, Continuous-time, Fairness, Playback starvation, Prefetching, Prerecorded media, Traffic smoothing, Video streaming",
author = "Soohyun Oh and Beshan Kulapala and Andrea Richa and Martin Reisslein",
year = "2008",
month = "3",
doi = "10.1109/TBC.2007.910921",
language = "English (US)",
volume = "54",
pages = "36--51",
journal = "IEEE Transactions on Broadcasting",
issn = "0018-9316",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Continuous-time collaborative prefetching of continuous media

AU - Oh, Soohyun

AU - Kulapala, Beshan

AU - Richa, Andrea

AU - Reisslein, Martin

PY - 2008/3

Y1 - 2008/3

N2 - The real-time streaming of bursty continuous media, such as variable-bit rate encoded video, to buffered clients over networks can be made more efficient by collaboratively prefetching parts of the ongoing streams into the client buffers. The existing collaborative prefetching schemes have been developed for discrete time models, where scheduling decisions for all ongoing streams are typically made for one frame period at a time. This leads to inefficiencies as the network bandwidth is not utilized for some duration at the end of the frame period when no video frame "fits" into the remaining transmission capacity in the schedule. To overcome this inefficiency, we conduct in this paper an extensive study of collaborative prefetching in a continuous-time model. In the continuous-time model, video frames are transmitted continuously across frame periods, while making sure that frames are only transmitted if they meet their discrete playout deadlines. We specify a generic framework for continuous-time collaborative prefetching and a wide array of priority functions to be used for making scheduling decisions within the framework. We conduct an algorithm-theoretic study of the resulting continuous-time prefetching algorithms and evaluate their fairness and starvation probability performance through simulations. We find that the continuous-time prefetching algorithms give favorable fairness and starvation probability performance.

AB - The real-time streaming of bursty continuous media, such as variable-bit rate encoded video, to buffered clients over networks can be made more efficient by collaboratively prefetching parts of the ongoing streams into the client buffers. The existing collaborative prefetching schemes have been developed for discrete time models, where scheduling decisions for all ongoing streams are typically made for one frame period at a time. This leads to inefficiencies as the network bandwidth is not utilized for some duration at the end of the frame period when no video frame "fits" into the remaining transmission capacity in the schedule. To overcome this inefficiency, we conduct in this paper an extensive study of collaborative prefetching in a continuous-time model. In the continuous-time model, video frames are transmitted continuously across frame periods, while making sure that frames are only transmitted if they meet their discrete playout deadlines. We specify a generic framework for continuous-time collaborative prefetching and a wide array of priority functions to be used for making scheduling decisions within the framework. We conduct an algorithm-theoretic study of the resulting continuous-time prefetching algorithms and evaluate their fairness and starvation probability performance through simulations. We find that the continuous-time prefetching algorithms give favorable fairness and starvation probability performance.

KW - Client buffer

KW - Continuous media

KW - Continuous-time

KW - Fairness

KW - Playback starvation

KW - Prefetching

KW - Prerecorded media

KW - Traffic smoothing

KW - Video streaming

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

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

U2 - 10.1109/TBC.2007.910921

DO - 10.1109/TBC.2007.910921

M3 - Article

AN - SCOPUS:40349103683

VL - 54

SP - 36

EP - 51

JO - IEEE Transactions on Broadcasting

JF - IEEE Transactions on Broadcasting

SN - 0018-9316

IS - 1

M1 - 4415274

ER -