Sequence-Based Data Dissemination Algorithms for Peer-to-Peer Multicast Protocols

Data dissemination in the existing peer-to-peer multicast protocols is performed from source node by delivering data to destination nodes over either a tree or a partial-mesh path structure covering all the multicast nodes. In this paper, we show that the existing tree-based or partial-mesh-based data dissemination algorithms do not perform efficiently in traditional customer-provider networks. We propose a new class of data dissemination algorithms called SBDD that considers a full-mesh path structure between multicast nodes. We show that SBDD improves multicast throughput, latency, fairness, and node dependency over the tree-based or partial-mesh-based algorithms in traditional customer-provider networks. Furthermore, it can also be used in heterogeouse multicast environments with a low computational complexity and a low overhead in comparison with the existing algorithms for such environments.