Skip to main content

Efficient Message Flooding on DHT Network

  • Conference paper
High Performance Computing and Communications (HPCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3726))

  • 816 Accesses

Abstract

For the high scalability, DHT network becomes popular in P2P development in these few years. In comparing to flooding-based searching in unstructured P2P network, DHT network provides an efficient lookup. However, flooding still plays an important role in P2P systems. Some fundamental functions such as information collection, dissemination, or keyword searching can benefit from an efficient flooding mechanism. In this paper, we present a DHT network in which one flooding request generates O(N) messages where N is the system size. Moreover, our method considers message locality. Message forwarding across different autonomous systems are reduced significantly. Base on our flooding mechanism, information broadcasting and aggregation are fulfilled without much effort.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Bhagwan, R., Moore, D., Savage, S., Voelker, G.M.: Replication Strategies for Highly Available Peer-to-Peer Storage. In: Proceedings of FuDiCo: Future directions in Distributed Computing (June 2002)

    Google Scholar 

  2. 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, pp. 329–350. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of ACM SIGCOMM 2001, San Deigo, CA (August 2001)

    Google Scholar 

  4. Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st annual ACM symposium on Principles of distributed computing (2002)

    Google Scholar 

  5. Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: Proc. 4th USENIX Symposium on Internet Technologies and Systems (2003)

    Google Scholar 

  6. El-Ansary, S., Alima, L.O., Brand, P., Haridi, S.: Efficient Broadcast in Structured P2P Networks. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Chawathe, Y., Seshadri, M.: Broadcast Federation: an application layer broadcast internetwork. In: Proceedings of NOSSDAV 2002 (2002)

    Google Scholar 

  8. Portmann, M., Seneviratne, A.: Cost-effective broadcast for fully decentralized peer-to-peer networks. Computer Communications 26(11), 1159–1167 (2003)

    Article  Google Scholar 

  9. Rowstron, A., Kermarrec, A.M., Castro, M., Druschel, P.: SCRIBE: The design of a large-scale event notification infrastructure. Networked Group Communication (2001)

    Google Scholar 

  10. Castro, M., Jones, M.B., Kermarrec, A.-M., Rowstron, A., Theimer, M., Wang, H., Wolman, A.: An Evaluation of Scalable Application-Level Multicast Built Using Peer-to-Peer Overlays. In: IEEE INFOCOM 2003 (2003)

    Google Scholar 

  11. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393, 440 (1998)

    Article  Google Scholar 

  12. Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Application-level multicast using content-addressable networks. In: Proceedings of Third International Workshop on Networked Group Communication (2001)

    Google Scholar 

  13. Li, J., Sollins, K., Lim, D.-Y.: Implementing aggregation and broadcast over Distributed Hash Tables. ACM SIGCOMM Computer Communication Review 35 (2005)

    Google Scholar 

  14. Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design. IEEE Internet Computing Journal 6(1) (2002)

    Google Scholar 

  15. RFC 1772. Autonomous System, http://www.faqs.org/rfcs/rfc1772.html

  16. Aberer, K., Punceva, M., Hauswirth, M., Schmidt, R.: Improving Data Access in P2P. IEEE Internet Computing 6(1) (2002)

    Google Scholar 

  17. TWNIC IP Address Distribution List, http://rms.twnic.net.tw/twnic/User/Member/Search/main7.jsp?Order=ORG.ID

  18. apia project, http://apia.peerlab.net/

  19. Dabek, F., Li, J., Sit, E., Robertson, J., Frans Kaashoek, M., Morris, R.: Designing a DHT for low latency and high throughput. In: Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (March 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, CW., Yang, W. (2005). Efficient Message Flooding on DHT Network. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_53

Download citation

  • DOI: https://doi.org/10.1007/11557654_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29031-5

  • Online ISBN: 978-3-540-32079-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics