Skip to main content

Implementation of P2P Computing in Self-organizing Network Routing

  • Conference paper
Grid and Cooperative Computing - GCC 2004 (GCC 2004)

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

Included in the following conference series:

  • 233 Accesses

Abstract

We find lots of similarities between P2P and self-organizing network, and how to implement P2P technology into self-organizing network is the main object of our research. By building a virtual network topology named P2P overlay network on top of internet’s physical topology layer based on P2P computing mode, we can effectively build a full-decentralized internet based self-organizing network routing model- Hierarchical Aggregation Self-organizing Network (HASN). The target and architecture of HASN are described in this paper, as well as a detailed description of a P2P decentralized naming, route discovering and updating algorithm- HASN_Scale. The network simulation results testify that the new routing model can effectively increase the network scalability and routing efficiency by reducing the consumption of network bandwidth.

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. Parameswaran, M., Susarla, A.: P2P Networking: An Information-Sharing Alternative. IEEE Computing Practices (July 2001)

    Google Scholar 

  2. Jain, S., Mahajan, R., Wetherall, D.: A Study of the Performance Potential of DHT-based Overlays. In: 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003) (March 2003)

    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: Annual conference of the Special Interest Group on Data Communication (SIGCOMM 2001) (August 2001)

    Google Scholar 

  4. Glewin, D.: Consistent hashing and random trees: Algorithms for caching in distributed networks. Master’s thesis, Department of EECS, MIT(1998), Available at the MIT Library http://thesis.mit.edu/

  5. The NS-2 Homepage, http://www.isi.edu/nsnam/ns/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, Z., Huang, J., Zhao, X. (2004). Implementation of P2P Computing in Self-organizing Network Routing. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_83

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30208-7_83

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23564-4

  • Online ISBN: 978-3-540-30208-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics