Date Added: Mar 2010
Two of the fundamental problems in Peer-To-Peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algorithms can achieve close to this maximum? These problems of computing and approaching the P2P streaming capacity are often challenging because of the constraints imposed on overlay topology. In this paper, the authors focus on the limit of P2P streaming rate under node degree bound, i.e., the number of connections a node can maintain is upper bounded.?