Abstract
We propose an efficient search scheme based on a self-organizing hierarchical ring structure in unstructured peer-to-peer systems. Our solution maintains a consistent super-peer ratio and makes the peers with relatively high capacities super-peers in dynamic environments. The benchmarking results show that the proposed algorithm outperforms the static algorithm that has the fixed number of rendezvous peers such as JXTA.
This work was supported by the Brain Korea 21 project in 2006.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/11915034_125.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ganesh, A.J., Kermarrec, A.M., Massoulie, L.: Peer-to-Peer Membership Management for Gossip-Based Protocols. IEEE Transactions on Computers (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, S., Sohn, J., Park, S. (2006). An Efficient Search Scheme Using Self-organizing Hierarchical Ring in Unstructured Peer-to-Peer Systems. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops. OTM 2006. Lecture Notes in Computer Science, vol 4277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11915034_26
Download citation
DOI: https://doi.org/10.1007/11915034_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48269-7
Online ISBN: 978-3-540-48272-7
eBook Packages: Computer ScienceComputer Science (R0)