Date Added: Apr 2010
Two questions on the theory of content distribution capacity are addressed in this paper: What is the worst user delay performance bound in a chunk-based P2P streaming systems under peer fan-out degree constraint? Can we achieve both the minimum delay and the maximum streaming rate simultaneously? In the homogeneous user scenario, the authors propose a tree-based algorithm called Inverse Water-filling, which schedules the chunk transmission following an optimal transmitting structure, under fan-out degree bound. They show that the algorithm guarantees the delay bound for each chunk of the stream and maintains the maximum streaming rate at the same time.