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

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.493-498
• /
• 2005

P2P service is a method that can share various information through direct connection between computer of a person who have information and a Person who have information without server in the Internet and it is getting a lot of popularity by method for free ex change of file. P2P file sharing systems have become popular as a new paradigm for information exchange. Because all users who use service in P2P file sharing system can use shared files of several users freely by equal access privilege, it is happening the 'free rider' that only download shared file of other users without share own files. Although a user share a malicious file including virus, worm or file that have title differing with actuality contents, can use file sharing service without limitation. In this paper, we propose a method that restrict access of 'free rider' that only download using reputation information that indicate reliability of user. Also, we restrict usage ons hared file of other users about users who share harmful file.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1328-1337
• /
• 2007

We describe a method for streaming specific section using the section information among peers on P2P network. As peers tend to extract only the part of contents in which they are interested, an indexed file is created based on the section information of multimedia contents and registered in the search server. If a peer requests the streaming of specific parts of the contents to other corresponding peer using the section information that the server returns, the peer streams only separated section of the multimedia contents according to the information. For this process, we implement a function that a peer's PC can play a role as a server, and the peer streams the separated content based on the section information that the server supplies.

• Journal of Digital Contents Society
• /
• v.8 no.3
• /
• pp.403-410
• /
• 2007

The P2P(Peer to Peer) business, which has brought the great wave all over the world, was made possible as a user's environment is getting improved through the introduction of high-tech PC, and the access service of high-speed internet. P2P is the form that anyone using computer could be both a provider and a user by searching or connecting to the personal computer each other out of the concept of server and client. In other words, it is the system made by the technique which could share the data connecting between the PC of the person with the information and the person searching the information. Recently a various system of P2P is under the development which could be applied to the electronic commerce among the companies which is not only the file share among the individuals. In this paper, we propose the more effective electronic business system making use of P2P.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.33-42
• /
• 2013

In the early stage of P2P, the technology was limited to narrow usage of file sharing, but currently, P2P technology has become essential to maximize the efficiency between associated technologies without additional deployment of high costly infrastructure and also the burden of the server. Especially, P2P media streaming service is a highly attractive service to mobile users. which requires a higher quality in the mobile environment in accordance with the development of technology of wired network as well as better mobile terminals. However, P2P technology should consider the trade-off between 'peer selfishness' and QoE for providing fairness. The P2P system also try to maximize the resource utilization through an incentive mechanism for service differentiation and encourage peers to contribute continuously for improving the overall system performance. In this paper, we propose an point-based incentive mechanism based on peer's contribution level and energy availability for service differentiation. We also introduce that the proposed mechanism efficiently enhances the system performance as the peer with incentive using contribution and energy obtains more effective resource distribution.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.109-117
• /
• 2009

In this paper, we propose an efficient service discovery scheme that combines peer-to-peer caching advertisement and node ID-based selective forwarding service requests. P2P caching advertisement quickly spreads available service information and reduces average response hop count since service information store in neighbor node cache. In addition, node ID-based service requests can minimize network transmission delay and can reduce network load since do not broadcast to all neighbor node. Proposed scheme does not require a central lookup server or registry and not rely on flooding that create a number of transmission messages. Simulation results show that proposed scheme improved network loads and response times since reduce a lot of messages and reduce average response hop counts using adaptive selective nodes among neighbor nodes compared to traditional flooding-based protocol.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.406-425
• /
• 2012

Deploying advanced home networking technologies and modern home-networked devices in residential environments provides a playground for new home applications and services. Because home multimedia entertainment is among the most essential home applications, this paper presents an appealing home media content sharing scenario: home-networked devices can discover neighboring devices and share local media content, as well as enormous amounts of Internet media content in a convenient and networked manner. This ideal scenario differs from traditional usages that merely offer local media content and require tedious manual operations of connection setup and file transfer among various devices. To achieve this goal, this study proposes a proxy gateway architecture for home multimedia content distribution. The proposed architecture integrates several functional mechanisms, including UPnP-based device discovery, home gateway, Internet media provision, and in-home media content delivery. This design addresses several inherent limitations of device heterogeneity and network interoperability on home and public networks, and allows diverse home-networked devices to play media content in an identical and networked manner. Prototypical implementation of the proposed proxy gateway architecture develops a proof-of-concept software, integrating a BitTorrent peer-to-peer client, a UPnP protocol stack, and a UPnP AV media server, as well as media distribution and management components on the OSGi home gateway platform. Practical demonstration shows the proposed design and scenario realization, offering users an unlimited volume of media content for home multimedia entertainment.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.762-765
• /
• 2003

최근 수 년간 클라이언트/서버 모델에서 발생하는 문제인 서버 병목 현상, DoS(Denial of service) 공격, 그리고 시스템의 확장성에 따르는 비용 증가 등의 문제를 해결하기 위한 방법으로 P2P (Peer-to-Peer) 방식이 활발히 연구되고 있다. P2P 방식을 사용하는 모델은 기존의 클라이언트/서버 모델이 적용되었던 절러 분야에 이용되고 있다. 그 중 사용자간 파일 공유하는 분야에 적용된 P2P가 가장 널리 알려져 있다. 본 연구는 P2P 파일 공유 어플리케이션을 위한 효율적인 네트워크 생성 및 검색 프로토콜을 제안한다. 이것은 동일 네트워크 식별자를 통한 그룹화로 전체 논리 노드 수를 감소시킴으로써 물리적인 네트워크의 라우팅에 근접해 가도록 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.79-81
• /
• 2003

본 논문에서는 인터넷상에 존재하는 네트워크의 특화된 주소인 지정된 URL로 Address Mapping기법을 이용하여 Peer 상호간의 파일공유 및 검색이 가능한 Peer-to-Peer프로그램을 구현하여 보았으며, 이를 응용한 하나의 제안으로써 원격지 상에 존재하는 내 컴퓨터의 저장드라이브를 같은 방법의 URL ID로 제어하여 Server운영체제 없이 개인용 PC를 자료공유용 Server로 활용할 수 있는 방법을 구현하였다. 따라서 기존의 P2P프로그램의 기본기능과 비교하여 Web Blower상에서 원격지 개인 PC의 자료실을 손쉽게 운영할 수 있는 Web Service가 가능하도록 설계하였고, 인터넷 사용자가 손쉽게 파일 검색 및 공유, 저장, 원격제어가 가능하도록 UI에 초점을 맞추어 시스템을 구현하였다.