Scheduling in P2P Streaming: From Algorithms to Protocols

摘要

Chunk and peer scheduling is among the main driver of performance in P2P streaming systems. While previous work has analytically proved that optimal scheduling algorithms exist, such strategies are based on a large number of strong assumptions about the knowledge that a single peer has of the rest of the system. This short paper presents a protocol for turning these theoretical results into practical ones, by taking into account practical aspects like the diffusion time of signaling messages and a partial knowledge of the participating peers.