Abstract
In meshed-based peer-to-peer streaming systems peers forward packets to their neighbors based on local scheduling decisions. The local decisions affect how packets get distributed in the mesh, the probability of duplicates and the distribution of the transmission delays. In this paper we propose an analytic framework that allows the evaluation of various scheduling algorithms. We consider two solutions where scheduling is performed at the forwarding peer, based on the knowledge of the playout buffer content at the neighbors. We evaluate the effectiveness of the solutions in terms of the probability that a peer can play out a packet versus the playback delay, and the scalability of the solutions with respect to the size of the overlay.
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.
