• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.183-188
• /
• 2007

Peer-to-Peer (P2P) overlay networks have drawn much research interest in the past few years because they provide a good substrate for large-scale applications in the Internet. In this paper, we introduce the use of anycast, a new "one-to-one-of-many" communication method in the Internet, to solve the following common problems of P2P overlay networks: load-balancing, topology-awareness, system partitioning, and multi-overlay interconnection. We also give an analysis of the features and limitations of the recently deployed anycast infrastructures in the Internet for supporting P2P overlay networks.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• 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 information and communication convergence engineering
• /
• v.9 no.4
• /
• pp.396-400
• /
• 2011

P2P(peer to Peer) network is a distributed network architecture composed of participants that make a portion of their resources directly available to other network participants, without the need for a central server. Currently, convergence network industry using wired and mobile are grows rapidly. So P2P protocols will be used between mobile and wired network. But current P2P protocols are focused on the wired networks only and there are no simulators for performance analysis of mobile P2P. In this paper, we design a P2P simulation system for performance analysis of P2P protocols in mobile, wired and convergence networks. It is constructed by a well-known mobile network simulator and wired based P2P protocol simulator. Finally we have implemented a smart TV test-bed using our P2P test-bed for convergence networks.

• The Journal of Society for e-Business Studies
• /
• v.23 no.3
• /
• pp.207-224
• /
• 2018

In this article, an empirical study was conducted by using public dataset from Lending Club Corporation, the largest online peer-to-peer (P2P) lending in the world. We explore significant predictor variables related to P2P lending default that housing situation, length of employment, average current balance, debt-to-income ratio, loan amount, loan purpose, interest rate, public records, number of finance trades, total credit/credit limit, number of delinquent accounts, number of mortgage accounts, and number of bank card accounts are significant factors to loan funded successful on Lending Club platform. We developed online P2P lending default prediction models using discriminant analysis, logistic regression, neural networks, and decision trees (i.e., CART and C5.0) in order to predict P2P loan default. To verify the feasibility and effectiveness of P2P lending default prediction models, borrower loan data and credit data used in this study. Empirical results indicated that neural networks outperforms other classifiers such as discriminant analysis, logistic regression, CART, and C5.0. Neural networks always outperforms other classifiers in P2P loan default prediction.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.697-699
• /
• 2004

최근 MANET(Mobile Ad-hoc Networks)에서의 P2P 응용을 이용한 서비스 개발이 활발히 진행 중이다. 이와 함께 에드혹 환경에서의 적합한 P2P 모델에 관한 연구로 기존 P2P 모델인 Gnutella, DHT등을 에드혹에 적용한 연구 역시 활발히 이루어지고 있다. 본 논문에서는 on-demand 방식의 에드혹 라우팅 프로토콜인 AODV(Ad-hoc On-Demand Distance Vector)상에서, 대표적인 P2P 응용인 Gnutella의 동작 과정을 통해 P2P 응용이 갖는 문제점을 분석하고, P2P 응용의 검색과정에서 발생하는 오버헤드를 줄이기 위한 방안을 제안한다. 그리고 위의 연구 결과를 바탕으로 현재 IPv6 AODV상에서 MANET을 위한 응용인 DiPP(Fully Distributed Peer-to-Peer)시스템을 구현한다. DiPP 시스템은 MANET상에서의 메신저와 파일공유를 위한 기능을 위해 동작한다.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.6-12
• /
• 2006

Peer-to-Peer (P2P) networks are attracting considerable research interest because of their scalability and high performance relative to cost. One of the important services on a P2P network is the streaming service. However, because each node in the P2P network is autonomous, it is difficult to provide a stable streaming service on the network. Therefore, for a stable streaming service on the P2P network, a fault-tolerant scheme must be provided. In this paper, we propose two new node selection schemes, Playback Node First (PNF) and Playback Node first with Prefetching (PNF-P) that can be used for a service migration-based fault-tolerant streaming service. The proposed schemes exploit the fact that the failure probability of a node currently being served is lower than that of a node not being served. Simulation results show that the proposed schemes outperform traditional node selection schemes.

• 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 Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.437-440
• /
• 2003

본 논문은 P2P 네트워크에서 어플리케이션 레벨의 영속성있는 저장 시스템에 대해서 살펴본다. 인터넷 클라이언트의 성능 향상과 인터넷 접속 기술의 발달로 Peer-to-Peer (P2P)라는 키워드로 대표되는 다양한 파일 저장, 검색, 공유 어플리케이션이 소개되었다. 그러나, 기존의 서버 기반의 분산 저장 방식은 xDSL 기반의 가변 IP 기반의 현재 인터넷 환경에서 불안정한 성능을 보이고, 파일을 저장하고 나서 검색 발견의 확률이 떨어지는 문제점을 가진다. 본 논문에서는 시스템의 가용성(Availability)을 높이기 위한 파일의 분할 저장, 중복 저장 방법을 소개하고 이의 효과를 분석해 보인다.