The Orchard Algorithm: Building Multicast Trees for P2P Video Multicasting Without Free-Riding

Authors:
J. D. Mol;D. H.P. Epema;H. J. Sips
Affiliations:
Delft Univ. of Technol., Delft;-;-
Venue:
IEEE Transactions on Multimedia
Year:
2007

Citing 0
Cited 7

LayerP2P: using layered video chunks in P2P live streaming

IEEE Transactions on Multimedia
Partial forwarding vs. partial participation for dynamic window resizing in P2P streaming

Computer Networks: The International Journal of Computer and Telecommunications Networking
Multiple description coded video streaming in peer-to-peer networks

Image Communication
GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications

International Journal of Communication Systems
Context-aware resource management for secure end-to-end QoS provision in service oriented applications

Journal of Ambient Intelligence and Smart Environments
Context-aware resource management for secure end-to-end QoS provision in service oriented applications

Journal of Ambient Intelligence and Smart Environments
The state of peer-to-peer network simulators

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing. However, a potentially very promising use of such networks is to share video streams (e.g., TV programs) in real time. In order to do so, the peers in a P2P network who are interested in the same video stream may employ Application Level Multicasting (ALM). In existing P2P networks, peers may exhibit behavior which is problematic for ALM: they are not always willing to donate resources (free-riding), and they may arrive and depart at a high rate (churn). In this paper we propose the Orchard algorithm for creating and maintaining ALM trees in P2P networks, which deals with both these problems. By employing a technique called Multiple Description Coding, we split a video stream into several substreams. Orchard creates a dynamic spanning tree for each of these substreams in such a way that in the resulting forest, no peer has to forward more substreams than it receives. Based on an analysis of the expected performance of Orchard and on experiments in a real system, we find that Orchard is capable of maintaining a multicast forest, even when peers join and leave the forest at a high rate.