A chunk scheduling based on chunk diffusion ratio on P2P live streaming

Yoshiki Sakata, Kazuyuki Takayama, Rei Endo, Hiroshi Shigeno

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Many Internet users use P2P live streaming services which deliver live video contents to many users. In the services, the video content is sliced into small pieces called chunks. The peers not only receive but also send the chunks to watch the video contents. Source's load for delivering is reduced. In an Offer Select method, each peer offers sendable chunks to it's neighbors. The neighbors select receiving chunks from the sendable chunks. However, some chunk diffusions are low. Each peer sends chunk independently. It happens that peers offer same chunks to a neighbor. In this paper, we propose a chunk schedule method. Each peer receives chunks which the nearby peers hardly possess. Our method reduces dispersion of chunk diffusion. Simulation results show that peers receive more chunks, which enables peers to watch higher quality.

Original languageEnglish
Title of host publicationProceedings of the 2012 15th International Conference on Network-Based Information Systems, NBIS 2012
Pages74-81
Number of pages8
DOIs
Publication statusPublished - 2012
Event2012 15th International Conference on Network-Based Information Systems, NBIS 2012 - Melbourne, VIC, Australia
Duration: 2012 Sep 262012 Sep 28

Other

Other2012 15th International Conference on Network-Based Information Systems, NBIS 2012
CountryAustralia
CityMelbourne, VIC
Period12/9/2612/9/28

Fingerprint

Scheduling
Internet

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Sakata, Y., Takayama, K., Endo, R., & Shigeno, H. (2012). A chunk scheduling based on chunk diffusion ratio on P2P live streaming. In Proceedings of the 2012 15th International Conference on Network-Based Information Systems, NBIS 2012 (pp. 74-81). [6354810] https://doi.org/10.1109/NBiS.2012.71

A chunk scheduling based on chunk diffusion ratio on P2P live streaming. / Sakata, Yoshiki; Takayama, Kazuyuki; Endo, Rei; Shigeno, Hiroshi.

Proceedings of the 2012 15th International Conference on Network-Based Information Systems, NBIS 2012. 2012. p. 74-81 6354810.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sakata, Y, Takayama, K, Endo, R & Shigeno, H 2012, A chunk scheduling based on chunk diffusion ratio on P2P live streaming. in Proceedings of the 2012 15th International Conference on Network-Based Information Systems, NBIS 2012., 6354810, pp. 74-81, 2012 15th International Conference on Network-Based Information Systems, NBIS 2012, Melbourne, VIC, Australia, 12/9/26. https://doi.org/10.1109/NBiS.2012.71
Sakata Y, Takayama K, Endo R, Shigeno H. A chunk scheduling based on chunk diffusion ratio on P2P live streaming. In Proceedings of the 2012 15th International Conference on Network-Based Information Systems, NBIS 2012. 2012. p. 74-81. 6354810 https://doi.org/10.1109/NBiS.2012.71
Sakata, Yoshiki ; Takayama, Kazuyuki ; Endo, Rei ; Shigeno, Hiroshi. / A chunk scheduling based on chunk diffusion ratio on P2P live streaming. Proceedings of the 2012 15th International Conference on Network-Based Information Systems, NBIS 2012. 2012. pp. 74-81
@inproceedings{32c86d6a38c14461a6ac93c1c060c22a,
title = "A chunk scheduling based on chunk diffusion ratio on P2P live streaming",
abstract = "Many Internet users use P2P live streaming services which deliver live video contents to many users. In the services, the video content is sliced into small pieces called chunks. The peers not only receive but also send the chunks to watch the video contents. Source's load for delivering is reduced. In an Offer Select method, each peer offers sendable chunks to it's neighbors. The neighbors select receiving chunks from the sendable chunks. However, some chunk diffusions are low. Each peer sends chunk independently. It happens that peers offer same chunks to a neighbor. In this paper, we propose a chunk schedule method. Each peer receives chunks which the nearby peers hardly possess. Our method reduces dispersion of chunk diffusion. Simulation results show that peers receive more chunks, which enables peers to watch higher quality.",
author = "Yoshiki Sakata and Kazuyuki Takayama and Rei Endo and Hiroshi Shigeno",
year = "2012",
doi = "10.1109/NBiS.2012.71",
language = "English",
isbn = "9780769547794",
pages = "74--81",
booktitle = "Proceedings of the 2012 15th International Conference on Network-Based Information Systems, NBIS 2012",

}

TY - GEN

T1 - A chunk scheduling based on chunk diffusion ratio on P2P live streaming

AU - Sakata, Yoshiki

AU - Takayama, Kazuyuki

AU - Endo, Rei

AU - Shigeno, Hiroshi

PY - 2012

Y1 - 2012

N2 - Many Internet users use P2P live streaming services which deliver live video contents to many users. In the services, the video content is sliced into small pieces called chunks. The peers not only receive but also send the chunks to watch the video contents. Source's load for delivering is reduced. In an Offer Select method, each peer offers sendable chunks to it's neighbors. The neighbors select receiving chunks from the sendable chunks. However, some chunk diffusions are low. Each peer sends chunk independently. It happens that peers offer same chunks to a neighbor. In this paper, we propose a chunk schedule method. Each peer receives chunks which the nearby peers hardly possess. Our method reduces dispersion of chunk diffusion. Simulation results show that peers receive more chunks, which enables peers to watch higher quality.

AB - Many Internet users use P2P live streaming services which deliver live video contents to many users. In the services, the video content is sliced into small pieces called chunks. The peers not only receive but also send the chunks to watch the video contents. Source's load for delivering is reduced. In an Offer Select method, each peer offers sendable chunks to it's neighbors. The neighbors select receiving chunks from the sendable chunks. However, some chunk diffusions are low. Each peer sends chunk independently. It happens that peers offer same chunks to a neighbor. In this paper, we propose a chunk schedule method. Each peer receives chunks which the nearby peers hardly possess. Our method reduces dispersion of chunk diffusion. Simulation results show that peers receive more chunks, which enables peers to watch higher quality.

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

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

U2 - 10.1109/NBiS.2012.71

DO - 10.1109/NBiS.2012.71

M3 - Conference contribution

AN - SCOPUS:84870836468

SN - 9780769547794

SP - 74

EP - 81

BT - Proceedings of the 2012 15th International Conference on Network-Based Information Systems, NBIS 2012

ER -