May 24, 2009 to May 28, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIW.2009.19
A broadcast mode may augment peer-to-peer overlay networks with an efficient, scalable data replication function, but may also give rise to a virtual link layer in VPN-type solutions. We introduce a generic, simple broadcasting mechanism that operates in the prefix space of distributed hash tables without signaling. This paper concentrates on the performance analysis of the prefix flooding scheme. Starting from simple models of recursive $k$-ary trees, we analytically derive distributions of hop counts and the replication load. Further on, extensive simulation results are presented based on an implementation within the OverSim framework. Comparisons are drawn to Scribe, taken as a general reference model for group communication according to the shared, rendezvous-point-centered distribution paradigm. The prefix flooding scheme thereby confirmed its widely predictable performance and consistently outperformed Scribe in all metrics. Reverse path selection in overlays is identified as a major cause of performance degradation.
Prefix flooding, DHT, random recursive k-ary trees, overlay network simulation, Pastry, Scribe
Matthias Wählisch, Thomas C. Schmidt, Georg Wittenburg, "Broadcasting in Prefix Space: P2P Data Dissemination with Predictable Performance", ICIW, 2009, Internet and Web Applications and Services, International Conference on, Internet and Web Applications and Services, International Conference on 2009, pp. 74-83, doi:10.1109/ICIW.2009.19