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

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.195-198
• /
• 2008

The JXTA was made in order to solve the problem of being generated with the computer platform suggested with the P2P(Peer-to-peer) method in the distributed computing. JXTA makes a communication between the various network and the devices is connected to a network which possible. It was designed to the client having the minimum computing ability could attend in the peer-to-peer network. However, for smoothly applying JXTA in the wireless environment, there is a limit with the limited resource of the Mobile Device. By using the Relay of the JXTA based for the Mobile Device, this paper implemented the P2P service which is flexibly effective in the wireless network environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.1015-1023
• /
• 2004

In order to protect an exchanged data, it is indispensable to establish a peer-to-peer key between the two communicating nodes. Pre-distributing keys among the nodes is unrealistic in Ad-Hoc network environment because of the dynamic nature of its network topology and the equal authority of its nodes. This paper presents a peer-to-peer key establishment scheme without pre-distributing keys in Ad-Hoc networks. The proposed scheme is based on the Diffie-Hellman key exchange protocol. Main idea is to prevent the falsification of Diffe-Hellman values using some elements of a hash chain. As a result, it is as safe as the underlying hash function against a man-in-the-middle attack. Simulation results have shown that the proposed scheme dramatically reduces the number of messages, and has relatively higher scalability, as compared with the key pre-distribution based scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1216-1223
• /
• 2014

Internet traffic is rapidly increasing due to the spread of personal smart devices and the demand for multimedia contents. When designing a large ship such as cruise, network architecture is also considered which supports various IT services in a maritime environment similar to the ground environment. In this paper, we consider wireless P2P (peer-to-peer) communication for efficient multimedia content sharing and propose novel handover scheme for efficient download service. The proposed handover method shows that it can improve the download symbol rates for handover in a wireless P2P system considering the signal strength and quality of peers as well. The proposed system is expected to provide efficient contents distribution and reliable communication in the ship-area-network (SAN).

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.62-64
• /
• 2004

P2P Systems have grown dramatically in recent years. Now many P2P systems have developed and been confronted by P2P technical challenges. We should consider how to efficiently locate desired resources. In this paper we integrated the existing pure P2P and hybrid P2P model. We try to keep roles of super peer in hybrid and concurrently use pure P2P model for searching resource. In order to improve the existing search mechanism, we present contents-based classification mechanism. Proposed system have the following features. This can forward only query to best peer using RI. Second, it is self-organization. A peer can reconfigure network that it can communicate directly with based on best peer. Third, peers can cluster each other through contents-based classification.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.411-413
• /
• 2010

Now, smart phone markets are grows quickly. So it is needed research of CDN(Contents Delivery Network) technology for contents transmission in mobile networks. Especially the services of smart phone are focused on open platform model. So P2P(Peer to Peer) protocols will be used for mobile network because it 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. Current research of P2P protocols for mobile network are not activated. The reason is appropriate in the mobile P2P network simulation environment, since it is not provided. So, in this paper we design a mobile P2P simulation system for CDN based on mobile P2P.

• Journal of Korea Multimedia Society
• /
• v.12 no.5
• /
• pp.717-727
• /
• 2009

P2P (Peer-to-Peer) network depends on cooperation of peers considerably. However, some peers do not share files at all and only download files. Peers also share low quality files or unpopular files. These selfish behavior of peers is referred to 'free riding'. The free riding of peer may decrease participation of other peers or the system performance. In this paper, we propose an incentive mechanism, called IcMFS (Incentive Mechanism for File Sharing System), which provides the correct use of incentive mechanism using trust peer, computes contribution values referring behavior of peers and rewards peers. The proposed mechanism assigns bandwidth and TTL(Time-To-Live) to a peer and differentiates the use of service. A case study on simulations shows the service differentiation according to the contribution value of peer, the correct use of incentive mechanism using trust peer and the advantage by use of trust peer. To prove the stability of proposed mechanism, we also show the disadvantage that a peer receives from the incorrect use of incentive mechanism.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5013-5034
• /
• 2019

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

• 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 the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.133-139
• /
• 2009

A P2P technology in distributed computing fields is presented various methods to share resources between network connected peers. This is very efficient that a degree of resources to good use as compared with peers by using centralized network by a few servers. However peers to compose P2P system is not always online status, therefore it is difficult to support high reliability to user. In our previous work of this paper, it is contributing to reduce the loading rates to select of new resource support peer but a selection method the peers to share works to download resources is very simple that it is just selected about peer to have lowest job. In this paper, we reduced frequency offline peers by estimate based on a average value of success rates for peers.