Level-Based Peer-to-Peer Live Streaming with Rateless Codes

Abstract

Abstract-We propose a peer-to-peer system for streaming user-generated live video. Peers are arranged in levels so that video is delivered at about the same time to all peers in the same level, and peers in a higher level watch the video before those in a lower level. We encode the video bitstream with rateless codes and use trees to transmit the encoded symbols. Trees are constructed to minimize the transmission rate for the source while maximizing the number of served peers and guaranteeing on-time delivery and reliability at the peers. We formulate this objective as a height bounded spanning forest problem with nodal capacity constraint and compute a solution using a heuristic polynomialtime algorithm. We conduct ns-2 simulations to study the tradeoff between used bandwidth and video quality for various packet loss rates and link latencies.

Peer-to-peer live video streaming with rateless codes for massively multiplayer online games

“…A demo of the proposed system was presented at the 2012 IEEE International Conference on Peer-to-Peer Computing [16]. A simplified version of the system that targets static scenarios in which all peers join before the start of the video session and remain subscribed until the end of the session was described in a conference paper [17]. Simulations showed that the system can sustain high performance as long as the number of peers that leave the system is moderate.…”

“…-Replacing leaves in other trees after inserting them into the peer's trees: If the peer still has not been spanned in K trees, we use Algorithm 3 to insert leaves with maximum spare capacity into the peer's trees with smallest size. These leaves are taken from trees with maximum size that do not contain the peer (lines [13][14][15][16][17][18][19][20]. The leaves are then replaced by the peer (line 21).…”