Time-critical data dissemination in cooperative peer-to-peer systems

Authors:
Chi-Jen Wu;Cheng-Ying Li;Kai-Hsiang Yang;Jan-Ming Ho;Ming-Syan Chen
Affiliations:
National Taiwan University, Taiwan;Institute of Information Science, Academia Sinica, Taiwan;Institute of Information Science, Academia Sinica, Taiwan;Institute of Information Science, Academia Sinica, Taiwan;National Taiwan University, Taiwan
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 7
Cited 0

An empirical evaluation of wide-area internet bottlenecks

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bullet: high bandwidth data dissemination using an overlay mesh

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SplitStream: high-bandwidth multicast in cooperative environments

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Transport layer identification of P2P traffic

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
CREW: A Gossip-based Flash-Dissemination System

ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Scale and performance in the CoBlitz large-file distribution service

NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Flash Data Dissemination in Unstructured Peer-to-Peer Networks

ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific data sets. In this paper, we present the Bee protocol, which is a cooperative peer-to-peer data dissemination protocol aiming at minimizing the maximum dissemination time for all peers to obtain time-critical data, such as critical patch updates. Bee is a decentralized protocol that organizes peers into a randomized mesh-based overlay and each peer only works with local knowledge. We devise a slowest peer first strategy to boost the speed of dissemination, and a topology adaptation algorithm that provides the most efficient utilization of the network capacity. Bee is designed to support network heterogeneity and deal with the flash crowd arrival pattern without sacrificing the dissemination speed. We present experimental results on the performance of Bee in terms of dissemination time and show that its performance can approach lower bound of the maximum dissemination time.