• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.292-294
• /
• 2005

The emerging peer-to-peer (P2P) model has recently gained a significant attention due to its high potential of sharing various resources among networked users. Super-peer unstructured P2P systems have been found very effective by dividing the peers into two layers, super-peer and edge peer. Super peer deal with all Queries instead of edge peers. The existing P2P systems assume all super peers have equal roles and capabilities. However, all super peers don't so that edge peers should select the best super peer in order to handle Queries well. In this paper, we suggest the ISP2P (Intelligent Super-peer based P2P) which allows to select the best super peer to the edge peers. We classify super peers according as the capacity of a edge peer to a super peer. We show that considering the quality of a edge peer to a super peer can improve the performance of the response time and bandwidth.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.2
• /
• pp.62-64
• /
• 2006

The emerging peer-to-peer (P2P) model has recently gained a significant attention due to its high potential of sharing various resources among networked users. Super-peer based unstructured P2P systems have been found very effective by dividing the peers into two layers, super-peer and ordinary-peer Super-peers deal with all queries instead of ordinary-peers. The existing P2P systems assume all super-peers have equal responsibility and capabilities even if all super-peers have relative advantages and disadvantages. In this paper, we suggest the ISP2P (Intelligent Super-peer based P2P) which allows to select the best super peer to ordinary-peers. We classify super peers according as the capacity of an ordinary-peer a super-peer. We show that these considerations could improve the performance of the response time and Provide higher quality results to all peers in the network.

• 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 the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.65-73
• /
• 2016

Peer-to-Peer (P2P) systems with super-peer overlay networks show combined advantages of both hybrid and pure P2P systems. Super-peer is a special peer acting as a server to a cluster of generic peers. Organizing a super-peer network is one of important issues for P2P systems with super-peer networks. Conventional P2P systems are based on two-level hierarchies of peers. One is a layer for generic peers and the other is for super-peers. And it is usual that super-peer networks have forms of random graphs. However, for accommodating a large-scale collection of generic peers, the super-peer network has also to be extended. In this paper, we propose a scheme of hierarchically constructing super-peer networks for large-scale P2P systems. At first, a two-level tree, called a simple super-peer network, is proposed, and then a scheme of generalizing and then extending the simple super-peer network to multi-level super-peer network is presented to construct a large-scale super-peer network. We call it an extended super-peer network. The simple super-peer network has several good features, but due to the fixed number of levels, it may have a scalability problem. Thus, it is extended to k-level tree of a super-peer network, called extended super-peer network. It shows good scalability and easy management of generic peers for large scale P2P system.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.705-715
• /
• 2005

A peer-to-peer web caching has been studied recently as it can reduce the traffic converged on the server side and can support the traditional web caching model. Although the peer-to-peer web caching has the merit of having additional cache space from the local caches of peers without additional infrastructure, several constraints such as dynamic participation and local caching strategy caused by the autonomy of peers in peer-to-peer networks nay limit the performance of the peer-to-peer web caching. To overcome these limitations, we propose an efficient directory-based peer-to-peer web caching system under dynamic participation of peers. In the proposed caching system, we present new peer selection and replica management schemes by introducing the concept of the object lifetime in P2P networks. We evaluate the effectiveness of the proposed system through trace-driven simulations with a web log dataset. Simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in feasible peer-to-peer networks.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.159-161
• /
• 2006

The peer-to-peer (P2P) systems have Brown significantly over last few years due to their hish potential of sharing various resources. Super-peer based P2P systems have been found very effective by dividing the peers into two layers, SP (Super-Peer) and OP (Ordinary-Peer). In this paper, we present ISP2P (Intelligent Super-peer based P2P system), which allows us to choose the best SP. Through analyzing capacity and similarity between SP and OP, we can help OPs to select the most appropriate SP respectively. Proposed system can improve the performance of the average response time by superior SP, reduce the bandwidth cost by small path length due to content similarity and solve frequent SP replacement problem by considering similarity of user behavior.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.511-520
• /
• 2004

A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a sophisticated scheduling scheme called fixed-length slotted scheduling, which results in minimum buffering delay. The second problem is on the fast distribution of media content in the peer-to-peer system that is self-growing. We propose a mechanism accelerating the speed at which the system's streaming ca-pacity increases, called FAST.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.833-836
• /
• 2008

모바일 기기 보급이 급증함에 따라 모바일 환경에서 이루어지는 Peer-to-Peer(P2P)방식에 대한 연구가 활발히 진행되고 있다. 모바일 기기는 무선통신이라는 특성이 있기 때문에, 이동하는 peer의 에너지 절약이 항상 요구된다. Peer에 저장된 에너지를 모두 사용하게 되면 네트워크에 참여할 수가 없고, 에너지가 없는 peer 수가 지속적으로 증가되면 파일 탐색이 불가능하게 된다. Super peer를 기반으로 하는 계층적인 P2P 시스템은 기존의 단일 계층인 P2P 시스템보다 적은 양의 메시지를 이용하여 파일을 탐색할 수 있다는 장점이 있지만, super peer로 선정된 peer는 주변의 sub-peer들로부터 파일 탐색 요청 메시지를 지속적으로 받게 되어 빨리 에너지가 소모되는 단점이 있다. 본 논문은 super peer를 이용한 모바일 P2P 시스템에서 peer들의 남은 에너지를 고려하여 에너지가 적은 peer의 사용을 피하여 상대적으로 에너지가 많이 남은 peer들의 사용을 유도하는 시스템을 제안하였다. 실험을 통해서 성능평가를 하였으며, 제안된 시스템의 네트워크 유지시간이 기존 super peer를 이용한 시스템보다 오래 지속됨을 확인하였다.

• International Commerce and Information Review
• /
• v.6 no.3
• /
• pp.63-79
• /
• 2004

Peer-to-peer(P2P) has potential strength and possible factors which enable it to develop toward a new business by supplementing the limitation of the existing central server-type network. In various business sectors, various attempts have already been made to apply P2P. The computing power which was possible to be formed through peer-to-peer networking will become a powerful tools for expanding toward new business area depending the utilization methods by sector. Although the technology-centric P2P concept is a major interest now, its development direction will head toward service-centric P2P concept for satisfying desires of end-users(individual peers) for reliable contents and improving their purchasing convenience. But the solution requisites should be solved for the efficient application of P2P to business such as the establishment of and supplement for the industrial standard and legal system for P2P, the enhancement of peers recognition of P2P. Presently e-commerce using P2P is being implemented by a few enterprises locally by means of B2C. But if many enterprises enter this type of e-commerce, and the standardization of peer programmes, goods and documents is made, it will be able to be extended to B2B. Also it seems that it can be utilized in international transactions as well as in domestic transactions. So there is much room for the application of P2P to be extended further. Also there has been presented the necessity for related industries to support their work with theories and for academic studies to be made actively to set the direction of its development. It is hoped that multi-angled and in-depth studies on the utilization of P2P and various attempts to application of it to business be made on the basis of this study. For the development of P2P, continuous study and attempts are needed. The field of P2Ps application is very large and it will become a powerful tool, depending upon its application methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.286-290
• /
• 2008

As the number of mobile device users increases, many researches on peer-to-peer(P2P) systems in mobile environments have been carried out. In this paper, we propose a couple of double-layered P2P file sharing systems to overcome the 'flooding' problem in previous mobile P2P systems. We classify peers into two groups, super peers and sub-peers to establish new routing tables. A super peer manages its sub-peers in the systems. The first proposed system partitions the service area into small cells, each of which is a square. Each super peer is located near the center of the square. The second system selects super peers which have the largest number of adjacent peers. As file transmission and file searches are managed mainly by super peers, unnecessary multi-broadcasting could be avoided. The experimental results show that the proposed systems outperform a typical file sharing system in terms of the amount of message traffic with about $1.2{\sim}1.6$ times improvement on the average.