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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Han, S., Sohn, J., & Park, S. (2006). An efficient search scheme using self-organizing hierarchical ring in unstructured peer-to-peer systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4277 LNCS-I, pp. 55–56). Springer Verlag. https://doi.org/10.1007/11915034_26
Mendeley helps you to discover research relevant for your work.