The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Exibições de texto completo
79
Em sistemas convencionais de streaming de vídeo, vários tipos de fluxos de vídeo são entregues a partir de um servidor dedicado (por exemplo, servidor de borda) para os assinantes, de modo que um fluxo de vídeo de nível de qualidade superior seja codificado com uma taxa de bits mais alta. Neste artigo, consideramos o problema de entregar esses fluxos de vídeo com o auxílio da tecnologia Peer-to-Peer (P2P) com o menor custo de servidor possível, mantendo o desempenho do streaming de vídeo em termos de taxa de transferência e latência. A idéia básica do método proposto é dividir um determinado fluxo de vídeo em vários subfluxos chamados de faixas o mais uniformemente possível e entregar essas faixas aos assinantes por meio de diferentes sobreposições estruturadas em árvore. Essa abordagem baseada em faixas poderia calcular a média da carga dos pares e resolver efetivamente a sobrecarga da sobreposição para fluxos de vídeo de alta qualidade. O desempenho do método proposto é avaliado numericamente. O resultado das avaliações indica que o método proposto reduz significativamente o custo do servidor necessário para garantir saltos de entrega designados, em comparação com um esquema ingênuo baseado em árvore.
Satoshi FUJITA
Hiroshima University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Satoshi FUJITA, "Peer-to-Peer Video Streaming of Non-Uniform Bitrate with Guaranteed Delivery Hops" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 11, pp. 2176-2183, November 2019, doi: 10.1587/transinf.2019EDP7088.
Abstract: In conventional video streaming systems, various kind of video streams are delivered from a dedicated server (e.g., edge server) to the subscribers so that a video stream of higher quality level is encoded with a higher bitrate. In this paper, we consider the problem of delivering those video streams with the assistance of Peer-to-Peer (P2P) technology with as small server cost as possible while keeping the performance of video streaming in terms of the throughput and the latency. The basic idea of the proposed method is to divide a given video stream into several sub-streams called stripes as evenly as possible and to deliver those stripes to the subscribers through different tree-structured overlays. Such a stripe-based approach could average the load of peers, and could effectively resolve the overloading of the overlay for high quality video streams. The performance of the proposed method is evaluated numerically. The result of evaluations indicates that the proposed method significantly reduces the server cost necessary to guarantee a designated delivery hops, compared with a naive tree-based scheme.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019EDP7088/_p
Copiar
@ARTICLE{e102-d_11_2176,
author={Satoshi FUJITA, },
journal={IEICE TRANSACTIONS on Information},
title={Peer-to-Peer Video Streaming of Non-Uniform Bitrate with Guaranteed Delivery Hops},
year={2019},
volume={E102-D},
number={11},
pages={2176-2183},
abstract={In conventional video streaming systems, various kind of video streams are delivered from a dedicated server (e.g., edge server) to the subscribers so that a video stream of higher quality level is encoded with a higher bitrate. In this paper, we consider the problem of delivering those video streams with the assistance of Peer-to-Peer (P2P) technology with as small server cost as possible while keeping the performance of video streaming in terms of the throughput and the latency. The basic idea of the proposed method is to divide a given video stream into several sub-streams called stripes as evenly as possible and to deliver those stripes to the subscribers through different tree-structured overlays. Such a stripe-based approach could average the load of peers, and could effectively resolve the overloading of the overlay for high quality video streams. The performance of the proposed method is evaluated numerically. The result of evaluations indicates that the proposed method significantly reduces the server cost necessary to guarantee a designated delivery hops, compared with a naive tree-based scheme.},
keywords={},
doi={10.1587/transinf.2019EDP7088},
ISSN={1745-1361},
month={November},}
Copiar
TY - JOUR
TI - Peer-to-Peer Video Streaming of Non-Uniform Bitrate with Guaranteed Delivery Hops
T2 - IEICE TRANSACTIONS on Information
SP - 2176
EP - 2183
AU - Satoshi FUJITA
PY - 2019
DO - 10.1587/transinf.2019EDP7088
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2019
AB - In conventional video streaming systems, various kind of video streams are delivered from a dedicated server (e.g., edge server) to the subscribers so that a video stream of higher quality level is encoded with a higher bitrate. In this paper, we consider the problem of delivering those video streams with the assistance of Peer-to-Peer (P2P) technology with as small server cost as possible while keeping the performance of video streaming in terms of the throughput and the latency. The basic idea of the proposed method is to divide a given video stream into several sub-streams called stripes as evenly as possible and to deliver those stripes to the subscribers through different tree-structured overlays. Such a stripe-based approach could average the load of peers, and could effectively resolve the overloading of the overlay for high quality video streams. The performance of the proposed method is evaluated numerically. The result of evaluations indicates that the proposed method significantly reduces the server cost necessary to guarantee a designated delivery hops, compared with a naive tree-based scheme.
ER -