Heuristics for Flash-Dissemination in Heterogenous Networks

  • Mayur Deshpande
  • Nalini Venkatasubramanian
  • Sharad Mehrotra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4297)


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.


Heterogenous Network Global Knowledge Spare Capacity Homogenous Network Data Broadcast 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
  3. 3.
    Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. In: ACM TOCS (1999)Google Scholar
  4. 4.
    Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: High-bandwidth multicast in a cooperative environment. In: SOSP (2003)Google Scholar
  5. 5.
    Deshpande, M., Xing, B., Lazardis, I., Hore, B., Venkatasubramanian, N., Mehrotra, S.: Crew: A gossip-based flash-dissemination system. In: ICDCS (2006)Google Scholar
  6. 6.
    Farley, A.M.: Broadcast time in communication networks. SIAM Journal on Applied Mathematics 39 (1980)Google Scholar
  7. 7.
    Fernandess, C., Malkhi, D.: On collaborative content distribution using multi-message gossip. In: IPDPS (2006)Google Scholar
  8. 8.
    Ganesan, P., Seshadri, M.: On cooperative content distribution and the price of barter. In: ICDCS (2005)Google Scholar
  9. 9.
    Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: IEEE Symposium on Foundations of Computer Science (FOCS 2000) (2000)Google Scholar
  10. 10.
    Khuller, S., Kim, Y.-A.: On broadcasting in heterogeneous networks. In: ACM-SIAM Symposium on Discrete algorithms (2004)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Yang-hua Chu, S.S., Rao, S.G., Zhang, H.: A case for end system multicast. Measurement and Modeling of Computer Systems (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mayur Deshpande
    • 1
  • Nalini Venkatasubramanian
    • 1
  • Sharad Mehrotra
    • 1
  1. 1.School of Information and Computer ScienceUniversity of CaliforniaIrvine

Personalised recommendations