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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1314-1316
• /
• 2009

최근 모바일 단말의 사용과 그에 관련된 제품의 개발이 급증하고 있는 관계로 이와 관련된 많은 Peer-to-Peer (P2P) 연구들이 진행 중이다. 특히, Mobile Ad-Hoc 네트워킹 환경에서의 P2P 방식에 대한 연구 또한 활발히 진행되고 있다. 하지만, Flooding 방식의 메시지 전송은, 파일 탐색 시 Query 메시지 가 기하급수 적으로 증가할 수 있다. 이러한 메시지 전송은 센서 네트워크에서는 전력의 급격한 소모를 가져와 네트워크의 유지를 할 수 없게 하는 등의 오버헤드를 발생시킨다. 본 논문에서는 이러한 P2P 파일 검색에서의 메시지 전송수를 줄이기 위해 Mobile Ad-Hoc Network 환경에서 Peer를 Parent Peer(PPR)와 Child Peer(CPR)로 구분화하여 그룹화를 시키고 그룹을 Peer로 둔 P2P 네트워크를 구성하였다. 또한, 그룹 안에서 발생하는 CPR들의 가입과 탈퇴를 관리하여 오버헤드 발생을 줄이는 방법을 제안한다.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.251-261
• /
• 2014

In the typical P2P VOD system, it is very important to develop the fast and efficient peer searching scheme since the peers frequently join and leave to/from P2P system. This paper proposes a new peer searching scheme for P2P VOD system based on DHT network environment. The proposed scheme constructs DHT network by managing the peers having close playback starting times and close network locations into a peer all together. The peer information is mapped onto DHT nodes by hashing the key values each of which consists of the starting time and network location of the peer. From the simulation results, the number of messages required to search the partner peers are decreased, and the number of buffer maps exchanging among the peers are also decreased. The proposed scheme can reduce the average network distances among the partner peers. As a result, the proposed scheme makes routing more efficient and it saves the network resources by decreasing communication traffic overhead.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.145-148
• /
• 2001

For reducing network traffic between long distance network or WAN, we supplement the Peer-to-Peer technology to HTTP. The large file transmition have the biggest traffic on HTTP. If downloading a large size file from a near computer not from the original location, we will get it speedier. For this, we propose a extened HTTP, named HTTP3. In this paper, we describe the HTTP3, the HTTP3 agent to support this protocol., and its security.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.3
• /
• pp.443-450
• /
• 2007

We overview the current distribution automation system in Korea and point out the limitations of the distribution services which can be provided by the current system. In this paper we propose a new distribution system architecture which is based on the peer-to-peer communication model. In this decentralized architecture the intelligent FRTUS can initiate data transmission without any interruption of a central server, and can exchange data with other FRTUS as peers. In order to support the peer-based distribution system, we specify the requirements for new communication network and suggest a way of improving the current distribution network where we adapt an intelligent module for protection and restoration, called MASX, and utilize the open communication network protocols. We also show how the new architecture can enhance major distribution services such as protection, automatic restoration, and equipment management.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.446-459
• /
• 2016

In this paper, we propose virtual direction multicast (VDM) for video multicast applications on peer-to-peer overlay networks. It locates the end hosts relative to each other based on a virtualized orientation scheme using real-time measurements. It builds multicast tree by connecting the nodes, which are estimated to be in the same virtual direction. By using the concept of directionality, we target to use minimal resources in the underlying network while satisfying users' quality expectations. We compare VDM against host multicast tree protocol.We simulated the protocol in a network simulator and implemented in PlanetLab. Results both from simulation and PlanetLab implementation show that our proposed technique exhibits good performance in terms of defined metrics.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.29-37
• /
• 2013

Multiplayer games typically organized based on a client-server(CS) or peer-to-peer(PP) architecture. The CS architecture is not scalable with the number of players due to a large bandwidth requirement at the server. The PP architecture, on the other hand, introduces significant overhead for the players, as each player needs to check the consistency between its local state and the state of all other players. We then propose a method that combines the merits of CS and PP. In this method, players exchange updates with lower priority in a peer-to-peer manner but communicate directly with a central server for the other updates. As a result, the proposed method has a lower network bandwidth requirement than the server of a CS architecture and the server bandwidth bottleneck is removed. For another important issue about multiplayer games, this method always maintains state consistency among players correctly. The performance of this method is evaluated through extensive simulation experiments and analysis.

• Journal of Computing Science and Engineering
• /
• v.5 no.1
• /
• pp.19-31
• /
• 2011

In this paper, we propose two new routing schemes for double-layered peer-to-peer systems; a shorter-lower mobility routing scheme and a reverse path routing scheme. The shorter-lower mobility routing scheme first chooses shortest routing paths among possible routing paths and selects the path associated with the relay peer who has lower mobility to improve the reliability of the system. The reverse path routing scheme carries out unicasting (instead of multicasting) based on the reverse path information that can be obtained during the initial file search to further reduce network traffic. The experimental results showed that a double-layered peer-topeer system with the proposed hybrid scheme improved the reliability of the system about 1.5% over the hop count scheme and reduced network traffic by about 0.5% compared to the hop count scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1653-1670
• /
• 2022

The fear that location privacy may be compromised greatly hinders the development of location-based service. Accordingly, some schemes based on the distributed architecture in peer-to-peer network for location privacy protection are proposed. Most of them assume that mobile terminals are mutually trusted, but this does not conform to realistic scenes, and they cannot make requirements for the level of location privacy protection. Therefore, this paper proposes a scheme for location attribute-based security authentication and private sharing data group, so that they trust each other in peer-to-peer network and the trusted but curious mobile terminal cannot access the initiator's query request. A new identifier is designed to allow mobile terminals to customize the protection strength. In addition, the caching mechanism is introduced considering the cache capacity, and a cache replacement policy based on deep reinforcement learning is proposed to reduce communications with location-based service server for achieving location privacy protection. Experiments show the effectiveness and efficiency of the proposed scheme.

• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.173-178
• /
• 2013

To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like network with improved peer features to better meet the mobility requirement of ad-hoc networks. The proposed system introduces a novel caching optimization technique and enhanced ultrapeer selection scheme to make communication more efficient between peers and ultrapeers. The paper also describes an enhanced query mechanism for efficient searching by applying multiple walker random walks with a jump and replication technique. According to the simulation results, the proposed system yields better performance than Gnutella, XL-Gnutella, and random walk in terms of the query success rate, query response time, network load, and overhead.