• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.157-176
• /
• 2011

An interest-based P2P constructs the peer connections based on similarities for efficient search of resources. A clustering technique using peer similarities as data is an effective approach to group the most relevant peers. However, the separation of groups produced from clustering lowers the scalability of a P2P network. Moreover, the interest-based approach is only concerned with user-level grouping where topology-awareness on the physical network is not considered. This paper proposes an efficient scalable search for the interest-based P2P system. A scalable multi-ring (SMR) based on fuzzy clustering handles the grouping of relevant peers and the proposed scalable search utilizes the SMR for scalability of peer queries. In forming the multi-ring, a minimized route function is used to determine the shortest route to connect peers on the physical network. Performance evaluation showed that the SMR acquired an accurate peer grouping and improved the connectivity rate of the P2P network. Also, the proposed scalable search was efficient in finding more replicated files throughout the peer network compared to other traditional P2P approaches.

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

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.85-87
• /
• 2004

유무선 인터넷 기술의 발전은 인터넷을 통한 개인 정보의 효율적인 공유 및 교환을 가능하게 하였다. 최근 이러한 분산 정보의 공유를 위한 네트워킹 기술로 P2P(Peer-to-Peer)가 많은 주목을 받고 있다. 현재 국내외의 많은 대학 및 기관에서 P2P에 관한 연구가 활발히 진행 중 이다. 하지만, 대부분의 P2P 시스템들은 파일공유 위주의 서비스를 제공하며 SETI@HOME을 필두로 한 일부 @HOME 프로젝트들만이 자원 공유 서비스를 제공하고 있다. 그러나 기존의 자원공유 P2P 서비스들은 특정한 목적을 위해 구성됨으로써 자원을 제공하는 일반 사용자는 단순히 자원을 제공할 뿐 그 이상의 역할을 수행할 수가 없다. 이에 본 논문에서는 P2P 시스템에 참여한 모든 사용자가 P2P의 자원 네트워크를 사용할 수 있도록 멀티 에이전트 기반의 자원 공유 P2P 시스템을 제안한다. 일반 사용자는 서비스 생성 프레임워크를 사용하여 자신에게 필요한 테스크 에이전트를 생성할 수 있으며, 스케줄러 및 분배 에이전트, 테스크 에이전트에 의해 수행되어진다. 또한 본 시스템은 group 및 peer의 관리를 위해 특성 학습 에이전트(Specific Learning Agent)의 학습기능을 사용함으로써 P2P가 가지는 불안전한 환경 및 신뢰성 문제를 해결하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.4
• /
• pp.103-109
• /
• 2008

Many Internet application provide the PKI(public key infrastructure)-based service to provide authentication and message integrity. Several researchers proposed PKI-based p2p network framework. However, in the real world, the use of PKI is not suitable for peer to peer network, because the peer-to-peer network is an open and dynamic network. Moreover, currently there is no nation-to-nation interoperable certificate. In this paper, we designed reliable p2p file sharing application without public key infrastructure. To do this we propose reliable public key distribution mechanism to distribute public key safely without PKI infrastructure for two-tier super-peer architecture. In our system, each peer generates and distributes its public/private key pairs, and the public key is securely distributed without PKI. The proposed mechanism is safe against MITM attack. This mechanism can be applied various P2P applications such as file sharing, IPTV, distributed resource sharing and so on

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.61-68
• /
• 2010

As the mobile technology advances, file searching among the mobile device users becomes more important. In this paper, we propose the uniform grid, greedy, and MIS P2P systems that have double-layered topology to search files efficiently for mobile ad-hoc networks. In these systems, peers are classified into two groups, super-peers and sub-peers, and each super-peer manages its neighboring sub-peers. In the proposed systems, each super-peer maintains the appropriate information of its sub-peers so that when a peer requests a file, the request is sent to its super-peers and then to neighboring super-peers. Hence the proposed systems could avoid multi-broadcasting and reduce network overheads. The experimental results show that the proposed systems outperform a single-layered P2P system in terms of the average number of messages to find target files. Especially the MISsystem improves by reducing the average number of messages by 48.9% while maintaining the same search accuracy.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1961-1962
• /
• 2008

Hybrid Peer-to-Peer structure is sharing resource in each peer, but various resource that is with go peer indexing and segment that search from attained in server who function is solidified that is not attained in peer itself be. Basis algorithm was based on Ethernet protocol and administration of each peer enabled in center server and peer does as can confirm breakdown existence and nonexistence through communication with center server and the internet through this directly expensive test expense and a lot of test times of existing test method of access method necessary problem effectively improve.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1732-1750
• /
• 2016

Recently, Peer-to-Peer (P2P) live streaming assisted by the cloud computing has attracted considerable attention to improve the reliability of the P2P such as the resilience to peer churn and the shortage of upload capacity. The cost of cloud-assistance is comprised of the number of requests issued to the cloud and the amount of data fetched from the cloud. In this paper, we propose three techniques to reduce the cost of such a cloud-assistance.More concretely, in the proposed method, 1) each peer which lost its parent in the overlay can find a new parent by referring to the information registered in the cloud, 2) several peers which proactively fetch chunks from the cloud are dynamically invested, and 3) the number of requests issued to the cloud is reduced by allowing peers to fetch a collection of chunks using a single request. The performance of the proposed method is evaluated by simulation. The simulation results indicate that it reduces the cost of conventional scheme by 46% while guaranteeing the quality of live streaming service.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1955-1964
• /
• 2011

With fast deployment of high-speed networks and various online services, the demand for massive content distribution is also growing fast. An approach that is increasingly visible in communication research community and in industry domain is peer-to-peer (P2P) networks. The P2P swarming technique enables a content distribution system to achieve higher throughput, avoid server or network overload, and be more resilient to failure and traffic fluctuation. Moreover, as a P2P-based architecture pushed the computing and bandwidth cost toward the network edge, it allows scalability to support a large number of subscribers on a global scale, while imposing little demand for equipment on the content providers. However, the P2P swarming burdens message exchange overheads on the system. In this paper, we propose a new protocol which provides confidentiality, authentication, integrity, and access control to P2P swarming. We implemented a prototype of our protocol on Android smart phone platform. We believe our approach can be straightforwardly adapted to existing commercial P2P content distribution systems with modest modifications to current implementations.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.203-206
• /
• 2001

현재까지 전자상거래는 클리어언트-서버 중심의 상거래가 대다수를 이루고 있다. 상품을 검색하기 위해서도 전자상거래 사이트에 가입하여 검색해야만 한다. 하지만 P2P(Peer To Peer)는 이러한 서버와 클라이언트 중심의 구조를 탈피하여 사용자들간의 직접적인 정보 교환을 가능하게 함으로써 서버확보라는 비용추가 및 서버에 집중되는 네트웍 문제를 해결하고, 고객과 고객 또는 고객과 제공자들이 직접 거래를 할 수 있다. 본 논문에서는 현재 진행되고 있는 P2P 비즈니스 모델을 분석하였다.

• Journal of Digital Convergence
• /
• v.20 no.4
• /
• pp.185-192
• /
• 2022

This study investigates the effect of the semi-supervised learning(SSL) method on predicting default risk of peer-to-peer(P2P) loans. Despite its proven performance, the supervised learning(SL) method requires labeled data, which may require a lot of effort and resources to collect. With the rapid growth of P2P platforms, the number of loans issued annually that have no clear final resolution is continuously increasing leading to abundance in unlabeled data. The research data of P2P loans used in this study were collected on the LendingClub platform. This is why an SSL model is needed to predict the default risk by using not only information from labeled loans(fully paid or defaulted) but also information from unlabeled loans. The results showed that in terms of default risk prediction and despite the use of a small number of labeled data, the SSL method achieved a much better default risk prediction performance than the SL method trained using a much larger set of labeled data.