• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.185-192
• /
• 2011

The purpose of this paper is to propose the design and implementation of a korean style internet-based test system on the basis of efficiency and stability for middle server. The current assessment system has some unstable elements with regard to transmission procedure, cost, system load and stability. This paper proposes a series of activities for the performance improvement of korean style internet-based test system which finally produced various excellent results in the administration of expense control, human resources, and special operational affairs. The proposed system's technological factors using middle server have been tested through a basic simulation pilot system. Actual development procedure starts from the analysis required by improving the shortcomings of existing internet-based test systems. A efficiency comparison with existing system and newly developed system was made in the area of number of operators, abnormal processing, system maintenances. Korean style internet-based test system using middle server has shown great efficiency increased to the maximum of 2 times about the effectiveness of processing for various parts. The korean style internet-based test system using middle server have been given good evaluations with regard to the convenience of their use and the management system for operators and supervisors.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.615-622
• /
• 2006

Caching in a Wireless Internet Proxy Server Cluster Environment has an effect that minimizes the time on the request and response of Internet traffic and Web user As a way to increase the hit ratio of cache, we can use a hash function to make the same request URLs to be assigned to the same cache server. The disadvantage of the hashing scheme is that client requests cannot be well-distributed to all cache servers so that the performance of the whole system can depend on only a few busy servers. In this paper, we propose an improved load balancing scheme using hashing and Round Robin scheme that distributes client requests evenly to cache servers. In the existing hashing scheme, if a hashing value for a request URL is calculated, the server number is statically fixed at compile time while in the proposed scheme it is dynamically fixed at run time using round robin method. We implemented the proposed scheme in a Wireless Internet Proxy Server Cluster Environment and performed experiments using 16 PCs. Experimental results show the even distribution of client requests and the 52% to 112% performance improvement compared to the existing hashing method.

• Journal of IKEEE
• /
• v.28 no.3
• /
• pp.458-464
• /
• 2024

This study proposes a fault-tolerant caching system to address the issue of caching content imbalance caused by the dynamic departure and participation of cache servers in a heterogeneous cache server network, and validates it in both real and virtual environments. With the increase of large-scale media content requiring various types and resolutions, the necessity of cache servers as key components to reduce response time to user requests and alleviate network load has been growing. In particular, research on heterogeneous cache server networks utilizing edge computing and low-power devices has been actively conducted recently. However, in such environments, the irregular departure and participation of cache servers can occur frequently, leading to content imbalance among the cache servers deployed in the network, which can degrade the performance of the cache server network. The fault-tolerant caching algorithm proposed in this study ensures stable service quality by maintaining balance among media contents even when cache servers depart. Experimental results confirmed that the proposed algorithm effectively maintains content distribution despite the departure of cache servers. Additionally, we built a network composed of seven heterogeneous cache servers to verify the practicality of the proposed caching system and demonstrated its performance and scalability through a large-scale cache server network in a virtual environment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.10-17
• /
• 2008

In this paper, we propose an efficient data replication strategy based on Peer-to-Peer which improves the performance of Data Grid system. The key idea of this replication strategy is to add the Peer-to-Peer concept for reducing data transmission restriction caused by hierarchical topology. And, it makes the nodes can store data replica to set a critical section at the storage of client level nodes. Therefore, it is possible to transmit the data replica between client level nodes and from client level nodes to upper data replication server. It is more effective to transmit data replica between client level nodes than transmitting data replica 1mm data server or data replication server with respect to minimize the transmission time. This results in improving the performance of Data Grid system. Through simulation, we show that the proposed data replication strategy based on Peer-to-Peer improves the performance of entire Data Grid environment compared to previous strategies.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.191-199
• /
• 1996

In this paper, We assume that the closed computer system model composed of multiprocessor system is analyzed by BCMP queueing network theory with priority levels. In this system that contains terminals, processors and I/O devices, We show maximum throughput and the number of active terminals in the optimum multiprogramming levels. It is compared the performance with the other. In the result, it is obtained the optimum number of processors and active terminals. Therefore, the system model consisted of the optimum number of processor and multiprogramming level m is analyzed by the servers with a priority level. Each server is applied to the type of server which is characterized terminal, processor I/O device etc.. This model is analyzed by the server with a probability ditribution. Ideal state is proposed by the modeling for priority levels. Finally, we try to increase the performance in overload system.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.785-794
• /
• 2006

Nowadays, Internet is used worldwide and network traffic is increasing dramatically. Much of Internet traffic is due to the web applications. And I propose a new cooperative web caching scheme, called DCOORD which tries to minimize the overall cost of Web caching. DCOORD reduces the communication cost by coordinating the objects which are cached at each cache server. In this paper, I compare the Performance of DCOORD with two well-known cooperative Web caching schemes, ICP and CARP, using trace driven simulation. In order to reflect the cost factor in the network communication, I used the CSR(Cost-Saving Ratio) as our performance metric, instead of the traditional hit ratio. The performance evaluations show that DCOORD is more cost effective than ICP and CARP.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.117-130
• /
• 2006

With the rapid development of technologies related to Ubiquitous Sensor Network (USN), sensors are being utilized in various application areas. In general, the data sensed by each sensor node on ubiquitous sensor networks are stored into the central server for efficient search. Because update is delayed to reduce the cost of update in this environment, uncertain data can be stored in the central server. In addition, Uncertain data make query processing produce wrong results in the central server. Thus, this paper examines how to process uncertain data in ubiquitous sensor networks and suggests a new index for efficient processing of uncertain data. The index reduces the cost of update by delaying update in uncertainty areas. Uncertainty areas are areas where uncertain data are likely to exist. In addition, it solves the problem of low accuracy in search resulting from update delay by delaying update only for specific update areas. Lastly, we analyze the performance of the index and prove the superiority of its performance by comparing its performance evaluation.

• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.49-57
• /
• 2015

In this Paper, we introduce an efficient on-line software service using an application customized graphic offloading library. The software service based on graphic offloading provides high-end software, like a 3D graphic design tool, as an on-line software service through using a client graphic rendering. When software is executed on server, its graphic works are handled by a client's GPU, while its data works are handled by a server's CPU. To improve the performance, we apply an asynchronous transmission channel scheme to our developed basic graphic offloading engine. Also, we add optimized common module and application specific module to our engine. To do that, we introduce how to implement the application specific module using analyzing patterns of graphic related APIs and messages that are generated by an executed software process. Also, we propose how to design the optimized common module using server side information caching. Finally, through the performance comparison experiment, we show that improved offloading engine has the better performance than old basic offloading engine.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.645-651
• /
• 2019

At a time when large amounts of data are being poured out, there are many changes in software architecture or data storage patterns because of the nature of the data being written, rather more read-intensive than writing. Accordingly, in this paper, the query model of Command Query Responsibility Segmentation (CQRS) pattern separating the responsibilities of commands and queries is used to implement an efficient high-capacity data lookup system in users' requirements. This paper uses the 2018 temperature, humidity and precipitation data of the Korea Meteorological Administration Open API to store about 2.3 billion data suitable for RDBMS (PostgreSQL) and NoSQL (MongoDB). It also compares and analyzes the performance of systems with CQRS pattern applied from the perspective of the web server (Web Server) implemented and systems without CQRS pattern, the storage structure performance of each database, and the performance corresponding to the data processing characteristics.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.2
• /
• pp.331-339
• /
• 2017

This paper proposes a thread pool management technique of an websocket server that is applicable to embedded systems. WebSocket is a proposed technique for consisting a dynamic web, and is constructed using HTML5 and jQuery. Various studies have been progressing to construct a dynamic web by Apache, Oracle and etc. Previous web service systems require high-capacity, high-performance hardware specifications and are not suitable for embedded systems. The node.js which is consist of HTML5 and jQuery is a typical websocket server which is made by open sources, and is a java script based web application which is composed of a single thread. The node.js has a limitation on the performance for processing a high velocity data on the embedded system. We make up a multi-thread based websoket server which can solve the mentioned problem. The thread pool is managed by a bit register and suitable for embedded systems. To evaluate the performance of the proposed algorithm, we uses JMeter that is a network test tool.