• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.6
• /
• pp.65-76
• /
• 2007

The P2P file sharing system sends the results to users by searching the files in the shared folders. In the process of it, the problem is that the transferred information includes the pathname and file information and it can be revealed who searches which files. In related to this problem, anonymous file sharing P2P protocol has been an active research area where a number of works have been produced. However, the previous studies still have a few of weakness. Therefore, We propose two anonymous P2P file sharing protocols based on the decentralized and unstructured Random Walk. The first scheme uses the dynamic onion routing where the requester can receive the wanted file without knowing other peers' IDs. The second scheme uses the IP multicast method which lowers the computational overhead. Both of them are more suited for the dynamic P2P system.

• Annual Conference of KIPS
• /
• 2008.05a
• /
• pp.826-829
• /
• 2008

모바일 환경에서는 모바일 기기의 제한된 에너지를 효율적으로 사용하는 것이 요구된다. 특히 모바일 Peer-to-Peer(P2P) 시스템에서 모바일 기기가 피어로서 저장된 에너지를 모두 소모하면 더 이상파일 탐색 등과 같은 작업에 참여할 수 없게 된다. 또한 에너지가 없는 피어가 증가하게 되면 파일탐색 실패율이 증가하게 되고, 결국 파일탐색이 불가능하게 된다. 슈퍼피어(super peer)를 기반으로 한 계층적 P2P 시스템은 기존 단일 계층 P2P 시스템보다 더 적은 양의 메시지로 파일탐색을 가능하게 해준다. 하지만 하나의 슈퍼피어가 관리하는 서브피어(sub-peer)가 많을 경우, 서브피어의 관리 비용과 파일 탐색 요청의 증가로 슈퍼피어의 에너지 소모 비율이 크게 증가하게 되며, 이로 인해 네트워크 참여 시간이 줄어들게 된다. 이는 전체 네트워크 유지시간 감소에 영향을 미친다. 본 논문은 무선 통신 기반의 모바일 환경에서 슈퍼피어를 기반으로 한 계층적 P2P 시스템을 기반으로, 슈퍼피어가 관리하는 서브피어들의 수를 제한하고, 만약 일정한 수를 초과하였을 경우, 초과한 슈퍼피어의 서브피어들 중에서 새로운 슈퍼피어를 선정하고, 기존 슈퍼피어로부터 일부 서브피어들을 분배하여 관리하게 하는 시스템을 제안하였다. 실험을 통해 성능을 평가 하였으며, 실험 결과 파일 탐색 요청을 위한 네트워크 유지시간이 더 오래 지속됨을 확인하였다.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.615-626
• /
• 2002

Recently, as interest in Home networking is increased, research about multimedia clip service is gone. Because of the limit to bandwidth of home network, the problem of server traffic is increased by transferring many multimedia data through Client-Sewer Way for long. The data share network system applied is designed and implemented to solve this problem. P2P is connected directly between clients and exchanges data without going through a sewer. We implemented platform-independent System using Java and applied P2P skill to reduce server traffic.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.376-380
• /
• 2009

Peer-to-Peer content delivery technology recently begins to be used not only for file sharing applications such as eDonkey but also for every kind of content services. KBS, a broadcasting company in Korea, is aggressively driving to apply Peer-to-Peer technology to KBS's commercial internet video service but we found that there are two big huddles. First, end users may refuse to share their own resources for KBS's cost reduction using Peer-to-Peer content delivery technology. Second, it may cause that the number of free-riders increases and the efficiency of the overall system would fall. From commercial service provider's perspective, we have to avoid that end users have unfavorable impressions on the service and the usefulness of Peer-to-Peer technology decreases. In order to overcome these problems, we studied how to offer incentive to end users and how much incentive would be reasonable, and then applied the result to real service for verification.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.121-127
• /
• 2011

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.707-741
• /
• 2005

In the multimedia streaming technology, the unicast method require additional cost by an increase traffic according to increase a number of users. The multicast method can solve this problem, but it don't have connection and control information of clients. Now, the most routers support only unicast. Also it has a problem with an exchange of service in other ISP. This paper proposes traffic agent system which is applied unicast and P2P(Peer to Peer) for distance video teaming to overcome this problem. The proposed system decrease the traffic of stream server by control agent, and cut down expenses of network. This system is tested under the distance video leaning using JMF and application software.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.133-151
• /
• 2019

In order to achieve faster content distribution speed and stronger fault tolerance, a P2P peer can connect to multiple peers in parallel and receive chunks of the data simultaneously. A critical issue in this environment is selecting a set of nodes participating in swarming sessions. Previous related researches only focus on performance metrics, such as downloading time or the round-trip time, but in this paper, we consider a new performance metric which is closely related to the network and propose a peer selection algorithm that produces the set of peers generating optimal worst link stress. We prove that the optimal algorithm is practicable and has the advantages with the experiments on PlanetLab. The algorithm optimizes the congestion level of the bottleneck link. It means the algorithm can maximize the affordable throughput. Second, the network load is well balanced. A balanced network improves the utilization of resources and leads to the fast content distribution. We also notice that if every client follows our algorithm in selecting peers, the probability is high that all sessions could benefit. We expect that the algorithm in this paper can be used complementary to existing methods to derive new and valuable insights in peer-to-peer networking.

• Journal of Korean Academy of Fundamentals of Nursing
• /
• v.8 no.1
• /
• pp.51-68
• /
• 2001

The purpose of this study was to explain the relationship between smoking status, smoking behavior and hardiness in university students in Gangnung City. The subjects were a convenience sample of 315 students. The data were collected by a questionnaire given to the students between May 22 to June 2, 2000. An instrument developed by Akers & Gang(1996) and translated by Sohn, Jung-Nam(1999) was used in this study to measure definition of smoking, differential reinforcement of smoking and smoking behavior. The differential peer association scale developed Krohn et al.(1982) and translated by Sohn, Jung-Nam(1999), and the hardiness scale developed by Pollock(1984) and translated by Suh, Mun-Sa(1988) were also used. The data were analyzed using the SAS/PC+ Program and included descriptive statistics, t-test, ANOVA, and Spearman correlation coefficients. The results of this study are as follows : 1. The smoking rate for university students was 50.5% of which 44.7% started smoking in high school. 2. The mean score for level of hardiness was $3.14{\pm}0.43$ 3. The mean score for smoking behavior was as follows : 1) The mean score for the neutralizing definition was $2.16{\pm}0.57$ 2) The mean score for the negative definition was $2.37{\pm}0.71$ 3) The mean score for the positive differential reinforcement was $1.89{\pm}0.63$ 4) The mean score for the negative differential reinforcement was $2.96{\pm}0.64$ 5) The mean score for the differential peer association was $2.67{\pm}1.05$ 4. The data showed positive correlations between hardiness and the neutralizing definition(r=.1951, P<.001), between hardiness and the positive differential reinforcement(r=.1128, P<.05), between hardiness and the amount of smoking per day(r=.1452, P<.05) between the neutralizing definition and positive differential reinforcement(r=.4212, P<.0001), between the neutralizing definition and differential peer association(r=.1856, P<.001), between the neutralizing definition and age at smoking initiation(r=.1582, P<.05), between the negative definition and negative differential reinforcement(r=.2985, P<.0001), between the positive differential reinforcement and differential peer association(r=.3451, P<.0001), between positive differential reinforcement and the amount of smoking per day(r=.4431, P<.0001), between differential peer association and the duration of smoking(r=.2789, P<.0001), between differential peer association and the amount of smoking per day(r=.5410, P<.0001), between the duration of smoking and the amount of smoking per day(r=.4245, P<.0001). The data showed negative correlations between the neutralizing definition and the negative definition(r=-.2065, P<.001) between the neutralizing definition and negative differential reinforcement(r=-.3943, P<.0001) between the neutralizing definition and duration of smoking(r=-.1957, P<.05), between the negative definition and positive differential reinforcement(r=-.2093, P<.001), between the negative definition and the amount of smoking per day(r=-.2282, P<.001), between positive differential reinforcement and negative differential reinforcement(r=-.5555, P<.0001) between negative differential reinforcement and differential peer association(r=-.3653, P<.0001), between negative differential reinforcement and the amount of smoking per day(r=-.4570, P<.0001), between the age at smoking initiation and the duration of smoking(r=-.4594, P<.0001).