A hybrid architecture for cost-effective on-demand media streaming

Mohamed M. Hefeeda, Bharat K. Bhargav, David K Y Yau

Research output: Contribution to journalArticle

74 Citations (Scopus)

Abstract

We propose a new architecture for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The key idea of the architecture is that peers share some of their resources with the system. As peers contribute resources to the system, the overall system capacity increases and more clients can be served. The proposed architecture employs several novel techniques to: (1) use the often-underutilized peers' resources, which makes the proposed architecture both deployable and cost-effective, (2) aggregate contributions from multiple peers to serve a requesting peer so that supplying peers are not overloaded, (3) make a good use of peer heterogeneity by assigning relatively more work to the powerful peers, and (4) organize peers in a network-aware fashion, such that nearby peers are grouped into a logical entity called a cluster. The network-aware peer organization is validated by statistics collected and analyzed from real Internet data. The main benefit of the network-aware peer organization is that it allows to develop efficient searching (to locate nearby suppliers) and dispersion (to disseminate new files into the system) algorithms. We present network-aware searching and dispersion algorithms that result in: (i) fast dissemination of new media files, (ii) reduction of the load on the underlying network, and (iii) better streaming service. We demonstrate the potential of the proposed architecture for a large-scale on-demand media streaming service through an extensive simulation study on large, Internet-like, topologies. Starting with a limited streaming capacity (hence, low cost), the simulation shows that the capacity rapidly increases and many clients can be served. This occurs for all studied arrival patterns, including constant rate arrivals, flash crowd arrivals, and Poisson arrivals. Furthermore, the simulation shows that a reasonable client-side initial buffering of 10-20 s is sufficient to ensure full quality playback even in the presence of peer failures.

Original languageEnglish
Pages (from-to)353-382
Number of pages30
JournalComputer Networks
Volume44
Issue number3
DOIs
Publication statusPublished - 20 Feb 2004
Externally publishedYes

Fingerprint

Media streaming
Internet
Costs
Topology
Statistics

Keywords

  • Dispersion algorithms
  • Media streaming
  • Multimedia systems
  • Peer clustering
  • Peer-to-peer systems

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

A hybrid architecture for cost-effective on-demand media streaming. / Hefeeda, Mohamed M.; Bhargav, Bharat K.; Yau, David K Y.

In: Computer Networks, Vol. 44, No. 3, 20.02.2004, p. 353-382.

Research output: Contribution to journalArticle

Hefeeda, Mohamed M. ; Bhargav, Bharat K. ; Yau, David K Y. / A hybrid architecture for cost-effective on-demand media streaming. In: Computer Networks. 2004 ; Vol. 44, No. 3. pp. 353-382.
@article{c45090e91a6243db8b091ea93200323a,
title = "A hybrid architecture for cost-effective on-demand media streaming",
abstract = "We propose a new architecture for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The key idea of the architecture is that peers share some of their resources with the system. As peers contribute resources to the system, the overall system capacity increases and more clients can be served. The proposed architecture employs several novel techniques to: (1) use the often-underutilized peers' resources, which makes the proposed architecture both deployable and cost-effective, (2) aggregate contributions from multiple peers to serve a requesting peer so that supplying peers are not overloaded, (3) make a good use of peer heterogeneity by assigning relatively more work to the powerful peers, and (4) organize peers in a network-aware fashion, such that nearby peers are grouped into a logical entity called a cluster. The network-aware peer organization is validated by statistics collected and analyzed from real Internet data. The main benefit of the network-aware peer organization is that it allows to develop efficient searching (to locate nearby suppliers) and dispersion (to disseminate new files into the system) algorithms. We present network-aware searching and dispersion algorithms that result in: (i) fast dissemination of new media files, (ii) reduction of the load on the underlying network, and (iii) better streaming service. We demonstrate the potential of the proposed architecture for a large-scale on-demand media streaming service through an extensive simulation study on large, Internet-like, topologies. Starting with a limited streaming capacity (hence, low cost), the simulation shows that the capacity rapidly increases and many clients can be served. This occurs for all studied arrival patterns, including constant rate arrivals, flash crowd arrivals, and Poisson arrivals. Furthermore, the simulation shows that a reasonable client-side initial buffering of 10-20 s is sufficient to ensure full quality playback even in the presence of peer failures.",
keywords = "Dispersion algorithms, Media streaming, Multimedia systems, Peer clustering, Peer-to-peer systems",
author = "Hefeeda, {Mohamed M.} and Bhargav, {Bharat K.} and Yau, {David K Y}",
year = "2004",
month = "2",
day = "20",
doi = "10.1016/j.comnet.2003.10.002",
language = "English",
volume = "44",
pages = "353--382",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - A hybrid architecture for cost-effective on-demand media streaming

AU - Hefeeda, Mohamed M.

AU - Bhargav, Bharat K.

AU - Yau, David K Y

PY - 2004/2/20

Y1 - 2004/2/20

N2 - We propose a new architecture for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The key idea of the architecture is that peers share some of their resources with the system. As peers contribute resources to the system, the overall system capacity increases and more clients can be served. The proposed architecture employs several novel techniques to: (1) use the often-underutilized peers' resources, which makes the proposed architecture both deployable and cost-effective, (2) aggregate contributions from multiple peers to serve a requesting peer so that supplying peers are not overloaded, (3) make a good use of peer heterogeneity by assigning relatively more work to the powerful peers, and (4) organize peers in a network-aware fashion, such that nearby peers are grouped into a logical entity called a cluster. The network-aware peer organization is validated by statistics collected and analyzed from real Internet data. The main benefit of the network-aware peer organization is that it allows to develop efficient searching (to locate nearby suppliers) and dispersion (to disseminate new files into the system) algorithms. We present network-aware searching and dispersion algorithms that result in: (i) fast dissemination of new media files, (ii) reduction of the load on the underlying network, and (iii) better streaming service. We demonstrate the potential of the proposed architecture for a large-scale on-demand media streaming service through an extensive simulation study on large, Internet-like, topologies. Starting with a limited streaming capacity (hence, low cost), the simulation shows that the capacity rapidly increases and many clients can be served. This occurs for all studied arrival patterns, including constant rate arrivals, flash crowd arrivals, and Poisson arrivals. Furthermore, the simulation shows that a reasonable client-side initial buffering of 10-20 s is sufficient to ensure full quality playback even in the presence of peer failures.

AB - We propose a new architecture for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The key idea of the architecture is that peers share some of their resources with the system. As peers contribute resources to the system, the overall system capacity increases and more clients can be served. The proposed architecture employs several novel techniques to: (1) use the often-underutilized peers' resources, which makes the proposed architecture both deployable and cost-effective, (2) aggregate contributions from multiple peers to serve a requesting peer so that supplying peers are not overloaded, (3) make a good use of peer heterogeneity by assigning relatively more work to the powerful peers, and (4) organize peers in a network-aware fashion, such that nearby peers are grouped into a logical entity called a cluster. The network-aware peer organization is validated by statistics collected and analyzed from real Internet data. The main benefit of the network-aware peer organization is that it allows to develop efficient searching (to locate nearby suppliers) and dispersion (to disseminate new files into the system) algorithms. We present network-aware searching and dispersion algorithms that result in: (i) fast dissemination of new media files, (ii) reduction of the load on the underlying network, and (iii) better streaming service. We demonstrate the potential of the proposed architecture for a large-scale on-demand media streaming service through an extensive simulation study on large, Internet-like, topologies. Starting with a limited streaming capacity (hence, low cost), the simulation shows that the capacity rapidly increases and many clients can be served. This occurs for all studied arrival patterns, including constant rate arrivals, flash crowd arrivals, and Poisson arrivals. Furthermore, the simulation shows that a reasonable client-side initial buffering of 10-20 s is sufficient to ensure full quality playback even in the presence of peer failures.

KW - Dispersion algorithms

KW - Media streaming

KW - Multimedia systems

KW - Peer clustering

KW - Peer-to-peer systems

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

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

U2 - 10.1016/j.comnet.2003.10.002

DO - 10.1016/j.comnet.2003.10.002

M3 - Article

AN - SCOPUS:0346972395

VL - 44

SP - 353

EP - 382

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 3

ER -