• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.80-89
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method that compensates disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do fast data search and maintain search efficiency independent of the number of peers. The peers in a DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in a DHT method should send messages more frequently to keep the routing table updated and reduce the failure of requests. However this results in increasing the overall network traffic. In this paper, we propose a method to reduce the update load of a routing table in the existing DHT by updating it in a reactive way. In the proposed reactive method, a routing table is updated only if a data request is coming whereas it is updated periodically in the existing proactive method. We perform experiments using Chord simulator(I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.

• Review of KIISC
• /
• v.15 no.6
• /
• pp.60-67
• /
• 2005

올 9월 NGN2005에서는 2003년을 기점으로 하여 인터넷에서 가장 많은 트래픽을 차지하는 서비스가 P2P(Peer-to-Peer) 서비스라는 통계를 발표하였다. 실제로, 현재 수많은 사용자가 P2P 서비스를 이용하고 있으며 다양한 P2P 응용 및 구조에 대한 연구가 다소 활발히 진행되고 있는 상황이다. 최근에는 P2P 파일공유 응용분야에서 DHT(Distributed Hash Table) 기반의 오버레이 네트워크를 활용하고자 하는 일부 연구도 진행되고 있다. 이와 관련하여 본 고 에서는 DHT 기반 P2P 오버레이 네트워크를 구축하기 위한 기존의 방식들을 소개하고, 이에 대한 보안 위협을 분석하고자 한다.

• 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 네트워크의 메시지 전송 방식의 효율을 높이는 방법을 소개한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.150-152
• /
• 2005

인터넷 상의 컴퓨팅 자원을 오버레이 네트워크를 구성하여 새로운 컴퓨팅 인프라를 구성하려는 연구가 분산 해쉬 테이블 (Distributed Hash Table) 방식의 Peer-to-Peer(P2P) 네트워크로 실현되고 있다. DHT 방식의 P2P 네트워크는 자원의 복제 및 공유하여 컴퓨팅 시스템 전반에 걸친 신뢰성과 결함감내 능력을 향상시키고 Exactly Matching Query에 장점이 있는 반면에 다중키 질의, 계층 질의 및 구간 질의와 같은 복합 질의(Rich Query) 제원에 문제점을 드러낸다. 이 논문에서는 DHT 기반의 P2P 네트워크에서 Rich Query 를 지원하기 위한 방법을 소개한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1486-1492
• /
• 2007

Searching distributed resources efficiently is very important in distributed computing environments like P2P. But distributed resource searching may have system overheads and take a lot of time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. In this paper, we design a proxy peer algorithm based on DHT(Distributed Hash Table) for efficient distributed resource searching in JXTA network environments. By containing the rendezvous information in proxy peer and searching a rendezvous peer firstly which has higher hit ratio, we can reduce the searching number and minimize system overheads.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.773-782
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.761-772
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.199-206
• /
• 2006

Internet telephony provides voice communication services with added flexibility for multimedia extension at a lower cost compared to traditional telephone systems. We implemented an internet telephony system as an overlay network without a centralized server, using a distributed hash table (DHT). Compared to the current server-based internet telephony system, our system is fault-tolerant, scalable, and can be flexible extended to various services and advanced to integrated service. To demonstrate the high flexibility of our DHT-based internet telephony system, we made our system cooperate with web servers. Web users can check up others' online stales and establish voice communication sessions to online users at a mouse click. This technology can be applied to more complex services such as multimedia messaging or video conference service.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.111-120
• /
• 2012

As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry were suggested based on the distributed hash table, these systems are limited to $log_2N$ for performance efficiency. For this enhanced performance efficiency limited, the article herein suggests group routing algorithm. The suggested algorithm is a node-to-group routing algorithm which divides circular address space into groups and uses a concept of pointer representing each group, which is an algorithm where routing is performed based on pointer. To evaluate algorithm performance, a comparative analysis was conducted on average hops, routing table size, and delayed transmission for chord and routing, a signature algorithm in P2P systems. Therefore, enhanced performance is verified for comparative items from the simulation results.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.6
• /
• pp.1052-1059
• /
• 2016

Video-on-Demand(VoD) is one of the most popular media streaming which attracted many researchers' attention. VMesh is one of the most cited works in the field of the VoD system. VMesh is proposed to solve the problem of random seeking functionality. However, a large number of the DHT(Distributed Hash Table) searches in VMesh is sill the main problem which needs to be solved. In order to reduce the number of the DHT searches, the clustered segment index(CSI) scheme is proposed. In this scheme, the video segments are divided into clusters. The segment information of the video segments, which are clustered into the same cluster, are stored in the same clustered segment index that can be searched by using the hash key. Each peer also can request the required segments by using this clustered segment index. The experiment results show that the number of the DHT searches in the proposed scheme is less than that of VMesh even in case of peers leave and join the network or peers perform the fast forward/backward operations.