Maximizing Universal Streaming Rate in Peer-to-Peer Streaming Networks

Although a large number of different proposals have emerged in recent years, a fundamental problem of P2P streaming networks concerned about is to establish an optimal routing structure with achieving certain optimization metric. In this paper, we focus on the problem of maximizing universal streaming rate in P2P streaming networks with constrained neighborhood. Firstly, we extend the fluid-based model and propose a new P2P streaming network model taking the neighborhood constraint into account. Second, we formulate the problem of maximizing the universal streaming rate in the new model. After proving its NP-hardness, we propose a heuristic multiple trees packing algorithm and corresponding optimum strategies. The simulation results show that the algorithm can achieve the theoretical upper bound of the universal streaming rate in fluid-based model without constrained neighborhood. While neighborhood constraint is considered, in addition, the universal streaming rate will have different decline according to various intensity of neighborhood constraint.