Algorithms for scalable content distribution

Ernst W. Biersack, Anwar Al Hamra, Guillaume Urvoy-Keller, David Choi, Dimitrios N. Serpanos, Apostolos Traganitis

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this chapter, we address how to achieve scalable content distributions. We present two contributions, each of which uses a different approach to distribute the content. In the first part of this chapter, we consider a terrestrial overlay network and build on top of it a VoD service for fixed clients. The goal is to minimize the operational cost of the service. Our contibutions are as follows. First, we introduce a new video distribution architecture that combines open-loop and closed-loop schemes. This combination makes the overall system highly scalable, very cost-effective, and ensures a zero start-up delay. Our second contribution is a mathematical model for the cost of delivering a video as a function of the popularity of that video. Our analytical model, along with some extensions, allows us to explore several scenarios: (i) long videos of 90 min (movies), (ii) short videos of a few min (clips), (iii) the dimensioning of a video on demand service from scratch, and (iv) the case of the optimization of an already installed video on demand service (i.e. the limited resources scenario). In the second part of this chapter, we consider a satellite distribution of contents to mobile users, or in general to users thar are occasionally connected. We consider a push-based model, where the server periodically downloads objects. We assume that clients register to the service off-line. Our goal is to minimize the mean aggregate reception delay over all objects where each object is weighted by its popularity. Our contibutions in this part are as follows. First, we provide a simple proof for the need of periodicity (equal distance in transmission) of popular objects in a cycle. Second, in contrast to existing results, we consider the scheduling problem for caching clients. To increase the performance of the system, we also evaluate a pre-emptive scheduling algorithm that allows interruption (pre-emption) of an object's transmission in order to transmit on schedule another more popular one.

Original languageEnglish
Pages (from-to)207-262
Number of pages56
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2856
Publication statusPublished - 1 Dec 2003
Externally publishedYes

Fingerprint

Content Distribution
Video on demand
Costs and Cost Analysis
Video on Demand
Costs
Overlay networks
Periodicity
Motion Pictures
Scheduling algorithms
Surgical Instruments
Analytical models
Appointments and Schedules
Preemptive Scheduling
Theoretical Models
Minimise
Servers
Dimensioning
Scenarios
Scheduling
Satellites

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Biersack, E. W., Al Hamra, A., Urvoy-Keller, G., Choi, D., Serpanos, D. N., & Traganitis, A. (2003). Algorithms for scalable content distribution. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2856, 207-262.

Algorithms for scalable content distribution. / Biersack, Ernst W.; Al Hamra, Anwar; Urvoy-Keller, Guillaume; Choi, David; Serpanos, Dimitrios N.; Traganitis, Apostolos.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2856, 01.12.2003, p. 207-262.

Research output: Contribution to journalArticle

Biersack, Ernst W. ; Al Hamra, Anwar ; Urvoy-Keller, Guillaume ; Choi, David ; Serpanos, Dimitrios N. ; Traganitis, Apostolos. / Algorithms for scalable content distribution. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2003 ; Vol. 2856. pp. 207-262.
@article{b950e17167bf4b90bc54eea1e7fe09e8,
title = "Algorithms for scalable content distribution",
abstract = "In this chapter, we address how to achieve scalable content distributions. We present two contributions, each of which uses a different approach to distribute the content. In the first part of this chapter, we consider a terrestrial overlay network and build on top of it a VoD service for fixed clients. The goal is to minimize the operational cost of the service. Our contibutions are as follows. First, we introduce a new video distribution architecture that combines open-loop and closed-loop schemes. This combination makes the overall system highly scalable, very cost-effective, and ensures a zero start-up delay. Our second contribution is a mathematical model for the cost of delivering a video as a function of the popularity of that video. Our analytical model, along with some extensions, allows us to explore several scenarios: (i) long videos of 90 min (movies), (ii) short videos of a few min (clips), (iii) the dimensioning of a video on demand service from scratch, and (iv) the case of the optimization of an already installed video on demand service (i.e. the limited resources scenario). In the second part of this chapter, we consider a satellite distribution of contents to mobile users, or in general to users thar are occasionally connected. We consider a push-based model, where the server periodically downloads objects. We assume that clients register to the service off-line. Our goal is to minimize the mean aggregate reception delay over all objects where each object is weighted by its popularity. Our contibutions in this part are as follows. First, we provide a simple proof for the need of periodicity (equal distance in transmission) of popular objects in a cycle. Second, in contrast to existing results, we consider the scheduling problem for caching clients. To increase the performance of the system, we also evaluate a pre-emptive scheduling algorithm that allows interruption (pre-emption) of an object's transmission in order to transmit on schedule another more popular one.",
author = "Biersack, {Ernst W.} and {Al Hamra}, Anwar and Guillaume Urvoy-Keller and David Choi and Serpanos, {Dimitrios N.} and Apostolos Traganitis",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2856",
pages = "207--262",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Algorithms for scalable content distribution

AU - Biersack, Ernst W.

AU - Al Hamra, Anwar

AU - Urvoy-Keller, Guillaume

AU - Choi, David

AU - Serpanos, Dimitrios N.

AU - Traganitis, Apostolos

PY - 2003/12/1

Y1 - 2003/12/1

N2 - In this chapter, we address how to achieve scalable content distributions. We present two contributions, each of which uses a different approach to distribute the content. In the first part of this chapter, we consider a terrestrial overlay network and build on top of it a VoD service for fixed clients. The goal is to minimize the operational cost of the service. Our contibutions are as follows. First, we introduce a new video distribution architecture that combines open-loop and closed-loop schemes. This combination makes the overall system highly scalable, very cost-effective, and ensures a zero start-up delay. Our second contribution is a mathematical model for the cost of delivering a video as a function of the popularity of that video. Our analytical model, along with some extensions, allows us to explore several scenarios: (i) long videos of 90 min (movies), (ii) short videos of a few min (clips), (iii) the dimensioning of a video on demand service from scratch, and (iv) the case of the optimization of an already installed video on demand service (i.e. the limited resources scenario). In the second part of this chapter, we consider a satellite distribution of contents to mobile users, or in general to users thar are occasionally connected. We consider a push-based model, where the server periodically downloads objects. We assume that clients register to the service off-line. Our goal is to minimize the mean aggregate reception delay over all objects where each object is weighted by its popularity. Our contibutions in this part are as follows. First, we provide a simple proof for the need of periodicity (equal distance in transmission) of popular objects in a cycle. Second, in contrast to existing results, we consider the scheduling problem for caching clients. To increase the performance of the system, we also evaluate a pre-emptive scheduling algorithm that allows interruption (pre-emption) of an object's transmission in order to transmit on schedule another more popular one.

AB - In this chapter, we address how to achieve scalable content distributions. We present two contributions, each of which uses a different approach to distribute the content. In the first part of this chapter, we consider a terrestrial overlay network and build on top of it a VoD service for fixed clients. The goal is to minimize the operational cost of the service. Our contibutions are as follows. First, we introduce a new video distribution architecture that combines open-loop and closed-loop schemes. This combination makes the overall system highly scalable, very cost-effective, and ensures a zero start-up delay. Our second contribution is a mathematical model for the cost of delivering a video as a function of the popularity of that video. Our analytical model, along with some extensions, allows us to explore several scenarios: (i) long videos of 90 min (movies), (ii) short videos of a few min (clips), (iii) the dimensioning of a video on demand service from scratch, and (iv) the case of the optimization of an already installed video on demand service (i.e. the limited resources scenario). In the second part of this chapter, we consider a satellite distribution of contents to mobile users, or in general to users thar are occasionally connected. We consider a push-based model, where the server periodically downloads objects. We assume that clients register to the service off-line. Our goal is to minimize the mean aggregate reception delay over all objects where each object is weighted by its popularity. Our contibutions in this part are as follows. First, we provide a simple proof for the need of periodicity (equal distance in transmission) of popular objects in a cycle. Second, in contrast to existing results, we consider the scheduling problem for caching clients. To increase the performance of the system, we also evaluate a pre-emptive scheduling algorithm that allows interruption (pre-emption) of an object's transmission in order to transmit on schedule another more popular one.

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

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

M3 - Article

AN - SCOPUS:35248873060

VL - 2856

SP - 207

EP - 262

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -