• 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 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.

• 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.

• Annual Conference of KIPS
• /
• 2007.11a
• /
• pp.932-935
• /
• 2007

모바일 기기 사용이 급증함에 따라 모바일환경에서 이루어지는 P2P방식 연구가 활발히 진행되고 있다. 본 논문에서는 기존의 모바일환경에서의 P2P방식이 지닌 peer들 사이의 multi-broadcasting 방식의 문제점을 보완하고, 새로운 routing table을 구축하기 위해 peer들을 2개의 계층으로 구분하였다. 즉, peer들을 super peer들과 각 super peer에 의해 관리되는 sub peer들로 구분하였다. 파일의 탐색과 전송은 super peer들이 관리하므로, 기존의 불필요한 multi-broadcasting 방식을 피할 수 있다. 본 논문에서는 분산 네트워크를 위한 peer의 계층화 작업을 설계하였다. MIS(Maximal Independent Set)알고리즘을 이용하여 peer들의 계층화 작업을 외부의 도움 없이 peer들간의 통신으로 할 수 있게 만들었다. 이처럼 peer들을 super peer와 sub peer로 구분하면 불필요한 broadcasting을 피할 수 있어 시스템 성능이 향상되며, 이를 실험을 통하여 증명하였다.

• 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.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.501-510
• /
• 2006

The self-organizing super peer ring P2P search scheme improves search performance of the existing unstructured peer-to-peer systems, in which super peers with high capacity constitute a ring structure and all peer in the system utilize the ring for publishing or querying their keys. In this paper, we further improves the performance of the self-organizing ring by adaptively changing its super peer ratio according to the status of the entire system. By using PSO, the optimized super peer ratio can be maintained within the system. Through simulations, we show that our self-organizing super peer ring optimized by PSO outperforms not only the fixed super peer ring but also the self-organizing super ring with fixed ratio in the aspect of query success rate.

• 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.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1706-1715
• /
• 2008

In a super-peer based P2P network, the network is clustered and each cluster is managed by a special peer, which is called a super-peer. A Super-peer has information of all the peers in its cluster. This type of clustered P2P model is known to have efficient information search and less traffic load than unclustered P2P model. In this paper, we compute the message traffic cost incurred by peers' query, join and update actions within a cluster as well as between the clusters. With these values, we estimate the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.

• Annual Conference of KIPS
• /
• 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를 이용한 시스템보다 오래 지속됨을 확인하였다.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.623-632
• /
• 2006

We propose a peer-to-peer search scheme in which super peers with high rapacity 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.