Abstract
Peer-to-peer (P2P) systems are becoming a popular means of streaming audio and video content but they are prone to bandwidth starvation if selfish peers do not contribute bandwidth to other peers. We prove that an incentive mechanism can be created for a live streaming P2P protocol while preserving the asymptotic properties of randomized gossip-based streaming. In order to show the utility of our result, we adapt a distributed incentive scheme from P2P file storage literature to the live streaming scenario. We provide simulation results that confirm the ability to achieve a constant download rate (in time, per peer) that is needed for streaming applications on peers. The incentive scheme fairly differentiates peers' download rates according to the amount of useful bandwidth they contribute back to the P2P system, thus creating a powerful quality-of-service incentive for peers to contribute bandwidth to other peers. We propose a functional architecture and protocol format for a gossip-based streaming system with incentive mechanisms, and present evaluation data from a real implementation of a P2P streaming application.
Highlights
Peer-to-peer (P2P) applications are widely used to distribute media files over the Internet and are sometimes referred to as “file-sharing” applications
All P2P content delivery systems work on the premise that the peers will share their resources in order to increase the total service capacity of the P2P system
The component listener listens on a specific port and receives transport layer packets from the media streaming application running on another peer: the payload of the packets being in a serialized suitable for transmission across the network, the listener passes the incoming packet’s payload to a translator
Summary
Peer-to-peer (P2P) applications are widely used to distribute media files over the Internet and are sometimes referred to as “file-sharing” applications. We provide a generic achievability argument for creating incentives to cooperate in gossip-based live P2P streaming We do this by proving that after coupling a randomized optimistic unchoke component with an incentive mechanism, we can (still) distribute a stream block from the source to n peers in O(log n) time with high probability. This result is very significant because tree-based P2P streaming protocols have logarithmic distribution times (because of the O(log n) tree height). The Cool-stream technology [? ] is a real-world implementation of such a gossip-based TV quality video stream delivery system
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
