• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.11
• /
• pp.471-474
• /
• 2013

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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.12
• /
• pp.870-872
• /
• 2014

In this paper, we devise a cost function by considering the energy consumption rate and the remaining energy of a peer. Then, we propose a parent peer selection method that chooses the least cost peer in the system in a distributed manner. On the contrary to the conventional method that makes each peer select the least cost neighbor as a parent peer, the proposed method chooses a parent peer using the swarm intelligence formed among a set of peers. Therefore, the proposed method could extent distributedly the number of peers searched for parent peer selection. Thus, compared to the conventional method, the proposed method increases the probability of being a parent peer as the cost of a peer becomes smaller with less operational load.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.11-18
• /
• 2006

In the Internet of various networks, it is difficult to reduce real routing time by just minimizing their hop count. We propose an adaptive proximity route selection method in DHT-based peer-to-peer systems, in which nodes select the nぉe with smallest lookup latency among their routing table entries as a next routing node. Using Q-Routing algorithm and exponential recency-weighted average, each node estimates the total latency and establishes a lookup table. Moreover, without additional overhead, nodes exchange their lookup tables to update their routing tables. Several simulations measuring the lookup latencies and hop-to-hop latency show that our method outperforms the original Chord method as well as CFS' server selection method.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.133-139
• /
• 2009

A P2P technology in distributed computing fields is presented various methods to share resources between network connected peers. This is very efficient that a degree of resources to good use as compared with peers by using centralized network by a few servers. However peers to compose P2P system is not always online status, therefore it is difficult to support high reliability to user. In our previous work of this paper, it is contributing to reduce the loading rates to select of new resource support peer but a selection method the peers to share works to download resources is very simple that it is just selected about peer to have lowest job. In this paper, we reduced frequency offline peers by estimate based on a average value of success rates for peers.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.49-56
• /
• 2006

A special feature of P2P distributed system isn't always the guarantee of online status for peers. In other words we want to download the file from the peer when we use the P2P system but it sometimes caused this system to fail the download. Many studies to resolve this problem depend on re-transmission method. It caused to lower performance so we have to resolve this problem. In this study, we analysis the average usage time of P2P application user and raise the resource transmission guarantee to apply the selection criteria of resource supplier. Moreover the combinations of distributed object replication techniques, the role to enhance the data transmission opportunity of high popularity resource. will cause this search algorithm to advance.