• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.4
• /
• pp.123-130
• /
• 2018

Many massively multiplayer online games(MMOG) use client-server architectures that have enormous server-side bandwidth requirements. In this paper, we propose a region-based hybrid game architecture that combines the advantages of client-server and peer-to-peer architectures, so that only critical events changing game state are processed by the server. In this hybrid architecture, the central server divides the game into regions and assigns a player as a regional server to distribute important updates for that region. Thus, the central server sends state updates to the players through the regional servers. All players in the same region directly exchange updates without affecting game state. This division of labor greatly reduces server bandwidth significantly and enables it to serve larger number of concurrent players. Our experiments show that the region-based hybrid architecture with three-level hierarchy scales better than the client-server architecture, saving considerable bandwidth at the central server while requiring enough bandwidth of players acting as regional servers.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1688-1696
• /
• 2008

We propose a hierarchical service management method using Bloom filters for large MANETs. In this paper, a MANET is comprised of logical grid hierarchy, and each mobile node within the lowest service region multicasts the Attenuated Bloom Filter (ABF) for services itself to other nodes within the region. To advertise and discovery a service efficiently, the server node of the lowest server region sends the Summary Bloom Filter (SBF) for the ABFs to the server node of upper server region. Each upper server has the set of SBFs for lower vicinity service regions. The traffic load of the proposed method is evaluated by an analytical model, and is compared with that of two alternative advertisement solutions: complete advertisement and no advertisement. As a result, we identify that the traffic load of the proposed method is much lower than that of two alternative advertisement solutions.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.345-353
• /
• 2009

It is for sure that a stable game managing system is absolutely needed to accept simultaneous interfacing of many users for P2P on-line game system. The proposed P2P on-line game system in this paper is able to get smart and stable game managing taking care of extensive players through reorganizing numerous RS(Region Server) and mutual communications among RS's which can be avoid congestion on one region. Moreover, it is possible to synchronize for game nodes in time stamp utilizing Global Zone Buffer of Monitoring Server which leads to breakup loads. The system manages middleware layers in the so-called sub area, and it is able to execute no matter how big the game sizes are. That means, in some ways, we got everything we try to ensure such as the problems of high cost server and stabilization of message transmission. This paper welcomes to prove efficiency of the suggested system through the simulation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.38
• /
• pp.199-205
• /
• 1996

The purpose of this study, therefore, was to construct the region statistical information to present methods of the data. The results of this paper are as follows: First, the construction of region statistical data is much in need of utilizing the server of regional information center, or the database to the server of public institutions, Second, there are some difficulties to receive the region statistical data because of only depending on the main source of KOSIS provided by national units from National Statistical Office. Third, as there is another problem which is text searching system served by KOSIS, GU system should be established for the user's satisfaction served by easier accessing screen. Fourth, there should be a standard software production to suit for the accessing software of the region statistical data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.199-203
• /
• 2009

Recently, Massively Multiplayer Online Role-Playing Games (MMORPGs) has become increasingly popular, which continue to increase the number of game player. The volume of the game world also has been extended on a large scale. Existing Map-based distributed server architecture divides the game world into the rectangular regions and allocates the registered player in each region to the server responsible for that region. Players tend to concentrate in certain regions of the game world, which makes some special server overloaded. This paper proposes to change the boundary between servers to solve such a unbalanced load problem. Our proposed method first finds the overloaded server and then searches for its neighboring lightest loaded server to share with the overload evenly. Finally we implemented performance evaluation to demonstrate the efficiency of this approach.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.67-76
• /
• 2018

This paper addresses the problem of efficient processing of region monitoring queries. The centralized methods used for existing region monitoring query processing assumes that the mobile object periodically sends location-updates to the server and the server continues to update the query results. However, a large amount of location updates seriously degrade the system performance. Recently, some distributed methods have been proposed for region monitoring query processing. In the distributed methods, the server allocates to all objects i) a resident domain that is a subspace of the workspace, and ii) a number of nearby query regions. All moving objects send location updates to the server only when they leave the resident domain or cross the boundary of the query region. In order to allocate the resident domain to the moving object along with the nearby query region, we use a query index structure that is constructed by splitting the workspace recursively into equal halves. However, However, the above index structure causes unnecessary division, resulting in deterioration of system performance. In this paper, we propose an adaptive split method to reduce unnecessary splitting. The workspace splitting is dynamically allocated i) considering the spatial relationship between the query region and the resultant subspace, and ii) the distribution of the query region. We proposed an enhanced QR-tree with a new splitting method. Through a set of simulations, we verify the efficiency of the proposed split methods.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.2
• /
• pp.645-655
• /
• 2008

As wireless connectivity is integrated into many handheld devices, streaming multimedia content among mobile ad-hoc peers is becoming a popular application. In this paper, we propose a dynamic service replication algorithm for providing guaranteed continuous streaming services to all nodes in mobile ad-hoc networks (MANETs). First, a MANET is comprised of logical grid hierarchy, and a streaming service is replicated to a lower server region of the logical grid hierarchy by considering the link availability between a mobile node and the streaming server within a server region or the popularity of the streaming service. We evaluate analytically the performance of the proposed algorithm, and compared with that of existing Qin's algorithm. Evaluation results show that our algorithm can achieve better streaming performance than Qin's algorithm. Therefore, the proposed algorithm not only improves the sharing availability of replicated streaming services but also controls efficiently the number of streaming service replications.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.790-792
• /
• 2003

The remote sensing image server provides advanced image serving capabilities for geospatial image. Wide seamless image mosaics of Landsat 5 over GMS countries, which exceed a 15 GB or more in size per image, can integrate with other GIS map servers. The approach of two improvement algorithms leads to speed up the response time while preserving the data quality. This system does not only provide images on the web, but also provide GIS layers to WMS client map servers. The advantage of this approach is its efficiency lower cost in terms of cost, time and updating to obtain and utilize remote sensing image.

• Journal of Korea Spatial Information System Society
• /
• v.1 no.2 s.2
• /
• pp.137-149
• /
• 1999

Spatial database systems in client-server environment have network overload due to the large amount of spatial data transmission. Users use the window query that loads partial region of a whole map for quick response time in the environment. A series of window query such as screen movement, enlargement or shrinkage requires data in similar region and this increases network overload by re-transmitting the same data in intersected region with the earlier transmitted region. Removing the transmitted data from query results can solve this problem. In this paper, we design and implement a spatial object manager in order to remove the intersected region occurred by a series of window query. The spatial object manager manages the object identifiers of transmitted objects and removes transmitted objects from spatial objects of the query result by using the removal technique of the intersected region for the transmission and comparison. We utilize GEOMania Millennium server, an open client-server spatial database system, as spatial object manager in this paper. The result of the performance evaluation shows that the spatial object manager removes the transmission of the data redundancy, reduces network overload and improves the overall system performance.

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