Skip to main content

K-BRiR: An Efficient and Self-organized Routing Mechanism for Structured Peer-to-Peer Service Networks

  • Conference paper
  • 1306 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 113))

Abstract

Peer-to-Peer service network takes an important role in the internet technology. The routing mechanism is the core technology for P2P service network. In this paper, an efficient and self-organized routing mechanism named K-BRiR for structured P2P service network is presented. K-BRiR includes a basic routing protocol BRiR which is based on ring topology. The definitions and algorithms are discussed. Our experimental results confirm that K-BRiR is stable and efficient in P2P service network.

This paper is supported by Supported by Major Program of National Natural Science Foundation of China (no. 70931001).

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Joung, Y.J., Yang, L.W., Fang, C.T.: Keyword Search in DHT based Peer-to-Peer Networks. IEEE Journal on Selected Areas in Communications 25(1), 339–348 (2007)

    Google Scholar 

  2. Farag, A., Ahmad, R.: Recommendation Retrieval in Reputation Assessment for Peer-to-Peer Systems. J. Electronic Notes in Theoretical Computer Science 244(1), 13–25 (2009)

    Google Scholar 

  3. Do, T.T., Hua, K.A., Jiang, N., Liu, F.Y.: Patch Peer: A Scalable Video-on-demand Streaming System in Hybrid Wireless Mobile Peer-to-peer Networks. J. Peer-to-Peer Networking and Applications 2(3), 182–201 (2009)

    Article  Google Scholar 

  4. Ranka, S., Aluru, S., Buyya, R.: Security Issues in Cross-Organizational Peer-to-Peer Applications and Some Solutions. Communications in Computer and Information Science 40, 422–433 (2009)

    Article  Google Scholar 

  5. Nakashima, T., Ono, A., Sueyoshi, T.: Performance Framework for P2P Overlay Network. In: 2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, pp. 101–104 (2008)

    Google Scholar 

  6. Do, T.T., Hua, K.A., Lin, C.S.: Ext Range: Continuous Moving Range Queries in Mobile Peer-to-Peer Networks. In: Proceedings of the Tenth International Conference on Mobile Data Management: Systems, Services and Middleware, pp. 317–322 (2009)

    Google Scholar 

  7. Steinmetz, R., Wehrle, K.: Peer-to-Peer Systems and Applications. Springer, Berlin (2005)

    Book  Google Scholar 

  8. Stoica, I., Morris, R., Karger, D.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proceedings of the 2001 ACM Sigcomm Conference, pp. 149–160 (2001)

    Google Scholar 

  9. Ratnasamy, S., Francis, P., Handley, M.: A Scalable Content-Addressable Network. ACM Press, USA (2001)

    Book  Google Scholar 

  10. Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. University of California, Berkeley (2001)

    Google Scholar 

  11. Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329–350 (2001)

    Google Scholar 

  12. Jain, S., Mahajan, R., Wetherall, D.: A Study of the Performance Potential of DHT-based Overlays. In: Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems, pp. 11–12 (2003)

    Google Scholar 

  13. Chang, E.G., Roberts, R.: An Improved Algorithm for Decentralized Extrema-finding in Circular Configurations of Processors. Communications of the ACM 22(5), 281–282 (1979)

    Article  MATH  Google Scholar 

  14. Tan, Z.H., Cheng, W., Chang, G.R.: A Personalized Information Retrieval Algorithm Based on Word-Correlativity Model. Journal of Northeastern University (Natural Science) 29(4), 504–507 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, Z., Yang, G., Zhu, Z., Cheng, W., Chang, G. (2010). K-BRiR: An Efficient and Self-organized Routing Mechanism for Structured Peer-to-Peer Service Networks. In: Zaman, M., Liang, Y., Siddiqui, S.M., Wang, T., Liu, V., Lu, C. (eds) E-business Technology and Strategy. CETS 2010. Communications in Computer and Information Science, vol 113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16397-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16397-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16396-8

  • Online ISBN: 978-3-642-16397-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics