• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.298-300
• /
• 2001

본 논문에서는 웹, 모바일 환경에 적응 가능하고, 다양한 서비스의 지원이 가능한 글로벌 Peer-to-Peer(P2P) 엔진에서 서비스 모듈, 네트워크 모듈, 레파지토리 모듈간에 발생되는 메시지를 처리하는 메시지 디스패쳐의 설계 경험을 기술한다. P2P엔진이 이 기종 네트워크환경에 적응 가능하고, 다양한 서비스들을 동시에 지원하기 위해서는 피어 간 또는 엔진 내부에서 발생하는 많은 메시지들을 원활히 처리하는 모듈이 필요하다. 이를 위하여 메시지 처리를 위한 글로벌 P2P 엔진의 메시지 디스패쳐를 제안한다. 메시지 디스패쳐는 글로벌 P2P엔진에서 지원하는 서비스 또는 다른 모듈에서 발생하는 메시지들을 우선순위와 마감시간을 이용하여 작업순서를 배열하는 Message Queue, Message Queue에 적재된 메시지들을 분석하여 처리하는 Message Processor, 메시지 디스패쳐와 서비스 또는 각 모듈간의 메시지의 전달을 위한 공유 버퍼인 Service Buffer로 구성되어져 있다. P2P 엔진에서 메시지 디스패쳐를 이용하게 되면 다양만 서비스에 적응가능하고, 모듈간의 투명성을 제공하고, 신속한 메시지의 처리가 가능하게 된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.799-818
• /
• 2010

In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic and P2P network partition in mobile ad hoc network (MANET). We propose an approach to construct an efficient unstructured P2P overlay over MANET using underlying cluster-based routing (CBRP). One of the peers in the P2P network is used as a root-peer to connect all peers. Each peer maintains connection with physically closer peers such that it can reach the root-peer. The peer constructs a minimum-spanning tree consisting of itself, its directly connected neighbor peers and 2-hop away neighbor peers to remove far away redundant links and to build an overlay closer to the physical network. Due to on-demand nature of inter-cluster routing of CBRP, the positioning algorithm for MANET is used to retrieve the file by a peer from the source peer via shorter path in the physical network. We can show by simulation that our approach performs better in comparison with the existing approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.311-322
• /
• 2006

Peer-to-peer (P2P) systems have become a popular medium through which to share huge amounts of data. On the basis of network topology, P2P systems are divided into three types: centralized, structured distribution, unstructured distribution. Unstructured P2P systems such as Gnutella are novel in the sense that they are extensible and reliable. However, as the number of nodes increases, unstructured P2P systems would suffer from the high complexity of search operations that have to scan the network to find the required data items. Efficient replication of data items can reduce the complexity, but it introduces another problem of maintaining consistency among replicated data items when each data item could be updated. In this paper, we propose a new update propagation algorithm that propagates an updated data item to all of its replica. The proposed algorithm can reduce the message transfer overhead by adopting the notion of timestamp and hybrid push/pull messaging.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.389-400
• /
• 2008

As the wireless network technologies and the capability of the mobile terminals are evolving, advanced peer to peer applications for mobile users are attracting interests. In this paper, we propose the mobile P2P communication platform(MPCP) which provides transparency to the wireless network technologies and solutions to the limited resources of the mobile terminals. MPCP classifies the connection into two levels: a virtual channel and a session. A virtual channel is the network layer connection between the terminals whereas a session is the application layer connection. MPCP classifies the sessions into four types and applies different scheduling priority and data processing policies such as segmentation and reassembly. It selects proper wireless network technologies depending on the distance between the communication endpoints. To acquire dynamically changed access address, we harness the Session Initiation Protocol. We implemented MPCP on embedded Linux simulator and utilized the implementation in mobile P2P service development. For the quantitative analysis, we compared the performance of MPCP with that of ftp. Regardless of the number of simultaneous sessions, MPCP maintains the relative performance.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.591-601
• /
• 2012

Unstructured peer-to-peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1314-1316
• /
• 2009

최근 모바일 단말의 사용과 그에 관련된 제품의 개발이 급증하고 있는 관계로 이와 관련된 많은 Peer-to-Peer (P2P) 연구들이 진행 중이다. 특히, Mobile Ad-Hoc 네트워킹 환경에서의 P2P 방식에 대한 연구 또한 활발히 진행되고 있다. 하지만, Flooding 방식의 메시지 전송은, 파일 탐색 시 Query 메시지 가 기하급수 적으로 증가할 수 있다. 이러한 메시지 전송은 센서 네트워크에서는 전력의 급격한 소모를 가져와 네트워크의 유지를 할 수 없게 하는 등의 오버헤드를 발생시킨다. 본 논문에서는 이러한 P2P 파일 검색에서의 메시지 전송수를 줄이기 위해 Mobile Ad-Hoc Network 환경에서 Peer를 Parent Peer(PPR)와 Child Peer(CPR)로 구분화하여 그룹화를 시키고 그룹을 Peer로 둔 P2P 네트워크를 구성하였다. 또한, 그룹 안에서 발생하는 CPR들의 가입과 탈퇴를 관리하여 오버헤드 발생을 줄이는 방법을 제안한다.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.42-48
• /
• 2015

Generally, the current commercial cloud system is hosted by the centralization large datacenter. However, the other clouding forms existed and one of them is the P2P cloud. The P2P Cloud is a distributed systems, is freedom to join and leave and is possible to provide the IaaS. Commonly, P2P Cloud System is based on Pure-P2P System. Since a number of connection paths exist, it has a high reliability and easily scalability of the network. However, there are disadvantages of the slow rate of route because of looking up the all peers in order to search for the peer. In this paper, it proposes the P2P cloud system based on super-peer P2P. Super-peer P2P system has fast routing time, because of searching for cluster unit and it also can has high reliability and high scalability. We designs the super Peer cloud service and proposes the system model and Resource Allocation Algorithm for IaaS in Super peer P2P environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2136-2152
• /
• 2012

The growth of Internet technologies and the widespread use of mobile devices have been paving the way for the increasing use of conferencing services. Two types of systems have been designed to provide conferencing services: 1) a conferencing system using session control over a peer-to-peer (P2P) network and 2) an IP Multimedia Subsystem (IMS) conferencing system. The IMS conferencing system was developed to adapt to a server-based centralized system, whereas the benefits of the P2P operational model in providing such conference services are widely acknowledged. However, each system provides conferencing services only to its own users. Therefore, in this paper, we propose an interworking model to support multimedia conferencing service between the P2P environment and IMS networks. We also introduce protocol architecture and some service scenarios. To verify this system model and the design architecture, we perform an actual implementation and show experienced test results.