A Peer-to-Peer Search Scheme using Self-Organizing Super Peer Ring


The KIPS Transactions:PartA, Vol. 13, No. 7, pp. 623-632, Dec. 2006
10.3745/KIPSTA.2006.13.7.623,   PDF Download:

Abstract

We propose a peer-to-peer search scheme in which super peers with high capacity constitute a ring by themselves and all peers utilize the ring for their query and publishing keys. In a dynamic peer-to-peer environment, the size of the super peer ring changes adaptively according to the changes of the system, but more powerful peers are continuously promoted to super peers. By simulations, we show that our proposed search scheme improves the query success rate of Gnutella 1hop replication search method, and maintains shorter query delay than JXTA as a static ring.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. E. Son, S. Y. Han, S. Y. Park, "A Peer-to-Peer Search Scheme using Self-Organizing Super Peer Ring," The KIPS Transactions:PartA, vol. 13, no. 7, pp. 623-632, 2006. DOI: 10.3745/KIPSTA.2006.13.7.623.

[ACM Style]
Jae Eui Son, Sae Young Han, and Sung Yong Park. 2006. A Peer-to-Peer Search Scheme using Self-Organizing Super Peer Ring. The KIPS Transactions:PartA, 13, 7, (2006), 623-632. DOI: 10.3745/KIPSTA.2006.13.7.623.