Efficient P2P data dissemination in a homogeneous capacity network using structured mesh

Efficient data dissemination from a single source node to multiple receiving nodes on the Internet is crucial for many applications such as P2P streaming. Existing data dissemination schemes are typically accomplished using the overlay multicast trees. These overlay multicast trees, however, do not achieve the full bandwidth capacity since the leaf nodes do not contribute their bandwidth to the system. On the other hand, all the nodes in a properly constructed topology can contribute their bandwidth, resulting in high overall system throughput. In this paper, we define the notion of throughput efficiency to measure the performance of different data dissemination schemes from a single source node to multiple destination nodes. Using the proposed throughput efficiency, we propose an algorithm for constructing an overlay structured forest that enables high-bandwidth data dissemination in a network with roughly homogeneous capacity. The proposed structured forest and the associated data dissemination algorithm are designed to achieve the following: (1) end-to-end delay from the source node to any node is small (O((logN) ²)), (2) the out-degree of any node is small (O(C)), and (3) bandwidth usages of all the nodes are optimal.