• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.143-150
• /
• 2019

Cloud computing has recently become an attractive solution for massively multiplayer online games(MMOGs), as it lifts operators from the burden of buying and maintaining hardware. Peer-to-peer(P2P) -based solutions present several advantages, including the inherent scalability, self-repairing, and natural load distribution capabilities. We propose a hybrid architecture for MMOGs that combines technological advantages of two different paradigms, P2P and cloud computing. An efficient and effective provisioning of resources and mapping of load are mandatory to realize an architecture that scales in economical cost and quality of service to large communities of users. As the number of simultaneous players keeps growing, the hybrid architecture relieves a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the peers. For MMOGs, besides server time, bandwidth costs represent a major expense when renting on-demand resources. Simulation results show that by controlling the amount of cloud and user-provided resource, the proposed hybrid architecture can reduce the bandwidth at the server while utilizing enough bandwidth of players.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.553-555
• /
• 2001

본 논문에서는 분산 가상 환경을 기반으로 한 원격교육시스템을 제안한다. 기존에 제안되었던 대부분의 원격교육시스템 들은 클라이언트/서버 구조를 택함으로써 시스템의 확장성과 속도에 많은 단점을 가지고 있었다. 이러한 단점을 보완하고자 본 논문에서는 분산 객체 모델을 기반으로 peer-to-peer 구조를 가지는 새로운 원격교육시스템을 소개한다. DOVE(Distributed Object-oriented virtual computing environment)라는 분산 가상 환경 상에서 설계된 본 시스템은 peer-to-peer 구조를 가짐으로써 기존 시스템들의 확장성 문제를 해결했을 뿐만 아니라 DOVE의 가장 큰 장점 중에 하나인 객체 그룹(Object Group)의 개념을 도입하여 객체간에 멀티캐스트를 기반으로 한 상호작용을 가능케 함으로써 속도와 부하 문제도 해결하였다.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.586-588
• /
• 2005

P2P (Peer-to-peer) 파일 공유 시스템에서 컨텐츠의 복제는 Hot Spot의 방지와 가용성의 보장, 검색 속도의 향상을 위해 사용되고 있다. 컨텐츠의 복제본의 수(공간 효율성)와 검색 성능은 일종의 trade-off로써 이 논문에서는 가능한 검색 성능을 향상시키면서 적절한 양의 복제본의 수를 유지하는 방법인 SRoD 알고리즘을 제안한다. SRoD는 DHT 기반 파일공유시스템에서 전반적으로 간단하게 접목하여 사용할 수 있다는 장점을 가지고 있다. 이러한 특징은 P2P가 추구하는 자율성과 평등성을 보장하기 위한 것이다. 본 논문에서는 SRoD 알고리즘을 설명하고 이것의 장점과 보완해야 할 점에 대해 논하게 될 것이다.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.11-19
• /
• 2004

P2P network environments provide users with direct data transmission and sharing facilities and those environments can be classified into hybrid P2P network environments and pure P2P network environments according to the arbitration mechanism among the peers in the network. In hybrid P2P network environments, there exists a server that maintains index information for the data to be shared and network isolation does not occur because every peer always keeps connection to the server. In pure P2P network environments, however, each peer directly connects to another peer and gets services without server intervention, and so, network isolation can occur when the mediating peer fails to work. In this paper. we propose a scheme for each peer to keep connection to other peers continuously by maintaining IP addresses of its neighbor peers and connecting to the peers when the mediating peer fails to work. Although the P2P application that uses our proposed framework should obtain one or more IP addresses of the neighbor peers manually, after instantiation, 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.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.1033-1042
• /
• 2004

According to the arbitration mechanism among the peers in the network, the P2P networking environments can be classified into hybrid P2P networking environments and pure P2P networking environments. In hybrid P2P networking environments, each peer gets continual services from the servers that arc operational most of the time, and so, network isolation does not occur because every peer can always keep connection to the server. In pure P2P networking environments, however, every peer directly connects to another peer without server intervention, and so, network isolation can occur when the per mediating the connection is terminated. In this paper, we propose a scheme for each peer to keep connection information of other peers by maintaining IDs of its neighbor peers, to reconnect to another peers when the mediating peer fails to work. and, for efficiency. to balance the number of connections that should be maintained by each peer. With our mechanism, each pier in the network can continuously maintain connection to the network and get seamless services from other peers. Through the simulation, we ascer-tained that network isolation does not occur in the pure P2P network adopting our mechanism and that our mechanism distributes and balances the connections that are maintained by each peer. We also analyzed the total network traffic and the mean number of hops for the connections made by each peer according to the recommended number of connections that is established at system setup time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1955-1964
• /
• 2011

With fast deployment of high-speed networks and various online services, the demand for massive content distribution is also growing fast. An approach that is increasingly visible in communication research community and in industry domain is peer-to-peer (P2P) networks. The P2P swarming technique enables a content distribution system to achieve higher throughput, avoid server or network overload, and be more resilient to failure and traffic fluctuation. Moreover, as a P2P-based architecture pushed the computing and bandwidth cost toward the network edge, it allows scalability to support a large number of subscribers on a global scale, while imposing little demand for equipment on the content providers. However, the P2P swarming burdens message exchange overheads on the system. In this paper, we propose a new protocol which provides confidentiality, authentication, integrity, and access control to P2P swarming. We implemented a prototype of our protocol on Android smart phone platform. We believe our approach can be straightforwardly adapted to existing commercial P2P content distribution systems with modest modifications to current implementations.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.290-298
• /
• 2015

This paper suggests a multi-agent message transport architecture based on the message-oriented middleware ZeroMQ. Compared with the other middlewares such as CORBA, Ice, and Thrift, ZeroMQ receives a good score in the evaluation of performance, QoS (Quality of Service), patterns, user friendliness, and resources. The suggested message transfer architecture borrowed many basic concepts like agent platform, AMS (Agent Management System), and MTS (Message Transfer System) from FIPA (Foundation for Intelligent Physical Agents) standard multi-agent specifications, and the architecture inherited the strength of the architecture from the multi-agent framework SMAF (Smart Multi-Agent Framework). The architecture suggested in this paper is a novel peer-to-peer architecture which is not known to the ZeroMQ community. In the suggested architecture, every MTS agent uses only one ZeroMQ router socket to support peer-to-peer communication among MTS agents. The suggested architecture can support closely collaborating software areas such as intelligent robots as well as the traditional application areas of multi-agent architecture. The suggested architecture has interoperability and scalability with the ZeroMQ devices and patterns.

• International Journal of Contents
• /
• v.5 no.1
• /
• pp.21-26
• /
• 2009

Peer to Peer (P2P) utilizes the resources of an offered service without the need for a central server or preexistent server-client, making it a desirable network environment for data exchange based on direct connection between peers. Proposed by Sun Microsystems. JXTA(Juxtapose) is a typical P2P system and distributed computing model that does not require central service resources and is flexible to deal with various network configuration changes. Meanwhile. Mobile Ad-hoc NETwork(MANET) is a typical wireless network configured with mobile nodes and without an infrastructure. where a network is established by direct connection or through other peers in the propagation area. Thus, MANET maintains the latest path information by establishing paths and changing path information for communication between peers in a highly mobile wireless network. Accordingly. this article proposes the JXTAMANET method for wireless networks to enable JXTA to be applied to MANET. NS2 is used to evaluate the performance and the proposed architecture is shown to produce better results than a conventional flooding method.

• Electronics and Telecommunications Trends
• /
• v.20 no.1 s.91
• /
• pp.147-156
• /
• 2005

이동 환경에서 뿐만 아니라 향후 단말 중심의 개인화 서비스가 제공되는 유비쿼터스 환경에서는 다양한 단말 및 센서들이 존재할 것이고 이들은 네트워크 상에서 서로 상대의 위치를 인식하여 특정 장치가 가진 기능이나 서비스를 획득하기 위하여 상호 통신하거나 새로이 추가되는 장치를 자동으로 구성할 수있어야 한다. 이와 같이, 위치 기반 서비스 및 peer-to-peer 컴퓨팅을 지원하기 위해 ‘서비스 발견’은 모바일 컴퓨팅을 위한 미들웨어로서의 역할을 수행하게 될 것이다. 본 논문에서는 JINI, UPnP, Salutation, SLP2, Bluetooth SDP 등의 기술에서 제공되는 서비스 발견 프로토콜(메커니즘)을 살펴보고 이들의 특성을 비교하고자 한다.