The Orchard Algorithm: P2P Multicasting without Free-Riding

Mol, J.J.D.; Epema, Dick; Sips, HJ

doi:10.1109/p2p.2006.45

Cited by 13 publications

(9 citation statements)

References 14 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Solutions to solve the free-riding problem have been proposed for off-line downloading 3 and live streaming. [4][5][6] However, for P2P VoD, no solution yet exists which takes free-riding into consideration. The second contribution of this paper is the design and analysis of the mechanism that makes Give-to-Get free-riding-resilient.…”

Section: Introductionmentioning

confidence: 99%

<title>Give-to-Get: free-riding resilient video-on-demand in P2P systems</title>

et al. 2008

View full text Add to dashboard Cite

Centralised solutions for Video-on-Demand (VoD) services, which stream pre-recorded video content to multiple clients who start watching at the moments of their own choosing, are not scalable because of the high bandwidth requirements of the central video servers. Peer-to-peer (P2P) techniques which let the clients distribute the video content among themselves, can be used to alleviate this problem. However, such techniques may introduce the problem of free-riding, with some peers in the P2P network not forwarding the video content to others if there is no incentive to do so. When the P2P network contains too many free-riders, an increasing number of the well-behaving peers may not achieve high enough download speeds to maintain an acceptable service. In this paper we propose Give-to-Get, a P2P VoD algorithm which discourages free-riding by letting peers favour uploading to other peers who have proven to be good uploaders. As a consequence, free-riders are only tolerated as long as there is spare capacity in the system. Our simulations show that even if 20% of the peers are free-riders, Give-to-Get continues to provide good performance to the well-behaving peers. In particular, they show that Give-to-Get performs very well for short videos, which dominate the current VoD traffic on the Internet.

show abstract

Section: Introductionmentioning

confidence: 99%

<title>Give-to-Get: free-riding resilient video-on-demand in P2P systems</title>

et al. 2008

View full text Add to dashboard Cite

show abstract

“…SplitStream [4] improved this model by using multiple trees, where the stream is split into sub-streams and each tree delivers one sub-stream. Orchard [11], ChunkySpread [19] and CoopNet [12] are some other solutions in this class.…”

Section: Related Workmentioning

confidence: 99%

“…If the similar-view is not full, it adds the node, and if a reference to the node to be merged already exists in p's similar-view, p just refreshes the age of its reference. If the similar-view is full, p replaces one of the nodes it had sent to q with the selected node (lines [8][9][10][11][12][13][14][15][16][17][18][19][20]. What is more, p also merges its similar-view with its own local random-view, in the same way described above.…”

mentioning

confidence: 99%

gradienTv: Market-Based P2P Live Media Streaming on the Gradient Overlay

Payberah

Dowling

Rahimian

et al. 2010

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

Abstract. This paper presents gradienTv, a distributed, market-based approach to live streaming. In gradienTv, multiple streaming trees are constructed using a market-based approach, such that nodes with increasing upload bandwidth are located closer to the media source at the roots of the trees. Market-based approaches, however, exhibit slow convergence properties on random overlay networks, so to facilitate the timely discovery of neighbours with similar upload bandwidth capacities (thus, enabling faster convergence of streaming trees), we use the gossip-generated Gradient overlay network. In the Gradient overlay, nodes are ordered by a gradient of node upload capacities and the media source is the highest point in the gradient. We compare gradienTv with state-of-the-art NewCoolstreaming in simulation, and the results show significantly improved bandwidth utilization, playback latency, playback continuity, and reduction in the average number of hops from the media source to nodes.

show abstract

“…In this approach a single stream (full stream) is divided into several substreams, also referred to as "descriptions" [5]. Each substream is then forwarded separately in the network.…”

Section: Multiple Stream Approachmentioning

confidence: 99%

Peer-to-Peer Streaming Technology Survey

Peltotalo

Harju

Jantunen

et al. 2008

Seventh International Conference on Networking (Icn 2008)

View full text Add to dashboard Cite

Lately there has been a growing interest in the use of peer-to-peer technologies for deploying large-scale live media streaming systems over the Internet. In this paper we give a brief survey on the peer-to-peer streaming field and have also a closer look on selected applications. In practice, we analyse the selected peer-to-peer streaming systems (Octoshape, SopCast, TVAnts and TVU networks) and see if they are suitable for mobile usage. This paper also shows results from an experimental test carried out by using selected applications with a PC over different network connections (EDGE, UMTS, HSDPA, ADSL and LAN). None of the selected applications are designed to be used in a mobile environment, so there is still a lot of work to do to have optimized systems in the mobile network environment.

show abstract

The Orchard Algorithm: P2P Multicasting without Free-Riding

Cited by 13 publications

References 14 publications

<title>Give-to-Get: free-riding resilient video-on-demand in P2P systems</title>

<title>Give-to-Get: free-riding resilient video-on-demand in P2P systems</title>

gradienTv: Market-Based P2P Live Media Streaming on the Gradient Overlay

Peer-to-Peer Streaming Technology Survey

Contact Info

Product

Resources

About