Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Early experience with an internet broadcast system based on overlay multicast
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
On the minimum delay peer-to-peer video streaming: how realtime can it be?
Proceedings of the 15th international conference on Multimedia
Optimal scheduling of peer-to-peer file dissemination
Journal of Scheduling
Epidemic live streaming: optimal performance trade-offs
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Bandwidth-Aware Scheduling Strategy for P2P-TV Systems
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Scheduling in P2P Streaming: From Algorithms to Protocols
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Design and implementation of a generic library for P2P streaming
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
Quantifying operational cost-savings through ALTO-guidance for P2P live streaming
ETM'10 Proceedings of the Third international conference on Incentives, overlays, and economic traffic control
On predictable large-scale data delivery in prefix-based virtualized content networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Video streaming over P2P networks: Challenges and opportunities
Image Communication
Towards efficient video chunk dissemination in peer-to-peer live streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling and performance analysis of pull-based live streaming schemes in Peer-to-Peer network
Computer Communications
Hi-index | 0.00 |
Unstructured, chunk-based P2P streaming (TV and Video) systems are becoming popular and are subject of intense research. Chunk and peer selection strategies (or scheduling) are among the main driver of performance. This work presents the formal proof that there exist a distributed scheduling strategy which is able to distribute every chunk to all N peers in exactly ***log2 (N ) *** + 1 steps. Since this is the minimum number of steps needed to distribute a chunk, the proposed strategy is optimal. Such a strategy is implementable and an entire class of deadline-based schedulers realize it. We show that at least one of the deadline-based schedulers is resilient to the reduction of the neighborhood size down to values as small as log2 (N ). Selected simulation results highlighting the properties of the algorithms in realistic scenarios complete the paper.