AG Technische Informatik

Broadcasting in Prefix Space: P2P Data Dissemination with Predictable Performance

Matthias Wählisch, Georg Wittenburg, Thomas C. Schmidt— 2009

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 VPNtype 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.

TitelBroadcasting in Prefix Space: P2P Data Dissemination with Predictable Performance
VerfasserMatthias Wählisch, Georg Wittenburg, Thomas C. Schmidt
VerlagProceedings of the Fourth International Conference on Internet and Web Applications and Services (ICIW'09), (Mark Perry, Hideyasu Sasaki, Matthias Ehmann, Guadalupe Oritz Bellot, Oana Dini Ed.), pp. 74--83, Los Alamitos, CA, USA: IEEE Computer Societ
ThemaPeer-to-Peer Networking
Datum200905
Quelle/n
Spracheeng
ArtText
BibTeX Code@inproceedings{wsw-bpspd-09, author = {Matthias W{\"a}hlisch and Thomas C. Schmidt and Georg Wittenburg}, title = {{Broadcasting in Prefix Space: P2P Data Dissemination with Predictable Performance}}, booktitle = {Proceedings of the Fourth International Conference on Internet and Web Applications and Services (ICIW'09)}, year = {2009}, editor = {Mark Perry and Hideyasu Sasaki and Matthias Ehmann and Guadalupe Oritz Bellot and Oana Dini}, pages = {74--83}, address = {Los Alamitos, CA, USA}, month = {May}, publisher = {IEEE Computer Society Press}, abstract = {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 VPNtype 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.}, file = {../papers/wsw-bpspd-09.pdf}, theme = {p2p} }