Skip to main content
SpringerLink
Log in
Book cover

Handbook of Peer-to-Peer Networking pp 327–365Cite as

On Adding Structure to Unstructured Overlay Networks

  • 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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   349.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   449.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birman, K., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41–88 (1999)

    Article  Google Scholar 

  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. 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. 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

    Article  Google Scholar 

  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. Eugster, P., Guerraoui, R., Kermarrec, A.M., Massoulié, L.: From Epidemics to Distributed Computing. IEEE Comput. 37(5), 60–67 (2004). DOI NA

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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

    Article  Google Scholar 

  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.html

    Google Scholar 

  12. Hayden, M., Birman, K.: Probabilistic broadcast. Tech. rep., Cornell University, Ithaca, NY, USA (1996)

    Google Scholar 

  13. Jelasity, M.: A case study on gossip beyond gossip: Sorting. Ws. on Gossip Based Computer Networking, Lorent Center, Leiden (2006)

    Google Scholar 

  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. 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. 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. 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.html

    Google Scholar 

  18. Jelasity, M., Montresor, A., Jesi, G.P., Voulgaris, S.: The Peersim simulator. http://peersim.sf.net

  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)

    Chapter  Google Scholar 

  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

    Chapter  Google Scholar 

  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

    Article  Google Scholar 

  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. Leito, J.: Gossip-based broadcast protocols. Master’s thesis, University of Lisbon (2007)

    Google Scholar 

  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. 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

    Chapter  Google Scholar 

  26. Leito, J., Pereira, J., Rodrigues, L.: Topology aware gossip overlays. Tech. Rep. 36, INESC-ID (2008)

    Google Scholar 

  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. 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.html

    Google Scholar 

  29. Liu, Y., Xiao, L., Ni, L., Liu, Y.: Building efficient overlays. J. Grid Comput. 2(2), 183–192 (2004)

    Article  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  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. 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. 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. van Renesse, R., Minsky, Y., Hayden, M.: A gossip-style failure detection service. Tech. rep., Cornell University, Ithaca, NY, USA (1998)

    Google Scholar 

  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. Santos, P., Pereira, J.: NeEM version 0.5. http://neem.sf.net (2006)

  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

    Chapter  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  Google Scholar 

  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.html

    Google Scholar 

  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.html

    Google Scholar 

Download references

Acknowledgments

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

Author information

Authors and Affiliations

  1. INESC-ID / IST, Lisboa, Portugal

    João Leitão & Luís Rodrigues

  2. University of Minho, Braga, Portugal

    Nuno A. Carvalho, José Pereira & Rui Oliveira

Authors
  1. João Leitão
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nuno A. Carvalho
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rui Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Luís Rodrigues
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to João Leitão .

Editor information

Editors and Affiliations

  1. Dept. Electrical & Computer Engineering, University of Waterloo, University Avenue W. 200, Waterloo, N2L 3G1, Canada

    Xuemin Shen

  2. Huawei Technologies, Somerset Corporate Blvd. 400, Bridgewater, 08807, U.S.A.

    Heather Yu

  3. Avaya Labs Research, Mount Airy Road 233, Basking Ridge, 07920, U.S.A.

    John Buford

  4. Dept. Electrical & Computer Engineering, University of Waterloo, University Avenue W. 200, Waterloo, N2L 3G1, Canada

    Mursalin Akon

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Leitão, J., Carvalho, N.A., Pereira, J., Oliveira, R., Rodrigues, L. (2010). On Adding Structure to Unstructured Overlay Networks. In: Shen, X., Yu, H., Buford, J., Akon, M. (eds) Handbook of Peer-to-Peer Networking. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09751-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-09751-0_13

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-09750-3

  • Online ISBN: 978-0-387-09751-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation