Layered peer-to-peer streaming

This paper presents the design and evaluation of an adaptive streaming mechanism from multiple senders to a single receiver in Peer-to-Peer (P2P) networks, called P2P Adaptive Layered Streaming, or PALS. PALS is a receiverdriven mechanism. It enables a receiver peer to orchestrate quality adaptive streaming of a single, layer-encoded video stream from multiple congestion-controlled senders, and is able to support a spectrum of noninteractive streaming applications. The primary challenge in the design of a streaming mechanism from multiple senders is that available bandwidth from individual peers is not known a priori, and could significantly change during delivery. In PALS, the receiver periodically performs quality adaptation based on the aggregate bandwidth from all senders to determine: (i) the overall quality (i.e., number of layers) that can be collectively delivered by all senders, and more importantly (ii) the specific subset of packets that should be delivered by individual senders in order to gracefully cope with any sudden change in their bandwidth. Our detailed simulation-based evaluations illustrate that PALS can effectively cope with several angles of dynamics in the system including: bandwidth variations, peer participation, and partially available content at different peers. We also demonstrate the importance of coordination among senders and examine key design tradeoffs for the PALS mechanism.

Section: Importance Of Coordinationmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Adaptive receiver-driven streaming from multiple senders

Magharei

Rejaie

2006

“…However, other QoS parameters, such as latency, loss, and path diversity, were not considered. Cui [21,22] exploited the buffer capacity at peer nodes to reduce the load on streaming servers when user requests are asynchronous and peer bandwidths are heterogeneous. In PALS [23,24], receivers adaptively decided on the number of media layers and used a packet assignment algorithm to allocate the subset of packets in each layer to different senders.…”

Section: Related Workmentioning

confidence: 99%

Sequence of linear programming for transmission of fine-scalable coded content in bandwidth-limited environments

Wang

2006

In this paper, we propose an optimal peer assignment algorithm on peer-to-peer networks. This algorithm is designed to maximize the quality of transmitting finescalable coded content by exploiting the embedding property of scalable coding. To be more realistic, we assume that the requesting peer has a delay constraint to display the content within a certain delay bound, and it also has limited incoming bandwidth. We first use a simple example to illustrate the peer assignment problem, and then formulate this problem as a linear programming problem, followed by a nonlinear programming problem. To efficiently solve the second nonlinear problem, we transform it into a sequence of linear programming problems. Finally, we apply our proposed algorithm to both image and video transmissions in bandwidth-limited environments. Extensive experiments have been carried out to evaluate the complexity and performance of our approach by comparing it with both nonlinear formulation and two heuristic schemes. The results have verified the superior performance of our proposed algorithm.

“…Cui [10,11] exploited the buffer capacity at peer nodes to reduce the load on streaming servers when the user requests are asynchronous and the peers' bandwidths are heterogeneous.…”

Section: Related Workmentioning

confidence: 99%

Optimizing transmission time of scalable coded images in peer-to-peer networks

Fatoohi

Wang

2005

In this paper, we study how to optimize image transmission time in peer-to-peer networks by considering the property of bitstreams generated by image coding algorithms. Images can be either scalable coded or nonscalable coded. Since transmission of nonscalable coded images is well understood, we focus on the transmission of scalable coded images in this paper.Because scalable coding embeds lower bit-rate bitstreams into higher bit-rate bitstreams, there exists a many-to-one relationship between supplying and requesting peers. When a requesting peer asks for an image coded in a particular bit rate, multiple peers with the same image but coded in different bit rates can supply to the requesting peer. This enables us to assign the task of image transmission to multiple supplying peers, split the traffic among these peers, and then reduce overall transmission time. Therefore, when we transmit scalable coded images over peer-to-peer networks, it is important to design optimal peer assignment algorithms to minimize the overall transmission time for the requesting peer.In this paper, we first formally define the peer assignment problem and then establish a sufficient condition on the optimality of peer assignment. Based on this condition, we propose an optimal peer assignment algorithm in continuous space (OPA-CS) and then derive a suboptimal peer assignment algorithm in integer space (SOPA-IS). Finally, we carry out extensive experiments to verify the superior performance of the proposed peer assignment algorithms by comparing with two simple heuristic schemes.