• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.59-79
• /
• 2007

P2P (Peer to Peer) techniques have been well applied to file sharing due to its cost-effectiveness and convenience. Dynamic network evolution is another good thing for P2P according to addition and deletion of nodes and change of files a node has. Our research proposes a P2P-based KMS (Knowledge Management System). Knowledge of enterprises spreads all over sub-organizations like oversea factories and sales departments and is changed in dynamic manner. P2P techniques are, therefore well matched with knowledge management domain. In order to increase search efficiency, we introduce social network theory into P2P-based KMS. Social network technique makes the most similar nodes (in KMS domain, nodes which has the most similar knowledge) its own neighbors, which makes eventually search efficiency increase. We developed our prototype system P2P-SN-KMS and evaluated by simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.139-145
• /
• 2009

Recently P2P (Peer-to-Peer) networks and applications have been expanded to various field. However, because the construction of P2P network did not influence a underlying network topology or property, it may be inefficient. Especially, this inefficiency is more serious in MANET because MANET has narrow bandwidth and energy constraint. When we use a proactive routing protocol in MANET, we can know hop counts between two nodes. And, we can construct a P2P overlay network using this hop count information. However, In case of using hop count only, we can avoid a interference path selection problem and a zig-zag problem. We propose a method of improving P2P contents distribution using virtual positions. We calculate virtual positions from hop counts using the trigonometry. This method solves a interference path selection problem and a zig-zag problem. This method also allows a P2P network to influence underlying network topology. We adopt this method to a network which uses a virtual geographic routing, a proactive routing protocol, or a reactive routing protocol. We show that our proposed methods improve P2P contents distribution performance over MANET through a simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2143-2159
• /
• 2011

The hybrid architecture of content delivery networks (CDN) and peer-to-peer overlay networks (P2P) is a promising technology enables effective real-time streaming services. It complements the advantages of quality control and reliability in a CDN, and the scalability of a P2P system. With real-time streaming services, however, high connection setup and media delivery latency are becoming the critical issues in deploying the CDN-P2P system. These issues result from biased peer selection without location awareness or content awareness, and can lead to significant service disruption. To reduce service disruption latency, we propose a group-based CDN-P2P hybrid architecture (iCDN-P2P) with a location/content-aware selection of peers. Specifically, a SuperPeer network makes a location-aware peer selection by employing a content addressable network (CAN) to distribute channel information. It also manages peers with content awareness, forming a group of peers with the same channel as the sub-overlay. Through a performance evaluation, we show that the proposed architecture outperforms the original CDN-P2P hybrid architecture in terms of connection setup delay and media delivery time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1458-1464
• /
• 2005

A P2P is a method that can share and exchange on digital resources through a direct connection on personnel without a central server. In this paper, Although the P2P application that uses our proposed framework should obtain one or more IP addresses of the neighbor peers manually, after instantiate, the application can do its job while maintaining connection to the network continuously and automatically. To evaluate our proposed scheme, we measured and analyzed the time for a peer to reconnect to the network when the mediating peer fails and the network isolation occurs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.567-574
• /
• 2013

Recently, many researches on P2P overlay network-based multimedia streaming services have been actively performed because of their high scalability and cost-efficiency advantages. However, P2P overlay networks also have the shortcoming of generating higher traffic owing to their unicast-based one-to-many multimedia deliveries. In order to reduce the traffic generated by the P2P streaming overlay network, we propose an ISP and locality-based parent node discovery method and check its feasibility through an implementation of a prototype streaming system. The measurement of RTTs and hop counts for random nodes having different ISPs and localities shows the proposed method to be able to shorten about 32% RTTs and about 17% Hop counts.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.325-332
• /
• 2004

For a P2P network, the contents distribution is a very important service because the contents provider is not fixed. And in the P2P media streaming, a request peer replays and saves media data simultaneously, and after streaming it acts as a new source peer providing media files to other peers. Therefore streaming and file saying operations should be simultaneously carried out in order to distribute contents through the P2P network. In this paper, a P2P multi-source media streaming system which can replay the contents data during downloading is proposed and implemented. The system reduces the user response time and the number of simultaneous user increases more than two times. Moreover, transmitting a part of media file makes fast distribution and diffusion of contents possible.

• 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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.116-119
• /
• 2009

In this paper, a P2P streaming system for community TV service which requires realtime interactions was designed and implemented. The proposed system constructs a short delay tree-based P2P network in order to effectively support various community TV services within end-to-end delay bounds. Because a community service based on conversation requires a short delay. The P2P network of this paper was constructed by using an algorithm which utilizes locality and delay information. The implemented P2P streaming system is composed of a Web server and a application, each of which was implemented using Asp.Net and C#.Net respectively.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.307-310
• /
• 2011

IPTV의 스트리밍 서비스를 위해 P2P를 이용하는 방법이 활발하게 연구되어지고 있다. 이 논문에서는 topology를 최적화하는 방안으로 P2P에서 각 peer 간에 연결 및 전송 정보를 이용하는 방법을 제안한다. 제안하는 방법은 mesh-network에서 각 peer에 연결된 link의 수를 이용하여 업로드 대역폭을 추정하는 알고리즘을 기반으로 한다. 이 방법은 자원의 관리를 위해 업로드 대역폭을 판단하기 위한 메시지 과부하를 효과적으로 줄여주지만 스트리밍에서 주어진 연산만을 수행할 경우 업로드 대역폭과 무관한 형태로 network topology가 잘못 구성될 가능성을 가지고 있다. 본 논문에서는 기존 연구에서 부족했던 부분들을 정리하고 극복할 수 있는 각각의 알고리즘들과 적용했을 시에 예상되는 결과를 제시한다.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1706-1715
• /
• 2008

In a super-peer based P2P network, the network is clustered and each cluster is managed by a special peer, which is called a super-peer. A Super-peer has information of all the peers in its cluster. This type of clustered P2P model is known to have efficient information search and less traffic load than unclustered P2P model. In this paper, we compute the message traffic cost incurred by peers' query, join and update actions within a cluster as well as between the clusters. With these values, we estimate the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.