Skip to main content

Efficient Broadcast in Structured P2P Networks

  • Conference paper
Peer-to-Peer Systems II (IPTPS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2735))

Included in the following conference series:

Abstract

In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks. In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly Nā€‰āˆ’ā€‰1 messages. We emphasize the perception of a class of DHT systems as a form of distributed k-ary search and we take advantage of that perception in constructing a spanning tree that is utilized for efficient broadcasting. We consider broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alima, L.O., El-Ansary, S., Brand, P., Haridi, S.: Dks(n; k; f): A family of low communication, scalable and fault-tolerant infrastructures for p2p applications. To appear in the 3rd International workshop on Global and Peer-To-Peer Computing on large scale distributed systems, Tokyo, Japan (May 2003)

    Google ScholarĀ 

  2. Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A.: Scribe: A large-scale and decentralised application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC) (Special issue on Network Support for Multicast Communications) (2002)

    Google ScholarĀ 

  3. El-Ansary, S., Alima, L.O., Brand, P., Haridi, S.: A framework for peer-to-peer lookup services based on k-ary search. Technical Report TR-2002-06, SICS (May 2002)

    Google ScholarĀ 

  4. FreeNet, http://freenet.sourceforge.net (2003)

  5. Gnutella, http://www.gnutella.com (2003)

  6. Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex queries in dht-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.Ā 2429, p. 242. Springer, Heidelberg (2002)

    ChapterĀ  Google ScholarĀ 

  7. Markatos, E.P.: Tracing a large-scale peer to peer system: An hour in the life of gnutella. In: Second International Symposium on Cluster Computing and the Grid (2002)

    Google ScholarĀ 

  8. Maymounkov, P., Mazires, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.Ā 2429, p. 53. Springer, Heidelberg (2002)

    ChapterĀ  Google ScholarĀ 

  9. Mozart Consortium, http://www.mozart-oz.org (2003)

  10. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. Technical Report TR-00-010, Berkeley, CA (2000)

    Google ScholarĀ 

  11. Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Applicationlevel multicast using content-addressable networks. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol.Ā 2233, p. 14. Springer, Heidelberg (2001)

    ChapterĀ  Google ScholarĀ 

  12. Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design (2002)

    Google ScholarĀ 

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

    ChapterĀ  Google ScholarĀ 

  14. Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. Technical Report TR-819, MIT (January 2002)

    Google ScholarĀ 

  15. Stoica, I., Adkins, D., Ratnasamy, S., Shenker, S., Surana, S., Zhuang, S.: Internet indirection infrastructure. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.Ā 2429, p. 191. Springer, Heidelberg (2002)

    ChapterĀ  Google ScholarĀ 

  16. Yang, B., Garcia-Molina, H.: Efficient search in peer-to-peer networks. In: The 22nd International Conference on Distributed Computing Systems, ICDCS 2002 (2001)

    Google ScholarĀ 

  17. Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. U. C. Berkeley Technical Report UCB//CSD-01-1141 (April 2000)

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

El-Ansary, S., Alima, L.O., Brand, P., Haridi, S. (2003). Efficient Broadcast in Structured P2P Networks. In: Kaashoek, M.F., Stoica, I. (eds) Peer-to-Peer Systems II. IPTPS 2003. Lecture Notes in Computer Science, vol 2735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45172-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45172-3_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40724-9

  • Online ISBN: 978-3-540-45172-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics