• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.341-354
• /
• 2005

The main bottleneck for large scale VOD systems is bandwidth of storage or network I/O due to the large number of client requests simultaneously, and then efficient techniques are required to solve the bottleneck problem of the VOD system. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, called P2P proxy patching, for improving the typical patching technique by jointly using the prefix caching and P2P proxy. In our proposed scheme, each client plays a role in a proxy to multicast a regular stream to other clients that request the same video stream. Due to the use of the P2P proxy and the prefix caching, the client requests that ive out of the patching window range can receive the regular stream from other clients in the previous patching group without allocating the new regular channels from the VOD server to the clients. In the performance study, we show that our patching scheme can reduce the server bandwidth requirement about $33\%$ less than that of the existing patching technique with respect to prefix size and request interval.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8C
• /
• pp.670-679
• /
• 2012

The recent dissemination of cloud computing makes the amount of data storage to be increased and the cost of storing the data grow rapidly. Accordingly, data and service requests from users also increases the load on the cloud storage. There have been many works that tries to provide low-cost and high-performance schemes on distributed file systems. However, most of them have some weaknesses on performing parallel and random data accesses as well as data accesses of frequent small workloads. Recently, improving the performance of distributed file system based on caching technology is getting much attention. In this paper, we propose a CHPC(Cloud storage High-Performance Caching) framework, providing parallel caching, distributed caching, and proxy caching in distributed file systems. This study compares the proposed framework with existing cloud systems in regard to the reduction of the server's disk I/O, prevention of the server-side bottleneck, deduplication of the page caches in each client, and improvement of overall IOPS. As a results, we show some optimization possibilities on the cloud storage systems based on some evaluations and comparisons with other conventional methods.

• KIISE Transactions on Computing Practices
• /
• v.22 no.9
• /
• pp.473-478
• /
• 2016

Server virtualization provides abstraction of physical resources to users and thus accomplishes high resource utilization and flexibility. However, the characteristics of server virtualization, such as the limited number of physical resources shared by virtual machines, can cause problems, mainly performance interference. The performance interference is caused by the fact that the CPU scheduler running on the host operating system schedules virtual machines without considering the characteristics of the virtual machine's internal process. To address performance interference, a number of research activities to improve performance interference have been conducted, but do not deal with the fundamental analysis of performance interference. In this paper, in order to analyze the cause of performance interference, we carry out profiling in a variety of scenarios in a virtualized environment based on KVM. As a result, we analyze the phenomenon of the performance interference in terms of CPU scheduling and propose an efficient scheduling solution.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.699-709
• /
• 1999

This paper is aimed at defining items of analysis using SNMP MIB-II for the purpose of managing the Internet based network running on TCP/IP protocol, and then utilize these items, in conjunction with various Web technology and JAVA to design and implement a Web based interface of a management system to analyze the performance and status of the Internet. Among the required items in order to accomplish this task are utilization, interface packet transmission rate, I/O traffic ratio, and so on. Based on these items, the actual analysis is carried out by the Web interface according to the type of analysis. For instance, the interface executes the function of real-time analysis, collection processing, elementary analysis and detailed analysis. The demand of the user is fed into the Web interface which carried out a real-time analysis with the client system which in turn will eventually produce the results of the analysis. In order words, the interface acts as a mediator server for the analysis system. Furthermore, a protocol for exchange of data and messages between the server and the analysis system, the MATP protocol, was also designed. Finally, the results obtained through the system presented in this paper were displayed on screen according to the type of analysis. The system realized in this paper uses We technology and is independent of platform and allows the user to determine the performance of Internet at his/her own host according to the selected items of analysis.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.223-231
• /
• 2003

Video-on-Demand (VOD) service needs high resource consumption because of high bandwidth and long playback duration which are characteristics of multimedia. Various techniques such as Patching and Channel-Reserving Patching have been proposed to reduce the demand on the network-I/O bandwidth. Patching allows new clients to join an existing multicast for realization of true VOD, and Channel-Reserving Patching reserves the part of total channel capacity of video server in order to serve the requests for popular videos on which requests of users concentrate. To improve the performance of Channel-Reserving Patching, we propose the method that determines the reserved channel capacity of video server for the popular videos in this paper. The performance of our method is evaluated in terms of average servile latency, defection ratio and fairness through simulation, and is compared with those of Patching and another Channel-Reserving Patching.

• KIISE Transactions on Computing Practices
• /
• v.21 no.7
• /
• pp.470-475
• /
• 2015

Openstack is an open source software that enables developers to build IaaS(Infrastructure as a Service) cloud platforms. Openstack can virtualize servers, networks and storages, and provide them to users. This paper proposes the structure of Openstack cloud storage system applying Infiniband to solve bottlenecking that may occur between server and storage nodes when the server performs an I/O operation. Furthermore, we implement all flash array based high-performance Cinder storage volumes which can be used at Nova virtual machines by applying distributed RAID-60 structures to three 8-bay SSD storages and show that Infiniband storage networks applied to Openstack is suitable for virtualizing high-performance storage.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.20 no.3
• /
• pp.12-26
• /
• 2017

The objective of this study was to develop a runoff analysis system of the Nakdong River watershed using the GRM (Grid-based Rainfall-runoff Model), a physically-based distributed rainfall-runoff model, and to assess the system run time performance according to Microsoft Azure VM (Virtual Machine) settings. Nakdong River watershed was divided into 20 sub-watersheds, and GRM model was constructed for each subwatershed. Runoff analysis of each watershed was calculated in separated CPU process that maintained the upstream and downstream topology. MoLIT (Ministry of Land, Infrastructure and Transport) real-time radar rainfall and dam discharge data were applied to the analysis. Runoff analysis system was run in Azure environment, and simulation results were displayed through web page. Based on this study, the Nakdong River real-time runoff analysis system, which consisted of a real-time data server, calculation node (Azure), and user PC, could be developed. The system performance was more dependent on the CPU than RAM. Disk I/O and calculation bottlenecks could be resolved by distributing disk I/O and calculation processes, respectively, and simulation runtime could thereby be decreased. The study results could be referenced to construct a large watershed runoff analysis system using a distributed model with high resolution spatial and hydrological data.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.147-156
• /
• 2005

CGI is a standard interface rule between web server and gateway devised for the gateway's standard output to replace a static web document in UNIX environment. So, it is common to use standard I/O statements provided by the programming language for the CGI gateway. But the standard I/O mechanism is one of buffer strategies that are designed transparently to operating system and optimized for generic cases. This means that it nay be useful to apply another optimization to the standard I/O environment in CGI gateway. In this paper, we introduced standard output method and file output method as the two output optimization areas for CGI gateways written in C language in the UNIX/LINUX systems, and applied the proposed methods of each area to Debian LINUX, IBM AIX, SUN Solaris, Digital UNIX respectively. Then we analyzed the effect of them focused on execution time. The results were different from operating system to operating system. Compared to normal situation, the best case of standard output area showed about $10{\%}$ improvement and the worst case showed $60{\%}$ degradation in file output area where some performance improvements were expected.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.19 no.3
• /
• pp.153-163
• /
• 2017

The objective of this study is to enhance the model's speed of estimating weather variables (e.g., minimum/maximum temperature, sunshine hour, PRISM (Parameter-elevation Regression on Independent Slopes Model) based precipitation), which are applied to the Agrometeorological Early Warning System (http://www.agmet.kr). The current process of weather estimation is operated on high-performance multi-core CPUs that have 8 physical cores and 16 logical threads. Nonetheless, the server is not even dedicated to the handling of a single county, indicating that very high overhead is involved in calculating the 10 counties of the Seomjin River Basin. In order to reduce such overhead, several cache and parallelization techniques were used to measure the performance and to check the applicability. Results are as follows: (1) for simple calculations such as Growing Degree Days accumulation, the time required for Input and Output (I/O) is significantly greater than that for calculation, suggesting the need of a technique which reduces disk I/O bottlenecks; (2) when there are many I/O, it is advantageous to distribute them on several servers. However, each server must have a cache for input data so that it does not compete for the same resource; and (3) GPU-based parallel processing method is most suitable for models such as PRISM with large computation loads.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.2
• /
• pp.102-110
• /
• 2006

This paper explains the design and development of the stand-alone high sound quality Internet Radio system, which is aimed for a small embedded type audio device rather than a general PC type. This device is designed to work with an Internet connection. This kind of system is not standardized so far, and also the related algorithm is not open to the public. So it is necessary to analyze several receiving algorithms of current radio receivers, and develop our own hardware in order to overcome these obstacles, finally to get the high quality of sound radio. The main electronic components of this Internet Radio are TCP/IP interfaces, an audio MP3 decoder, an I/O interface, and a Flash Memory Card with advanced audio multicasting for the next-generation Internet Radio. Basic structures and implementation issues of the next-generation most-versatile digital music player, and Internet Radio receivers, are discussed.