Towards reliable and efficient data dissemination in heterogeneous peer-to-peer systems

More and more emerging P2P applications require support for multi-source data dissemination. However, existing schemes on data dissemination are either only suitable for single source systems or inefficient in terms of delivery delay or message redundancy. This paper presents REM, a reliable and efficient multi-source data dissemination scheme. REM organizes member nodes in a ring-based structure which is reliable, locality-aware and heterogeneity-aware. An undirected delivery tree is built on top of the overlay and used by all nodes. Data messages are first flooded on the overlay and then delivered on the tree. Thus, REM combines the advantages of flooding-based scheme and tree-based scheme. We analyze the reliability, average hop complexity and redundancy rate theoretically anti evaluate the performance by simulations. Specially, in large scale systems, compared with a randomized scheme, REM reduces the average delivery delay by about 25% while the redundancy rate is reduced from about 16% to 1%.