• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.422-429
• /
• 2008

Mobile peer-to-peer (P2P) systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content addressable networks. Along this line of research, we propose a new peer-to-peer file sharing protocol suited to mobile ad hoc networks (MANET). The main ingredients of our protocol are network coding and mobility assisted data propagation, i.e., single-hop communication. We argue that network coding in combination with single-hop communication allows P2P file sharing systems in MANET to operate in a more efficient manner and helps the systems to deal with typical MANET issues such as dynamic topology and intermittent connectivity as well as various other issues that have been disregarded in previous MANET P2P researches such as addressing, node/user density, non-cooperativeness, and unreliable channel. Via simulation, we show that our P2P protocol based on network coding and single-hop communication allows shorter file downloading delays compared to an existing MANET P2P protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.133-151
• /
• 2019

In order to achieve faster content distribution speed and stronger fault tolerance, a P2P peer can connect to multiple peers in parallel and receive chunks of the data simultaneously. A critical issue in this environment is selecting a set of nodes participating in swarming sessions. Previous related researches only focus on performance metrics, such as downloading time or the round-trip time, but in this paper, we consider a new performance metric which is closely related to the network and propose a peer selection algorithm that produces the set of peers generating optimal worst link stress. We prove that the optimal algorithm is practicable and has the advantages with the experiments on PlanetLab. The algorithm optimizes the congestion level of the bottleneck link. It means the algorithm can maximize the affordable throughput. Second, the network load is well balanced. A balanced network improves the utilization of resources and leads to the fast content distribution. We also notice that if every client follows our algorithm in selecting peers, the probability is high that all sessions could benefit. We expect that the algorithm in this paper can be used complementary to existing methods to derive new and valuable insights in peer-to-peer networking.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.873-886
• /
• 2003

Lookup Is one of important factors for network traffic on peer-to-peer network. Especially, large amount of network resources are required for lookup process in p2p file sharing system that clients use the dynamic If and they import to p2p network in random. In this paper, we employ efficient lookup mechanism which searches lookup with the combined information of ISP key values and the extracted key values from SHA-1 hashing function for shared contents id. The proposed mechanism efficiently searches files on the network because the mechanism processes P2P lookup with consideration the routing information of ISP. We suggest the adapted simulation environment based upon the famous file sharing system of emule P2P and experiment the proposed system.

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

In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic and P2P network partition in mobile ad hoc network (MANET). We propose an approach to construct an efficient unstructured P2P overlay over MANET using underlying cluster-based routing (CBRP). One of the peers in the P2P network is used as a root-peer to connect all peers. Each peer maintains connection with physically closer peers such that it can reach the root-peer. The peer constructs a minimum-spanning tree consisting of itself, its directly connected neighbor peers and 2-hop away neighbor peers to remove far away redundant links and to build an overlay closer to the physical network. Due to on-demand nature of inter-cluster routing of CBRP, the positioning algorithm for MANET is used to retrieve the file by a peer from the source peer via shorter path in the physical network. We can show by simulation that our approach performs better in comparison with the existing approach.

• International journal of advanced smart convergence
• /
• v.4 no.2
• /
• pp.38-45
• /
• 2015

Peer-to-Peer(P2P) systems are generally classified into two categories; hybrid and pure P2P. Hybrid systems have a single central index server keeping the details of shared information, so that undesirable effects such as heavy load on that server and lack of fault-tolerance can be caused. Pure P2P causes the other problems such as message flooding and scalability although it shows high degree of fault-tolerance. Recently, mobile agent-based distributed computing has been receiving wide attention for its potential to support disconnected operations, high asynchrony, and thus saving network bandwidth. In this paper, a new scheme of peer coordination is proposed for a decentralized P2P network with self-organizing structure. We deployed mobile agents for incorporating the advantages of usage of mobile agents into our P2P network. Proposed P2P network has both advantages of hybrid and pure P2P. The problems of heavy load on the server and lack of fault-tolerance are improved by using multiple special peers called super-peers. And the problems of pure P2P can be reduced by using mobile agents.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.932-935
• /
• 2007

모바일 기기 사용이 급증함에 따라 모바일환경에서 이루어지는 P2P방식 연구가 활발히 진행되고 있다. 본 논문에서는 기존의 모바일환경에서의 P2P방식이 지닌 peer들 사이의 multi-broadcasting 방식의 문제점을 보완하고, 새로운 routing table을 구축하기 위해 peer들을 2개의 계층으로 구분하였다. 즉, peer들을 super peer들과 각 super peer에 의해 관리되는 sub peer들로 구분하였다. 파일의 탐색과 전송은 super peer들이 관리하므로, 기존의 불필요한 multi-broadcasting 방식을 피할 수 있다. 본 논문에서는 분산 네트워크를 위한 peer의 계층화 작업을 설계하였다. MIS(Maximal Independent Set)알고리즘을 이용하여 peer들의 계층화 작업을 외부의 도움 없이 peer들간의 통신으로 할 수 있게 만들었다. 이처럼 peer들을 super peer와 sub peer로 구분하면 불필요한 broadcasting을 피할 수 있어 시스템 성능이 향상되며, 이를 실험을 통하여 증명하였다.

• Journal of the Korea Society for Simulation
• /
• v.15 no.4
• /
• pp.97-105
• /
• 2006

Popular content stored within the Internet may be convenient to download via modern 3G connections, but costly due to a fee charged by telecommunication providers on the basis of the amount of data transferred. This paper presents a network in which several mobile devices, called the peers, cooperate to download their assigned portion of the content using a 3G connection in order to reduce the overall cost. Then, the peers exchange their assigned portion of the content with other peers via a wireless ad hoc network and the peers reconstruct the whole content using the exchanged portion. This paper focuses on the per-peer based distribution method, and presents the performance comparison with a similar method, called the per-packet distribution method. Both methods are designed to reduce packet collisions while content is exchanged. The simulation result indicates that the per-peer based method outperforms the per-packet based method, and approximately 90% of the telecommunication cost is saved with as few as 10 peers.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.389-400
• /
• 2008

As the wireless network technologies and the capability of the mobile terminals are evolving, advanced peer to peer applications for mobile users are attracting interests. In this paper, we propose the mobile P2P communication platform(MPCP) which provides transparency to the wireless network technologies and solutions to the limited resources of the mobile terminals. MPCP classifies the connection into two levels: a virtual channel and a session. A virtual channel is the network layer connection between the terminals whereas a session is the application layer connection. MPCP classifies the sessions into four types and applies different scheduling priority and data processing policies such as segmentation and reassembly. It selects proper wireless network technologies depending on the distance between the communication endpoints. To acquire dynamically changed access address, we harness the Session Initiation Protocol. We implemented MPCP on embedded Linux simulator and utilized the implementation in mobile P2P service development. For the quantitative analysis, we compared the performance of MPCP with that of ftp. Regardless of the number of simultaneous sessions, MPCP maintains the relative performance.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.2
• /
• pp.62-64
• /
• 2006

The emerging peer-to-peer (P2P) model has recently gained a significant attention due to its high potential of sharing various resources among networked users. Super-peer based unstructured P2P systems have been found very effective by dividing the peers into two layers, super-peer and ordinary-peer Super-peers deal with all queries instead of ordinary-peers. The existing P2P systems assume all super-peers have equal responsibility and capabilities even if all super-peers have relative advantages and disadvantages. In this paper, we suggest the ISP2P (Intelligent Super-peer based P2P) which allows to select the best super peer to ordinary-peers. We classify super peers according as the capacity of an ordinary-peer a super-peer. We show that these considerations could improve the performance of the response time and Provide higher quality results to all peers in the network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.588-591
• /
• 2002

P2P(Peer-to-Peer) can compose free network and take away center server function or problem about authentication is risen between each User because is opening network that can participate between each User weakening. We desire to authenticate request about service to user who is admited between each user to limit connection. Wish to admit Kerberos authentication mechanism to mechanism that can do information sharing safety in P2P environment to solve this in this treatise and design authentication mechanism.