Skip to main content
SpringerLink
Log in

SAM: Scalable Addressing Mechanism for Structured P2P Networks

  • Conference paper
  • First Online:
Proceedings of the Third International Afro-European Conference for Industrial Advancement — AECIA 2016 (AECIA 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 565))

Included in the following conference series:

  • 740 Accesses

Abstract

Structured P2P network must be able to handle churn effectively and be resilient to nodes failure. The network must also scale to large number of nodes while maintaining a minimum diameter. In this paper we introduce SAM: A Scalable Addressing Mechanism for structured P2P networks. SAM places nodes based on geometric addressing, maps keys onto values using Distributed Hash Table (DHT), and locates keys in the network efficiently. Lookups in SAM are bounded to \(O(N^{1/d})\), where d is the number of dimensions. Moreover, each node in SAM only maintains \(2(3^d-1) \) routing entries. Finally, SAM adapts to nodes dynamics and recovers lost paths by deploying two maintenance algorithms.

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and 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

Notes

  1. 1.

    In a fully occupied system there are no remote neighbors.

  2. 2.

    In this case it is \(p'\)s nodeId and IP address.

  3. 3.

    If the successor happens to be a direct neighbor of n, it will be added directly to the permanent entries.

References

  1. Wang, Y., Li, X., Jin, Q., Ma, J.: AB-Chord: an efficient approach for resource location in structured P2P networks. In: 2012 9th International Conference on Ubiquitous Intelligence & Computing and 9th International Conference on Autonomic & Trusted Computing (UIC/ATC), Fukuoka, pp. 278–284 (2012)

    Google Scholar 

  2. Hai, M., Guo, S.: An efficient multi-keyword search mechanism in structured P2P networks. In: 2010 IEEE International Conference on Progress in Informatics and Computing (PIC), Shanghai, pp. 552–555 (2010)

    Google Scholar 

  3. Ghimire, J., Mani, M., Crespi, N., Sanguankotchakorn, T.: Delay and capacity analysis of structured P2P overlay for lookup service. Telecommun. Syst. 58(1), 33–54 (2015)

    Article  Google Scholar 

  4. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM 2001, pp. 161–172 (2001)

    Google Scholar 

  5. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable P2P lookup service for internet applications. In: Proceedings of ACM SIGCOMM 2001, pp. 149–160 (2001)

    Google Scholar 

  6. Kumar, A., Merugu, S., Xu, J., Yu, X.: Ulysses: a robust, low-diameter, low-latency peer-to-peer network. In: Proceedings of IEEE ICNP (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Dhofar University, P.O. Box 2509, 211, Salalah, Oman

    Manaf Zghaibeh & Najam Ul Hasan

Authors
  1. Manaf Zghaibeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Najam Ul Hasan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manaf Zghaibeh .

Editor information

Editors and Affiliations

  1. Machine Intelligence Research Labs, Auburn, Washington, USA

    Ajith Abraham

  2. Department of Mathematics and Computer, Faculty of Sciences and Techniques, Settat, Morocco

    Abdelkrim Haqiq

  3. Information Technology Department, Faculty of Computers and Information, Giza, Egypt

    Aboul Ella Hassanien

  4. VSB-Technical University of Ostrava, Ostrava, Czech Republic

    Vaclav Snasel

  5. ENIS, University of Sfax, Sfax, Tunisia

    Adel M. Alimi

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Zghaibeh, M., Ul Hasan, N. (2018). SAM: Scalable Addressing Mechanism for Structured P2P Networks. In: Abraham, A., Haqiq, A., Ella Hassanien, A., Snasel, V., Alimi, A. (eds) Proceedings of the Third International Afro-European Conference for Industrial Advancement — AECIA 2016. AECIA 2016. Advances in Intelligent Systems and Computing, vol 565. Springer, Cham. https://doi.org/10.1007/978-3-319-60834-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60834-1_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60833-4

  • Online ISBN: 978-3-319-60834-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation