• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.578-584
• /
• 2003

본 논문에서는 인터넷 기반 P2P 네트워크를 이용한 Grid 컴퓨팅에서의 효율적인 보안 관리 모델을 제시한다. 하나는 P2P 네트워크를 이용한 에러 복구 과정과 다른 하나는 에이전트간 신뢰관계 구성 방안이다. 또한 P2P 네트워크에서 다양한 네트워크 간 보안 통신을 보장하기 위해 SOAP을 이용한 보안 메시지 프로토콜을 제안한다. 제안된 새로운 보안 관리 모델은 P2P 네트워크로 구성된 Grid 컴퓨팅 네트워크의 성능을 향상시킬 것으로 기대된다.

• Proceedings of the KAIS Fall Conference
• /
• 2006.05a
• /
• pp.540-544
• /
• 2006

사용자가 자료를 직접 송수신하기 위한 P2P 네트워크 환경에는 하이브리드 P2P 네트워크 환경과 순수 P2P 네트워크 환경이 있다. 하이브리드 P2P 네트워크 환경에서 모든 피어들은 서버에 연결되어 있기 때문에, 피어들 간 메시지를 전달할 수 없는 네트워크 고립 상태가 발생되지 않는다. 그러나 순수 P2P 네트워크 환경에서 각 피어들은 서버 없이 서로 직접 연결하여 다른 피어로부터 서비스를 제공받기 때문에, 각 피어들 간의 통신을 중재하는 특정 피어가 종료할 경우 대상 피어들과의 통신이 단절되는 네트워크 고립 현상이 발생될 수 있다. 본 논문에서는 이러한 문제점을 해결하기 위해 각 피어들로 하여금 인접한 피어로부터 IP 주소를 얻어 목록으로 관리하게 함으로써, 연결된 피어가 종료할 경우 목록으로 유지된 IP 주소로 연결하여 네트워크 그룹에 지속적으로 참여할 수 있게 하는 기법을 연구하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.433-435
• /
• 2003

Peer­To­Peer(P2P) 네트워크 모델은 기존의 클라이언트/서버(Client/Server:C/S) 네트워크 모델에 비해 중앙 네트워크상의 트래픽 회피라는 측면에서 현재 활발히 연구되고 있는 분야이다. 그러나 P2P 네트워크 모델은 확장성, 네트워크에 참여하는 노드들의 수에 대한 제약, 구성된 네트워크 모델 기반에서 정보 및 공유 가능한 자원들의 검색에 대한 어려움 등의 많은 문제점들이 있다. 본 논문에서는 효과적인 정보 및 자원의 검색을 위해 정형화된 P2P 네트워크 모델을 기반으로 하여 P2P 네트워크 모델이 가지고 있는 특성들을 고려하여 동적으로 구성 가능한 위상 구조를 제시한다.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.481-490
• /
• 2006

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

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.11-19
• /
• 2004

P2P network environments provide users with direct data transmission and sharing facilities and those environments can be classified into hybrid P2P network environments and pure P2P network environments according to the arbitration mechanism among the peers in the network. In hybrid P2P network environments, there exists a server that maintains index information for the data to be shared and network isolation does not occur because every peer always keeps connection to the server. In pure P2P network environments, however, each peer directly connects to another peer and gets services without server intervention, and so, network isolation can occur when the mediating peer fails to work. In this paper. we propose a scheme for each peer to keep connection to other peers continuously by maintaining IP addresses of its neighbor peers and connecting to the peers when the mediating peer fails to work. Although the P2P application that uses our proposed framework should obtain one or more IP addresses of the neighbor peers manually, after instantiation, the application can do its job while maintaining connection to the network continuously and automatically. To evaluate our proposed scheme, we measured and analyzed the time for a peer to reconnect to the network when the mediating peer fails and the network isolation occurs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.175-178
• /
• 2005

인터넷 상의 불특정 다수의 컴퓨팅 자원을 연계하여 오버레이 네트워크를 구성하여 새로운 컴퓨팅 인프라를 구성하려는 분산 해쉬 테이블 (Distributed Hash Table)방식의 Peer-to-Peer(P2P) 네트워크 관련 연구가 진행되고 있다. DHT 방식의 P2P네트워크는 자원의 복제 및 공유하여 컴퓨팅 시스템 전반에 걸친 신뢰성과 결함 감내 능력을 향상시키는 장점이 있는 반면에 하부 네트워크 정보를 무시하기 때문에 전체 시스템 구성 및 메시지 전송에 있어 실제적인 성능상의 문제점을 드러낸다. 이 논문에서는 하부 네트워크의 구성 정보를 이용하여 DHT 기반의 P2P 네트워크의 메시지 전송 방식의 효율을 높이는 방법을 소개한다.

• Journal of Digital Contents Society
• /
• v.12 no.1
• /
• pp.133-139
• /
• 2011

Structured P2P (peer-to-peer) networks have received much attention in research communities and the industry. The data stored in structured P2P networks can be located in a log-scale time without using central severs. The link-structure of structured P2P networks should be maintained for keeping log-scale search performance of it. When nodes join or leave structured P2P networks frequently, some links become unavailable and search performance is degraded by these links. To sustain search performance of structured P2P networks, periodic link recovery scheme is generally used. However, when the link recovery period is short or long compared with node join and leave rates, it is possible that sufficient number of links are not restored or excessive messages are used after the link-structure is restored. We propose the adaptive link recovery determination algorithm to maintain the link-structure of structured P2P networks when the rates of node joining and leaving are changed dynamically. The simulation results show that the proposed algorithm can maintain similar QoS under various node leaving rates.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1447-1454
• /
• 2012

Recently P2P is the most popular network service on Internet and is applied various areas such as streaming, file sharing and software distribution, but there are many security threats depending on vulnerabilities by P2P network environments. Conceptually P2P network is a overlay network based on Internet, and it has security concerns of itself as well as those of Internet environments. In this paper, we analyze the vulnerabilities and threats for domestic P2P services through various experiments and describe their risk analysis. We expect that this work contributes to new domestic P2P services in consideration of service qualities and security vulnerabilities.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.586-590
• /
• 2009

The objective of this paper describes the design of MapReduce over Peer-to-Peer network for dynamic environments applications. MapReduce is a software framework used for Cloud Computing which processing large data sets in a highly-parallel way. Based on the Peer-to-Peer network character which node failures will happen anytime, we focus on using a DHT routing protocol which named Pastry to handle the problem of node failures. Our results are very promising and indicate that the framework could have a wide application in P2P network systems while maintaining good computational efficiency and scalability. We believe that, P2P networks and parallel computing emerge as very hot research and development topics in industry and academia for many years to come.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.1033-1042
• /
• 2004

According to the arbitration mechanism among the peers in the network, the P2P networking environments can be classified into hybrid P2P networking environments and pure P2P networking environments. In hybrid P2P networking environments, each peer gets continual services from the servers that arc operational most of the time, and so, network isolation does not occur because every peer can always keep connection to the server. In pure P2P networking environments, however, every peer directly connects to another peer without server intervention, and so, network isolation can occur when the per mediating the connection is terminated. In this paper, we propose a scheme for each peer to keep connection information of other peers by maintaining IDs of its neighbor peers, to reconnect to another peers when the mediating peer fails to work. and, for efficiency. to balance the number of connections that should be maintained by each peer. With our mechanism, each pier in the network can continuously maintain connection to the network and get seamless services from other peers. Through the simulation, we ascer-tained that network isolation does not occur in the pure P2P network adopting our mechanism and that our mechanism distributes and balances the connections that are maintained by each peer. We also analyzed the total network traffic and the mean number of hops for the connections made by each peer according to the recommended number of connections that is established at system setup time.