ACM Transactions on Computer Systems (TOCS)
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
On broadcasting in heterogenous networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On Cooperative Content Distribution and the Price of Barter
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
CREW: A Gossip-based Flash-Dissemination System
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
On collaborative content distribution using multi-message gossip
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast file dissemination in peer-to-peer networks with upstream bandwidth constraint
Future Generation Computer Systems
| Hi-index | 0.00 |
Flash Dissemination is a particularly useful form of data broadcast that arises in many mission-critical applications. The goal is rapid distribution of medium amounts of data in as short a time period as possible. While optimal algorithms are available for a highly constrained case (all nodes having the same bandwidth and latency), there is relatively little work in the context of heterogenous networks. Most systems and protocols today either use trees or randomized mesh-based techniques to deal with heterogeneity and work with local knowledge. We argue that a protocol with global knowledge can perform much better. In this paper, we propose two centralized heuristics – DIM-Rank and DIM-Time that use global knowledge to schedule data transfer between nodes. The heuristics are based upon insights from broadcast theory. We perform experimental evaluation of these two heuristics with decentralized randomized approaches and show that DIM-Rank achieves faster dissemination than decentralized approaches across a range of heterogeneity metrics.