• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.61-71
• /
• 2009

The server redirection system replicates contents on replica servers in the distributed network environment. When users make a request for contents, the system can provide the contents much faster than the client-server network system. In the server redirection system, it is the most important to select the optimal replica server with user's information because many replica servers are geographically distributed. And, the system can serve contents to users flexibly if a redirector is well constructed. In this paper, the redirector makes a list of candidates suitable for user conditions by the decision tree method and calculates the availability of each replica server. And, the redirector selects the replica server with the highest availability. This paper also proposes an availability-based server redirection system that predicts the availability of each replica server in order to reduce the workload of replica servers and the repetitive communication messages between a redirector and replica servers. If a user accesses the network path for the replica server selected and noticed by the proposed system, the user can get contents effectively and efficiently.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.3
• /
• pp.193-204
• /
• 2006

In most existing distributed Web systems, incoming requests are distributed to servers via Domain Name System (DNS). Although such systems are simple to implement, the address caching mechanism easily results in load unbalancing among servers. Moreover, modification of the DNS is necessary to load considering the server's state. In this paper, we propose a new dynamic load balancing method using dynamic DNS update and round-robin mechanism. The proposed method performs effective load balancing without modification of the DNS. In this method, a server can dynamically be added to or removed from the DNS list according to the server's load. By removing the overloaded server from the DNS list, the response time becomes faster. For dynamic scheduling, we propose a scheduling algorithm that considers the CPU, memory, and network usage. We can select a scheduling policy based on resources usage. The proposed system can easily be managed by a GUI-based management tool. Experiments show that modules implemented in this paper have low impact on the proposed system. Furthermore, experiments show that both the response time and the file transfer rate of the proposed system are faster than those of a pure Round-Robin DNS.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.547-550
• /
• 2017

With the deployment of Internet of Things (IoT) services, the interest of smart building management system is rapidly increased. However, existing smart building management system has some limitations such as single point of failure, scalability, processing delay by using the centralized service platform server. To overcome these limitations, in this paper, the distributed server based smart building management scheme is proposed. In the proposed scheme, it is possible to provide fast and efficient IoT services, regardless of the scale of smart building, by using the distributed server of each floor. From the numerical analysis, it is shown that the proposed scheme provides better performance than the existing centralized scheme in terms of stability of database and service processing delay.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.67-73
• /
• 2012

A distributed conference architecture with a new load control method has been suggested in this paper. A new event package in this paper enables to control conference load. Some additional elements for exchanging SIP messages between server and participants, and for distributing the load, have been added to new conference information data format. Furthermore to lessen the load, all conference servers share the processing of conference information data which should be transferred periodically to all participants. The suggested load control event package makes each server can get current load status of the overall servers. When load increases in one server SIP client requests are distributed by selecting a server which has the lowest load value, or new server is created to share the load. The performance of the proposed system has been evaluated by experiments. They shows 21.6% increase in average delay time, and 29.2% increase in average SIP message processing time.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.268-271
• /
• 2004

Today, the vehicle is used the mean of transportation as well as the mobile office with the third digital life space. So telematics is an emerging industry that has tremendous future potential. It is necessary the essential contents for telematics services : navigation map for navigation, POI, real-time traffic information etc. In this paper, we proposed the telematics contents server to manage the telematics contents with efficient performance in distributed environment. The telematics contents server transforms and stores the essential contents and provide it to user through standard interface. The telematics contents server is middleware to offer a rapid essential telematics contents management, client connectivity, and communications. It is useful for the telematics service provider to build telematics system under distributed environment.

• International Journal of Contents
• /
• v.4 no.1
• /
• pp.16-19
• /
• 2008

In this paper, we propose to new dispatcher method, which doesn't depend on an operating system of the server, and the direct routing method, by which a server answers a client's request at first hand. And, propose new web clustering scheme based on the contents on the web where web servers composed of cluster, with each different contents, answer client's request. The other purposes are to reduce overhead of the dispatcher through load balance, and to minimize the time to take in responding to a client's request. The performance of new web cluster scheme was improved by about 39% than that of the existing RR method. It was identified that the performance of the proposed web cluster method was extraordinary improved comparing with that of the existing RR method as a whole.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.656-658
• /
• 2003

Recently, loosely-coupled systems are widely used for distributed computing environment. We develop a web GIS server who conforms to the international standards developed by the Open GIS Consortium (OGC), such as web feature service (WFS) implementation specification, Geography Markup Language (GML) implementation specification, and the simple features specification for OLE/COM. The web GIS server provides interoperable access of spatial data among data formats in the distributed environment.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.27-34
• /
• 2003

A distributed server cluster system is a cost-effective system to provide a service application for clients with reliable, scalable, available, and fault-tolerant features. In order to provide high quality services, it is necessary to evaluate service performances, tune the server system, and analyze performances. In this paper, we propose a simulator to generate workloads based on statistic configuration according to estimated application traffics, apply workload scheduling algorithms, and evaluate the simulation results. We introduce the simulator design modelling and architecture. By using flexible parameters, the simulator is able to generate various patterns of workloads with different statistics, and configure system environments such as the number of server nodes, system resources considered, and their capacities. With this simulator, we introduce two scenarios: one is to find appropriate thresholds for the best performance of cluster system, and the other is to find the suitable scheduling algorithm for workload characteristics of service applications.

• International journal of advanced smart convergence
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2017

Diverse types of malicious code such as evasive Server-side Polymorphic are developed and distributed in third party open markets. The suspicious new type of polymorphic malware has the ability to actively change and morph its internal data dynamically. As a result, it is very hard to detect this type of suspicious transaction as an evidence of Server-side polymorphic mobile malware because its C&C server was shut downed or an IP address of remote controlling C&C server was changed irregularly. Therefore, we implemented Simulated C&C Server to aggregate activated events perfectly from various Server-side polymorphic mobile malware. Using proposed Simulated C&C Server, we can proof completely and classify veiled server-side polymorphic malicious code more clearly.

• Journal of Korea Game Society
• /
• v.19 no.3
• /
• pp.5-14
• /
• 2019

The gaming server is based on a distributed server. In order to distribute workloads of gaming servers, distributed gaming servers apply some algorithms which divide each of gaming server's workload into balanced workload among the gaming servers and as a result, efficiently manage response time and fusibility of server requested by the clients. In this paper, we propose a load balancing agent using PPO(Proximal Policy Optimization) which is one of the methods from a greedy algorithm and Policy Gradient which is from Reinforcement Learning. The proposed load balancing agent is compared with the previous researches based on the simulation.