Distributed Video Streaming over DHT P2P Overlays

Leung, K.H.W.; Lee, Ivan

doi:10.1109/cnmt.2009.5374564

Cited by 2 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…29 Unpredictable leave of nodes from the system has been a main concern in realizing resilient P2P video streaming systems, and to overcome this issue, many researchers have analyzed the behavior of users in existing distributed environments. 11,24,25 The exploration of overlays for resilient P2P video streaming has also been conducted by many researchers; e.g., Leung et al 15 and Shen et al 27 applied Distributed Hash Table (DHT) to realize highly resilient, low latency P2P video streaming, and several researchers proposed techniques to improve the resilience of mesh-structured P2P video streaming. 12,23,32 Unfortunately however, to the author's best knowledge, no previous work studied the improvement of the resilience of tree-structured P2P video streaming systems against temporal performance degradation.…”

Section: Related Workmentioning

confidence: 99%

Resilient Tree-Based Video Streaming with a Guaranteed Latency

Fujita

2019

J. Inter. Net.

View full text Add to dashboard Cite

In this paper, we propose a method to organize a tree-based Peer-to-Peer (P2P) overlay for video streaming which is resilient to the temporal reduction of the upload capacity of a node. The basic idea of the proposed method is: (1) to introduce the redundancy to a given tree-structured overlay, in such a way that a part of the upload capacity of each node is proactively used for connecting to a sibling node, and (2) to use those links connecting to the siblings to forward video stream to the siblings. More specifically, we prove that even if the maximum number of children of a node temporally reduces from m to m − k for some 1 ≤ k ≤ m − 1, the proposed method continues the forwarding of video stream to all of m children in at most 2x hops, where x is the smallest integer satisfying m − k ≥ m/2x. We also derive a sufficient condition to bound the increase of the latency by an additive constant. The derived sufficient condition indicates that if each node can have at least six children in the overlay, the proposed method increases the latency by at most one, provided that the number of nodes in the overlay is at most 9331; namely the proposed method guarantees the delivery of video stream with a nearly optimal latency.

show abstract