BGP-Based Clustering for Scalable and Reliable Gossip Broadcast

  • M. Brahami
  • P. Th. Eugster
  • R. Guerraoui
  • S. B. Handurukande
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3267)


This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only have “local knowledge” about each other. They organize themselves dynamically (right from the bootstrapping phase), according to join, leave or crash events, to form a locality-based dissemination graph. Broadcast messages can be disseminated using these graphs in large networks like the Internet, without relying on any special infrastructure or intermediate brokers. Roughly speaking, a dissemination graph consists of “non-crossing” (independent) trees that provide multiple paths between processes for improved broadcast efficiency and reliability. Each tree is constructed using BGP routing information about process “locality”. We convey the feasibility of the algorithm using both simulation and experimental results and describe an application of our algorithm for broadcasting information streams.


System design Peer-to-peer communications Content distribution Multicast Service overlay networks Fault-tolerance Broadcast streams 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hadzilacos, V., Toueg, S.: 5: Fault-Tolerant Broadcasts and Related Problems. In: Distributed Systems, 2nd edn., pp. 97–145. Addison-Wesley, Reading (1993)Google Scholar
  2. 2.
    Deering, S.: Host extensions for IP multicasting; RFC 1112. Internet Requests for Comments (1989)Google Scholar
  3. 3.
    Eriksson, H.: Mbone: The multicast backbone. Communications of the ACM 37 (1994)Google Scholar
  4. 4.
    hua Chu, Y., Rao, S.G., Seshan, S., Zhang, H.: A case for end system multicast. IEEE Journal on Selected Areas in Communication (JSAC), Special Issue on Networking Support for Multicast (2002)Google Scholar
  5. 5.
    Francis, P.: Yoid: Extending the internet multicast architecture (2000),
  6. 6.
    Chawathe, Y.: Scattercast: An adaptable broadcast distribution framework. Special issue of the ACM Multimedia Systems Journal on Multimedia Distribution (2002)Google Scholar
  7. 7.
    Deshpande, H., Bawa, M., Garcia-Molina, H.: Streaming live media over a peer-to-peer network (2002),
  8. 8.
    Birman, K., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Transactions on Computer Systems 17, 41–88 (1999)CrossRefGoogle Scholar
  9. 9.
    Li, Z., Mohapatra, P.: Hostcast: A new overlay multicasting protocol. In: Proceedings of the IEEE International Communications Conference (ICC) (2003)Google Scholar
  10. 10.
    Castro, M., Jones, M., Kermarrec, A.M., Rowstron, A., Theimer, M., Wang, H., Wolman, A.: An evaluation of scalable application-level multicast built using peer-to-peer overlay networks. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM) (2003)Google Scholar
  11. 11.
    Francis, P., Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: Idmaps: A global internet host distance estimation service. IEEE/ACM Trans. on Networking (October 2001)Google Scholar
  12. 12.
    Theilmann, W., Rothermel, K.: Dynamic distance maps of the internet. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM) (2000)Google Scholar
  13. 13.
    Lin, M.J., Marzullo, K.: Directional gossip: Gossip in a wide area network. In: Hlavicka, J., Maehle, E., Pataricza, A. (eds.) EDDC 1999. LNCS, vol. 1667, pp. 364–379. Springer, Heidelberg (1999)Google Scholar
  14. 14.
    Rekhter, Y., Li, T.: A border gateway protocol 4 (bgp-4). RFC-1771 (1995),
  15. 15.
    Garces-Erice, L., Ross, K.W., Biersack, E.W., Felber, P.A., Urvoy-Keller, G.: Topology-centric look-up service. In: Stiller, B., Carle, G., Karsten, M., Reichl, P. (eds.) NGC 2003 and ICQT 2003. LNCS, vol. 2816, pp. 58–69. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  16. 16.
    Deering, S.: Multicast routing in internetworks and extended lans. In: Proceedings of ACM SIGCOMM (1988)Google Scholar
  17. 17.
    Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kermarrec, A.M., Kouznetsov, P.: Lightweight probabilistic broadcast. In: Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN 2001) (2001)Google Scholar
  18. 18.
    Gupta, I., Kermarrec, A.M., Ganesh, A.: Adaptive and efficient epidemic-style protocols for reliable and scalable multicast. In: Proceedings of 20th Symposium on Reliable and Distributed Systems (SRDS 2002) (2002)Google Scholar
  19. 19.
    Xiao, Z., Birman, K.: Randomized error recovery algorithm for reliable multicast. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM) (2001)Google Scholar
  20. 20.
    Castro, M., Druschel, P., Kermarrec, A.M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: High-bandwidth multicast in a cooperative environment. In: Proceedings of The ACM Symposium on Operating Systems Principles (SOSP) (2003)Google Scholar
  21. 21.
    Harrenstien, K., Stahl, M., Feinler, E.: Rfc 954: Nicname/whois (1985),
  22. 22.
    Web, M.: The routing arbiter project (2002),
  23. 23.
    Bourcier, P.: Cyberabuse (2001),
  24. 24.
    Cai, J., Chen, C.W.: Fec-based video streaming over packet loss networks with pre-interleaving. In: Proceedings of IEEE International Conference on Information Technology: Coding and Computing (ITCC 2001) (2001)Google Scholar
  25. 25.
    Leslie, B., Sandler, M.: Packet Loss Resilient, Scalable Audio Compression and Streaming for Wired and Wireless IP Networks (White Paper) (2002)Google Scholar
  26. 26.
    van Renesse, R., Birman, K., Vogels, W.: Astrolabe: A robust and scalable technology for distributed systems monitoring, management, and data mining. ACM Transactions on Computer Systems 21 (2003)Google Scholar
  27. 27.
    Eugster, P.T., Guerraoui, R.: Probabilistic multicast. In: IEEE International Conference on Dependable Systems and Networks (DSN 2002) (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • M. Brahami
    • 1
  • P. Th. Eugster
    • 2
  • R. Guerraoui
    • 1
  • S. B. Handurukande
    • 1
  1. 1.Distributed Programming LaboratorySwiss Federal Institute of Technology in Lausanne (EPFL)Switzerland
  2. 2.Sun MicrosystemsSwitzerland

Personalised recommendations