• 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.6 no.7
• /
• pp.1120-1125
• /
• 2002

According as progress by information society, computer network use and enlargement of scale are accelerated more. Also, with good physician increase of information that is exchanged through computer network, security of network is embossed to controversial point that is new. Because P2P as that remove or weakens center server function is open network that can participate between each user, problem about authentication between each users is risen. If certain user in network i3 in open environment, this user must authenticate request about service to user who is admitted between each user to limit connection. This treatise proposed method to keep security in P2P environment to solve this and designed certification mechanism that quote Kerberos certification mechanism to mechanism that can share information safety in P2P environment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.83-91
• /
• 2022

This paper proposes a scalable hybrid P2P(peer-to-peer) cloud architecture for MMOGs(massively multiplayer online games) which includes load management schemes for each region. A game world is divided into several game regions and each game region is serviced by at least one peer(player) in this MMOG cloud environment. The load must be managed regionally to support smooth interactions among them even in the presence of a high concentration of players in a specific region. In the proposed architecture where an efficient and effective provisioning of resources is realized, it is suitable for players to interact with cloud servers effectively and it avoids bottlenecks of the current client-server MMOG architecture. This architecture also relieves a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the players. Simulation results show that the proposed hybrid P2P cloud architecture can reduce the considerable bandwidth at the server compared to the client server architecture as the available resources grow with the number of players in crowding or hotspots.

• Journal of Broadcast Engineering
• /
• v.24 no.2
• /
• pp.251-263
• /
• 2019

Recently the huge demand for Internet media streaming has dramatically increased the cost of the CDN (Content Delivery Network) and the need for a means to reduce it is increasing day by day. In this situation, a P2P-assisted DASH technology has recently emerged, which uses P2P (Peer-to-Peer) communications based on WebRTC (Web Real-Time Communication) standards to reduce the CDN cost. This paper proposes an algorithm that can significantly improve CDN cost savings in this technology by selecting peers based on the transport history. Also we implemented this algorithm in an experimental system and, after setting experimental conditions that emulate the actual mobile network environment, we measured the performance of the experimental system. As a result, we demonstrated that the proposed algorithm can achieve higher CDN cost savings compared to the conventional algorithm where peers are selected at random.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.568-570
• /
• 2013

NFC represents the 2nd generation of the proximity contact-less technology, which beyond the RFID, supports peer-to-peer communication, and enables consumer access to aggregated services, anytime, anywhere, with any type of consumer stationary and mobile devices. NFC is a short range device wireless technology designed to exchange data, initiate connections with other wireless networks and act as a secured smart key for access to services such as cashless payment, ticketing, on-line entertainment and access control. In this paper, the NFC services for social networking applications are studied, and the signal flow of SNS application based on NFC P2P for smart devices and server model is proposed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.716-719
• /
• 2003

P2P (Peer to Peer) is part that is discussed much in the latest Internet and is interested. P2P changes the structure of Client-Server into Information sharing between client that is the structure of p2p. But perfect P2P system has many problems awaiting solution. In this treatise we can realize network communication to compose one virtual server and one virtual client which is intergrated several client and distributed computer that decentralize network traffic into the traffic of several pc by sharing resource and cpu between client. Our nam purpose is not real P2P system but realization, organization of the P2P internet system which is composed by distributed computing and network load balancing in P2P internet system environment.

• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.94-104
• /
• 2020

Currently media consumption over fixed/mobile Internet is mostly conducted by adaptive media streaming technology such as DASH (Dynamic Adaptive Streaming over HTTP), which is an ISO/IEC MPEG (Moving Picture Experts Group) standard, or some other technologies similar to DASH. All these heavily depend on the HTTP caches that ISPs (Internet Service Providers) are obliged to provide sufficiently to make sure fast enough Web services. As a result, as the number of media streaming users increases, ISPs' burden for HTTP cache has been greatly increased rather than CDN (Content Delivery Network) providers' server burden. Hence ISPs charge traffic cost to CDN providers to compensate for the increased cost of HTTP caches. Recently in order to reduce the traffic cost of CDN providers, P2P (Peer-to-Peer)-assisted DASH system was proposed and a peer selection algorithm that maximally reduces CDN provides' traffic cost was investigated for this system. This algorithm, however, tends to concentrate the burden upon the selected peer. This paper proposes a new peer selection algorithm that distributes the burden among multiple peers while maintaining the proper reduction level of the CDN providers' cost. Through implementation of the new algorithm in a Web-based media streaming system using WebRTC (Web Real-Time Communication) standard APIs, it demonstrates its effectiveness with experimental results.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.89-99
• /
• 2005

Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1173-1176
• /
• 2005

P2P(Peer-to-Peer) 서비스는 기존의 서버/클라이언트 방식과는 달리 중앙서버를 거치지 않고 정보를 찾는 사람과 정보를 가지고 있는 사람의 PC를 직접 연결 시켜 데이터 공유 및 교환 할 수 있게 해주는 기술과 그 기술을 응용해서 만든 새로운 서비스를 말한다. P2P 서비스를 전자상거래에 적용 시 상거래 서비스 이용자들은 중앙 서버 없이 직접 통신하면서 언제, 어디서나 제약 없이 개인별 상거래나 경매가 가능한 반면 별다른 안전 장치가 없어 피해가 우려된다. 본 논문에서는 P2P기반의 e-commerce에서 디지털 컨텐츠 판매에 대한 지불에 있어 좀 더 공정한 지불 프로토콜과, 피어들에 대한 신뢰성 보장을 위해 평판인증서(reputation certificate)를 사용하여 신뢰성 있는 e-commerce 시스템을 설계하고자 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1486-1492
• /
• 2007

Searching distributed resources efficiently is very important in distributed computing environments like P2P. But distributed resource searching may have system overheads and take a lot of time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. In this paper, we design a proxy peer algorithm based on DHT(Distributed Hash Table) for efficient distributed resource searching in JXTA network environments. By containing the rendezvous information in proxy peer and searching a rendezvous peer firstly which has higher hit ratio, we can reduce the searching number and minimize system overheads.