IEICE TRANSACTIONS on Information
Open Access
Multi-Tree-Based Peer-to-Peer Video Streaming with a Guaranteed Latency
-
Full Text Views
35
- Cite this
- Free PDF (346.3KB)
Summary :
This paper considers Peer-to-Peer (P2P) video streaming systems, in which a given video stream is divided into b stripes and those stripes are delivered to n peers through b spanning trees under the constraint such that each peer including the source can forward at most b stripes. The delivery of a stripe to n peers is said to be a k-hop delivery if all peers receive the stripe through a path of length at most k. Let Bk=∑i=0k-1bi. It is known that under the above constraint, k-hop delivery of b stripes to n peers is possible only if n≤Bk. This paper proves that (k+1)-hop delivery of b stripes to n peers is possible for any n≤Bk; namely, we can realize the delivery of stripes with a guaranteed latency while it is slightly larger than the minimum latency. In addition, we derive a necessary and sufficient condition on n to enable a k-hop delivery of b stripes for Bk-b+2≤n≤Bk-1; namely for n's close to Bk.
- Publication
- IEICE TRANSACTIONS on Information Vol.E102-D No.9 pp.1707-1714
- Publication Date
- 2019/09/01
- Publicized
- 2019/06/10
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2018EDP7408
- Type of Manuscript
- PAPER
- Category
- Fundamentals of Information Systems
Authors
Satoshi FUJITA
Hiroshima University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Satoshi FUJITA, "Multi-Tree-Based Peer-to-Peer Video Streaming with a Guaranteed Latency" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 9, pp. 1707-1714, September 2019, doi: 10.1587/transinf.2018EDP7408.
Abstract: This paper considers Peer-to-Peer (P2P) video streaming systems, in which a given video stream is divided into b stripes and those stripes are delivered to n peers through b spanning trees under the constraint such that each peer including the source can forward at most b stripes. The delivery of a stripe to n peers is said to be a k-hop delivery if all peers receive the stripe through a path of length at most k. Let Bk=∑i=0k-1bi. It is known that under the above constraint, k-hop delivery of b stripes to n peers is possible only if n≤Bk. This paper proves that (k+1)-hop delivery of b stripes to n peers is possible for any n≤Bk; namely, we can realize the delivery of stripes with a guaranteed latency while it is slightly larger than the minimum latency. In addition, we derive a necessary and sufficient condition on n to enable a k-hop delivery of b stripes for Bk-b+2≤n≤Bk-1; namely for n's close to Bk.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2018EDP7408/_p
Copy
@ARTICLE{e102-d_9_1707,
author={Satoshi FUJITA, },
journal={IEICE TRANSACTIONS on Information},
title={Multi-Tree-Based Peer-to-Peer Video Streaming with a Guaranteed Latency},
year={2019},
volume={E102-D},
number={9},
pages={1707-1714},
abstract={This paper considers Peer-to-Peer (P2P) video streaming systems, in which a given video stream is divided into b stripes and those stripes are delivered to n peers through b spanning trees under the constraint such that each peer including the source can forward at most b stripes. The delivery of a stripe to n peers is said to be a k-hop delivery if all peers receive the stripe through a path of length at most k. Let Bk=∑i=0k-1bi. It is known that under the above constraint, k-hop delivery of b stripes to n peers is possible only if n≤Bk. This paper proves that (k+1)-hop delivery of b stripes to n peers is possible for any n≤Bk; namely, we can realize the delivery of stripes with a guaranteed latency while it is slightly larger than the minimum latency. In addition, we derive a necessary and sufficient condition on n to enable a k-hop delivery of b stripes for Bk-b+2≤n≤Bk-1; namely for n's close to Bk.},
keywords={},
doi={10.1587/transinf.2018EDP7408},
ISSN={1745-1361},
month={September},}
Copy
TY - JOUR
TI - Multi-Tree-Based Peer-to-Peer Video Streaming with a Guaranteed Latency
T2 - IEICE TRANSACTIONS on Information
SP - 1707
EP - 1714
AU - Satoshi FUJITA
PY - 2019
DO - 10.1587/transinf.2018EDP7408
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2019
AB - This paper considers Peer-to-Peer (P2P) video streaming systems, in which a given video stream is divided into b stripes and those stripes are delivered to n peers through b spanning trees under the constraint such that each peer including the source can forward at most b stripes. The delivery of a stripe to n peers is said to be a k-hop delivery if all peers receive the stripe through a path of length at most k. Let Bk=∑i=0k-1bi. It is known that under the above constraint, k-hop delivery of b stripes to n peers is possible only if n≤Bk. This paper proves that (k+1)-hop delivery of b stripes to n peers is possible for any n≤Bk; namely, we can realize the delivery of stripes with a guaranteed latency while it is slightly larger than the minimum latency. In addition, we derive a necessary and sufficient condition on n to enable a k-hop delivery of b stripes for Bk-b+2≤n≤Bk-1; namely for n's close to Bk.
ER -
English
