Advertisement

Network-Friendly Gossiping

  • Sabina Serbu
  • Étienne Rivière
  • Pascal Felber
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5873)

Abstract

The emergence of large-scale distributed applications based on many-to-many communication models, e.g., broadcast and decentralized group communication, has an important impact on the underlying layers, notably the Internet routing infrastructure. To make an effective use of network resources, protocols should both limit the stress (amount of messages) on each infrastructure entity like routers and links, and balance as much as possible the load in the network. Most protocols use application-level metrics such as delays to improve efficiency of content dissemination or routing, but the extend to which such application-centric optimizations help reduce and balance the load imposed to the infrastructure is unclear. In this paper, we elaborate on the design of such network-friendly protocols and associated metrics. More specifically, we investigate random-based gossip dissemination. We propose and evaluate different ways of making this representative protocol network-friendly while keeping its desirable properties (robustness and low delays). Simulations of the proposed methods using synthetic and real network topologies convey and compare their abilities to reduce and balance the load while keeping good performance.

Keywords

Internet Service Provider Network Friendliness Infected Node Route Length Active Thread 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
  3. 3.
    Aggarwal, V., Akonjang, O., Feldmann, A.: Improving user and ISP experience through ISP-aided P2P locality. In: Global Internet Symp. (2008)Google Scholar
  4. 4.
    Ball, N., Pietzuch, P.: Distributed content delivery using load-aware network coordinates. In: ROADS 2008 (2008)Google Scholar
  5. 5.
    Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286 (1999)Google Scholar
  6. 6.
    Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. TOCS 17(2), 41–88 (1999)CrossRefGoogle Scholar
  7. 7.
    Braden, R.: Requirements for internet hosts: Communication layers. Internet Engineering Task Force RFC 1122 (October 1989)Google Scholar
  8. 8.
    Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: a decentralized network coordinate system. In: SIGCOMM 2004 (2004)Google Scholar
  9. 9.
    Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: PODC 1987 (1987)Google Scholar
  10. 10.
    Erdös, P., Rényi, A.: On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5, 17–61 (1960)MATHGoogle Scholar
  11. 11.
    Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kermarrec, A.-M., Kouznetsov, P.: Lightweight probabilistic broadcast. TOCS 21(4) (2003)Google Scholar
  12. 12.
    Hu, N., Li, L.E., Mao, Z.M., Steenkiste, P., Wang, J.: Locating internet bottlenecks: algorithms, measurements, and implications. In: SIGCOMM 2004: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 41–54. ACM, New York (2004)CrossRefGoogle Scholar
  13. 13.
    Jelasity, M., Babaoglu, O.: T-man: Gossip-based overlay topology management. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS (LNAI), vol. 3910, pp. 1–15. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    Jelasity, M., Kermarrec, A.-M.: Ordered slicing of very large-scale overlay networks. In: P2P 2006 (2006)Google Scholar
  15. 15.
    Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: Gossip-based peer sampling. TOCS 25(3), 8 (2007)CrossRefGoogle Scholar
  16. 16.
    Karp, R.M., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: IEEE Symposium on Foundations of Computer Science (2000)Google Scholar
  17. 17.
    Kashyap, S., Deb, S., Naidu, K.V.M., Rastogi, R., Srinivasan, A.: Efficient gossip-based aggregate computation. In: PODS 2006 (2006)Google Scholar
  18. 18.
    Kermarrec, A.-M., van Steen, M. (eds.): ACM SIGOPS OSR, s.i. on Gossip-based computer networking, vol. 41(5). ACM, New York (2007)Google Scholar
  19. 19.
    Kostoulas, D., Psaltoulis, D., Gupta, I., Birman, K.P., Demers, A.J.: Active and passive techniques for group size estimation in large-scale and dynamic distributed systems. Journal of Systems and Software 80(10), 1639–1658 (2007)CrossRefGoogle Scholar
  20. 20.
    Montresor, A., Jelasity, M., Babaoglu, O.: Chord on demand. In: P2P 2005 (2005)Google Scholar
  21. 21.
    Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: PODC 2006 (2006)Google Scholar
  22. 22.
    Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  23. 23.
    Hilt, V., Hofmann, M., Seetharaman, S., Ammar, M.: Preemptive strategies to improve routing performance of native and overlay layers. In: INFOCOM 2007 (2007)Google Scholar
  24. 24.
    van Renesse, R., Minsky, Y., Hayden, M.: A gossip-style failure detection service. Technical Report TR98-1687. Cornell university (1998)Google Scholar
  25. 25.
    Voulgaris, S., Gavidia, D., van Steen, M.: Cyclon: Inexpensive membership management for unstructured P2P overlays. Journal of Network and Systems Management 13(2), 197–217 (2005)CrossRefGoogle Scholar
  26. 26.
    Voulgaris, S., van Steen, M.: Epidemic-style management of semantic overlays for content-based searching. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 1143–1152. Springer, Heidelberg (2005)Google Scholar
  27. 27.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ networks. Nature 393(6684), 440–442 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Sabina Serbu
    • 1
  • Étienne Rivière
    • 2
  • Pascal Felber
    • 1
  1. 1.University of NeuchâtelSwitzerland
  2. 2.NTNU TrondheimNorway

Personalised recommendations