Advertisement

On Adding Structure to Unstructured Overlay Networks

  • João LeitãoEmail author
  • Nuno A. Carvalho
  • José Pereira
  • Rui Oliveira
  • Luís Rodrigues
Chapter
First Online:

Abstract

Unstructured peer-to-peer overlay networks are very resilient to churn and topology changes, while requiring little maintenance cost. Therefore, they are an infrastructure to build highly scalable large-scale services in dynamic networks. Typically, the overlay topology is defined by a peer sampling service that aims at maintaining, in each process, a random partial view of peers in the system. The resulting random unstructured topology is suboptimal when a specific performance metric is considered. On the other hand, structured approaches (for instance, a spanning tree) may optimize a given target performance metric but are highly fragile. In fact, the cost for maintaining structures with strong constraints may easily become prohibitive in highly dynamic networks. This chapter discusses different techniques that aim at combining the advantages of unstructured and structured networks. Namely we focus on two distinct approaches, one based on optimizing the overlay and another based on optimizing the gossip mechanism itself.

Keywords

Span Tree Overlay Network Average Path Length Virtual Node Broadcast Message 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

Acknowledgments

This work was partially supported by project “P-SON: Probabilistically Structured Overlay Networks” (POS C/EIA/60941/2004).

References

  1. 1.
    Birman, K., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41–88 (1999)CrossRefGoogle Scholar
  2. 2.
    Carvalho, N., Pereira, J., Oliveira, R., Rodrigues, L.: Emergentstructure in unstructured epidemic multicast. In: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, p. (to appear). Edinburgh, UK (2007)Google Scholar
  3. 3.
    hua Chu, Y., Rao, S.G., Zhang, H.: A case for end system multicast (keynote address). In: SIGMETRICS ’00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pp. 1–12. ACM, New York, NY, USA (2000). DOI http://doi.acm.org/10.1145/339331.339337
  4. 4.
    Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., Bowman, M.: Planetlab: an overlay testbed for broad-coverage services. SIGCOMM Comput. Commun. Rev. 33(3), 3–12 (2003). DOI http://doi.acm.org/10.1145/956993.956995 CrossRefGoogle Scholar
  5. 5.
    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 ’87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pp. 1–12. ACM, New York, NY, USA (1987). DOI http://doi.acm.org/10.1145/41840.41841
  6. 6.
    Eugster, P., Guerraoui, R., Kermarrec, A.M., Massoulié, L.: From Epidemics to Distributed Computing. IEEE Comput. 37(5), 60–67 (2004). DOI NAGoogle Scholar
  7. 7.
    Eugster, P.T., Guerraoui, R.: Probabilistic multicast. In: DSN ’02: Proceedings of the 2002 International Conference on Dependable Systems and Networks, pp. 313–324. IEEE Computer Society, Washington, DC, USA (2002)CrossRefGoogle Scholar
  8. 8.
    Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kouznetsov, P., Kermarrec, A.M.: Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. 21(4), 341–374 (2003). DOI http://doi.acm.org/10.1145/945506.945507 CrossRefGoogle Scholar
  9. 9.
    Floyd, S., Fall, K.: Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Trans. Netw. 7(4), 458-472 (1999)CrossRefGoogle Scholar
  10. 10.
    Floyd, S., Jacobson, V., Liu, C.G., McCanne, S., Zhang, L.: A reliable multicast framework for light-weight sessions and application level framing. IEEE/ACM Trans. Netw. 5(6), 784–803 (1997). DOI http://dx.doi.org/10.1109/90.650139 CrossRefGoogle Scholar
  11. 11.
    Ganesh, A., Kermarrec, A.M., Massoulié, L.: SCAMP: Peer-to-peer lightweight membership service for large-scale group communication. In: Networked Group Communication, pp. 44–55 (2001). URL citeseer.ist.psu.edu/ganesh01scamp.htmlGoogle Scholar
  12. 12.
    Hayden, M., Birman, K.: Probabilistic broadcast. Tech. rep., Cornell University, Ithaca, NY, USA (1996)Google Scholar
  13. 13.
    Jelasity, M.: A case study on gossip beyond gossip: Sorting. Ws. on Gossip Based Computer Networking, Lorent Center, Leiden (2006)Google Scholar
  14. 14.
    Jelasity, M., Babaoglu, O.: T-man: Fast gossip-based construction of large-scale overlay topologies. Tech. rep., University of Bologna (2004)Google Scholar
  15. 15.
    Jelasity, M., Babaoglu, O.: T-man: Gossip-based overlay topology management. In: The Fourth International Workshop on Engineering Self-Organizing Applications (ESOA’06). Hakodate, Japan (2006). URL http://dx.doi.org/10.1007/11734697_1 Google Scholar
  16. 16.
    Jelasity, M., Guerraoui, R., Kermarrec, A.M., van Steen, M.: The peer sampling service: experimental evaluation of unstructured gossip-based implementations. In: Middleware ’04: Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware, pp. 79–98. Springer-Verlag New York, Inc., New York, NY, USA (2004)Google Scholar
  17. 17.
    Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. In: Proceedings of The 24th International Conference on Distributed Computing Systems (ICDCS 2004), pp. 102–109. IEEE Computer Society, Tokyo, Japan (2004). URL citeseer.ist.psu.edu/jelasity04epidemicstyle.htmlGoogle Scholar
  18. 18.
    Jelasity, M., Montresor, A., Jesi, G.P., Voulgaris, S.: The Peersim simulator. http://peersim.sf.net
  19. 19.
    Karwaczynski, P.: Fabric: Synergistic proximity neighbour selection method. In: P2P ’07: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), pp. 229–230. IEEE Computer Society, Washington, DC, USA (2007)CrossRefGoogle Scholar
  20. 20.
    Karwaczyński, P., Konieczny, D., Moçnik, J., Novak, M.: Dual proximity neighbour selection method for peer-to-peer-based discovery service. In: SAC ’07: Proceedings of the 2007 ACM symposium on Applied computing, pp. 590–591. ACM, New York, NY, USA (2007). DOI http://doi.acm.org/10.1145/1244002.1244137 CrossRefGoogle Scholar
  21. 21.
    Kermarrec, A.M., Massoulié, L., Ganesh, A.: Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parallel Distrib. Syst. 14(3), 248–258 (2003). DOI http://dx.doi.org/10.1109/TPDS.2003.1189583 CrossRefGoogle Scholar
  22. 22.
    Koldehofe, B.: Buffer management in probabilistic peer-to-peer communication protocols. In: Proceedings of the 22th IEEE Symposium on Reliable Distributed Systems (SRDS’03), pp. 76–87. Florence, Italy (2003)Google Scholar
  23. 23.
    Leito, J.: Gossip-based broadcast protocols. Master’s thesis, University of Lisbon (2007)Google Scholar
  24. 24.
    Leito, J., Pereira, J., Rodrigues, L.: Epidemic broadcast trees. In: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (SRDS’2007), pp. 301–310. Beijing, China (2007)Google Scholar
  25. 25.
    Leito, J., Pereira, J., Rodrigues, L.: Hy Par View: A membership protocol for reliable gossip-based broadcast. In: DSN ’07: Proc. of the 37th Annual IEEE/IFIP Intl. Conf. on Dependable Systems and Networks, pp. 419–429. IEEE Computer Society, Edinburgh, UK (2007). DOI http://dx.doi.org/10.1109/DSN.2007.56 CrossRefGoogle Scholar
  26. 26.
    Leito, J., Pereira, J., Rodrigues, L.: Topology aware gossip overlays. Tech. Rep. 36, INESC-ID (2008)Google Scholar
  27. 27.
    Li, H., Clement, A., Wong, E., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: BAR gossip. In: Proceedings of the 2006 USENIX Operating Systems Design and Implementation (OSDI) (2006)Google Scholar
  28. 28.
    Lin, M.J., Marzullo, K.: Directional gossip: Gossip in a wide area network. In: European Dependable Computing Conference, pp. 364–379 (1999). URL citeseer.ist.psu.edu/237760.htmlGoogle Scholar
  29. 29.
    Liu, Y., Xiao, L., Ni, L., Liu, Y.: Building efficient overlays. J. Grid Comput. 2(2), 183–192 (2004)CrossRefGoogle Scholar
  30. 30.
    Massoulié, L., Kermarrec, A.M., Ganesh, A.J.: Network awareness and failure resilience in self-organising overlays networks. In: Synmposium on Reliable Distributed Systems (SRDS). Florence, Italy (2003). URL http://www.irisa.fr/paris/Biblio/Papers/Kermarrec/MasKerGan03SRDS.pdf
  31. 31.
    Melamed, R., Keidar, I.: Araneola: A scalable reliable multicast system for dynamic environments. In: NCA ’04: Proceedings of the Network Computing and Applications, Third IEEE International Symposium, pp. 5–14. IEEE Computer Society, Washington, DC, USA (2004)CrossRefGoogle Scholar
  32. 32.
    Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equations of state calculations by fast computing machine. J. Chem. Phys. 21, 1087–1091 (1953)CrossRefGoogle Scholar
  33. 33.
    Pereira, J., Oliveira, R., Rodrigues, L.: Efficient epidemic multicast in heterogeneous networks. In: Proceedings of the International Workshop on Reliability in Decentralized Distributed Systems, part of the OTM Federated Conferences and Workshops. Montpellier, France (2006)Google Scholar
  34. 34.
    Pereira, J., Rodrigues, L., Monteiro, M.J., Oliveira, R., Kermarrec, A.M.: NeEM: Network-friendly epidemic multicast. In: Proceedings of the 22th IEEE Symposium on Reliable Distributed Systems (SRDS’03), pp. 15–24. Florence, Italy (2003)Google Scholar
  35. 35.
    Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Application-level multicast using content-addressable networks. In: NGC ’01: Proceedings of the Third International COST264 Workshop on Networked Group Communication, pp. 14–29. Springer-Verlag, London, UK (2001)Google Scholar
  36. 36.
    van Renesse, R., Minsky, Y., Hayden, M.: A gossip-style failure detection service. Tech. rep., Cornell University, Ithaca, NY, USA (1998)Google Scholar
  37. 37.
    Rowstron, A.I.T., Kermarrec, A.M., Castro, M., Druschel, P.: Scribe: The design of a large-scale event notification infrastructure. In: NGC ’01: Proceedings of the Third International COST264 Workshop on Networked Group Communication, pp. 30–43. Springer-Verlag, London, UK (2001)Google Scholar
  38. 38.
    Santos, P., Pereira, J.: NeEM version 0.5. http://neem.sf.net (2006)
  39. 39.
    Tang, C., Ward, C.: GoCast: Gossip-enhanced overlay multicast for fast and dependable group communication. In: DSN ’05: Proc. of the 2005 Intl. Conf. on Dependable Systems and Networks (DSN’05), pp. 140–149. IEEE Computer Society, Washington, DC, USA (2005). DOI http://dx.doi.org/10.1109/DSN.2005.52 CrossRefGoogle Scholar
  40. 40.
    Vahdat, A., Yocum, K., Walsh, K., Mahadevan, P., Kostic, D., Chase, J., Becker, D.: Scalability and accuracy in a large-scale network emulator. SIGOPS Oper. Syst. Rev. 36(SI), 271–284 (2002). DOI http://doi.acm.org/10.1145/844128.844154 CrossRefGoogle Scholar
  41. 41.
    Voulgaris, S., Gavidia, D., Steen, M.: Cyclon: Inexpensive membership management for unstructured p2p overlays. J. Network Syst. Manag. 13(2), 197–217 (2005). DOI 10.1007/s10922-005-4441-x. URL http://dx.doi.org/10.1007/s10922-005-4441-x CrossRefGoogle Scholar
  42. 42.
    Winick, J., Jamin, S.: Inet-3.0: Internet topology generator. Tech. Rep. UM-CSE-TR-456-02, EECS, University of Michigan (2002). URL citeseer.nj.nec.com/526211.htmlGoogle Scholar
  43. 43.
    Zhuang, S., Zhao, B., Joseph, A., Katz, R., Kubiatowicz, J.: Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In: Proceedings of NOSSDAV (2001). URL citeseer.ist.psu.edu/zhuang01bayeux.htmlGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • João Leitão
    • 1
    Email author
  • Nuno A. Carvalho
    • 2
  • José Pereira
    • 2
  • Rui Oliveira
    • 2
  • Luís Rodrigues
    • 1
  1. 1.INESC-ID / ISTLisboaPortugal
  2. 2.University of MinhoBragaPortugal

Personalised recommendations

Cite chapter

Buy options