Abstract
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.
This work was supported by NSF Grant, Award Numbers 0331707 and 0331690.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bittorrent: http://bitconjurer.org/bittorrent/
Shakecast: http://earthquake.usgs.gov/resources/software/shakecast//
Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. In: ACM TOCS (1999)
Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: High-bandwidth multicast in a cooperative environment. In: SOSP (2003)
Deshpande, M., Xing, B., Lazardis, I., Hore, B., Venkatasubramanian, N., Mehrotra, S.: Crew: A gossip-based flash-dissemination system. In: ICDCS (2006)
Farley, A.M.: Broadcast time in communication networks. SIAM Journal on Applied Mathematics 39 (1980)
Fernandess, C., Malkhi, D.: On collaborative content distribution using multi-message gossip. In: IPDPS (2006)
Ganesan, P., Seshadri, M.: On cooperative content distribution and the price of barter. In: ICDCS (2005)
Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: IEEE Symposium on Foundations of Computer Science (FOCS 2000) (2000)
Khuller, S., Kim, Y.-A.: On broadcasting in heterogeneous networks. In: ACM-SIAM Symposium on Discrete algorithms (2004)
Kostic, D., Rodriguez, A., Albrecht, J., Vahdat, A.: Bullet: High bandwidth data dissemination using an overlay mesh. In: Usenix Symposium on Operating Systems Principles (SOSP) (2003)
Yang-hua Chu, S.S., Rao, S.G., Zhang, H.: A case for end system multicast. Measurement and Modeling of Computer Systems (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deshpande, M., Venkatasubramanian, N., Mehrotra, S. (2006). Heuristics for Flash-Dissemination in Heterogenous Networks. In: Robert, Y., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2006. HiPC 2006. Lecture Notes in Computer Science, vol 4297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945918_57
Download citation
DOI: https://doi.org/10.1007/11945918_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68039-0
Online ISBN: 978-3-540-68040-6
eBook Packages: Computer ScienceComputer Science (R0)