• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.129-134
• /
• 2001

Linux cluster Server makes a high performance PC cluster system, and provides scalablity and availability as compared with an expensive single server. In this paper, we design and implement a VOD streaming service system to serve video and audio streaming services on the Linux cluster server. Our Streaming server supports the MS Window Media Format based on the RTSP streaming protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.9-16
• /
• 2004

This paper proposes a performance analysis model of security servers comprising IPSec accelerators. The proposed model is based on a M/M1 queueing system with traffic load of Poisson distribution. The decoding delay has been defined to cover parameters characterizing hardware of security sorrels. Decoding delay values of a commercial IPSec accelerator are extracted yielding less than 15% differences from measured data. The extracted data are used to simulate the server system with the proposed model. The simulated performance of the cryptographic processor BCM5820 is around 75% of the published claimed level. The performance degradation of 3.125% and 14.28% are observed for 64byte packets and 1024byte packets, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.8
• /
• pp.779-788
• /
• 1992

The Input /output (I /0) subsystem is often the bottleneck in high performance computer system. Generally, system performance evaluation models were enhanced to include the effect of the I/0 system. In this paper, we modeled the terminal servers which are Indispensable devices In distribution of computer resources. We use M /M /1 Queueing model for find out the point of the system performance FIFO buffer sizes In the terminal server arc the Important fanctions of the system design and could be effected to the overall system functions. We have proposed the of optimal buffer sizes in the model of terminal server for increasing the system performance. We analizing the vatting time for terruanl server using Queueing model. and We find out the reference model result from simulation.

• Journal of the Korea Society for Simulation
• /
• v.14 no.2
• /
• pp.1-13
• /
• 2005

In distributed replicating server model, providing replicated services is able to improve the performance of providing a service and efficiency for several clients. And, the composition of the server selection algorithm is efficiently able to decrease the retrieval time for replicated data. In this paper, we define the system model that selects and connects the replicated server that provides optimal service using server-side downstream measurement and proposes an applicable algorithm.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.201-208
• /
• 2001

Explosive growth of the Web and the non-uniform characteristics of client requests result in the performance degradation of Web servers, and server cache has been recognized as the solution. We analyzed Web server accessing characteristics-repetition, size, and locality of access. Based on the result, we analyzed the cache removal policies and proposed a prefetch strategy to improve the hit ratio of server caches. In addition, through the trace-driven simulation based on the traces from real Web sites, we showed the performance improvement by our proposal.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.285-294
• /
• 2003

The request scheduling algorithms being used for the cluster web servers are mostly in two categories : load-balancing and contents-based cache affinity The goal of the load-balancing algorithms is to balance the loads between real servers. On the other hand, contents-based scheduling algorithm exploits the cache affinity in a way that the same type of requests are to be directed to a dedicated real server allowing load imbalance. So the performance comparison of the two algorithms is necessary, nevertheless the related experiment results are not much suggested. In this paper, performance evaluations have been done to compare the performance of the two scheduling algorithms. To accomplish this, we first implement a linux cluster web server, and then present the performance measurement results. The main contribution of this paper is to help the cluster web server administrators to select an algorithm fitting in with their circumstances from the two algorithms.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.781-786
• /
• 2004

In these days, such services are popularized as E-commerce, E- government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of sewer resources when heavy requests reach the web server. Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

• Convergence Security Journal
• /
• v.7 no.3
• /
• pp.1-6
• /
• 2007

It is important to manage and correctly evaluate the performance of server in order to improve he performance of server. That is, with the aim of finding whether resources are properly utilized, it is a method to improve both software and hardware aspects. Conventional method in evaluating the server performance involved installing software between server and client and generating the load and by simulating the process, it evaluated the handing efficiency of work load generated per packet volume. Therefore, this paper aims to pro-vide precise measurement method by distinguishing the characteristics of web server and the users' usage pattern and by evaluating the work load management through applying various standards. Specially, it presents the evaluation method from web service of personal and business.

• Journal of Korea Game Society
• /
• v.19 no.6
• /
• pp.71-82
• /
• 2019

This paper analyzes performance difference between Unreal Engine's built-in network solution and IOCP server. To do this, we developed IOCP server and 3D game with Unreal Engine 4. Also we considered the game variable obfuscation program to prevent the modification of the memory of the code-modulated game hacking program. This paper used SCUE4 Anti-Cheat Solution, which is Unreal Engine's solution, to study preventing memory modification and to analyze performance trade-offs.

• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.103-111
• /
• 2003

A distributed sewer 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.