A Distributed Peer Selection Method for Supporting Scalable Peer-to-Peer Services


KIPS Transactions on Computer and Communication Systems, Vol. 2, No. 11, pp. 471-474, Nov. 2013
10.3745/KTCCS.2013.2.11.471,   PDF Download:

Abstract

In this paper, we propose a distributed parent peer selection method to construct an efficient peer-to-peer(P2P) network topology by considering the capacity of a peer and the hop distance from a data source to the peer. To achieve this goal, we propose a method to combine the two performance metrics to calculate the probability that a peer becomes a parent peer. Using the probability, we propose a method to select a parent peer stochastically by making use of the state information of the neighboring peers that each peer maintains. Through simulation studies, we show that the proposed method drives high capacity peers to support more children peers and makes the diameter of the P2P network shorter than the other methods.


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. S. Park, "A Distributed Peer Selection Method for Supporting Scalable Peer-to-Peer Services," KIPS Transactions on Computer and Communication Systems, vol. 2, no. 11, pp. 471-474, 2013. DOI: 10.3745/KTCCS.2013.2.11.471.

[ACM Style]
Jae Sung Park. 2013. A Distributed Peer Selection Method for Supporting Scalable Peer-to-Peer Services. KIPS Transactions on Computer and Communication Systems, 2, 11, (2013), 471-474. DOI: 10.3745/KTCCS.2013.2.11.471.