• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.533-540
• /
• 2002

We can buy products everywhere from Web-based shopping mall using desktop, cellular phone or PDA. To guarantee the various services for different equipment, shopping mail systems should allow a lot of different size or quality of images to provide a good service to their customers. Despite of same product image, each shopping mall saves the image in its storage space individually. Furthermore, all the product images in each shopping mall are stored as images of different quality. It may waste resources of shopping mail server and bring us developmental overhead. It is difficult to update all the images for product that is used by distributed e-catalog in everywhere. In this paper, we extended the proposed Web Image Server (WIS) for sharing one image with all clients and processing Image dynamically, so that we strengthened the function of managing shopping mall as a client of WIS and added the function of recording clients'log file and image catalog for shopping mall. We measured the response time from WIS and conventional e-Commerce site using by WAS which is one of the stress test tools for Web application. Furthermore, we measured WIS responses image requests in reasonable time when the current user is increased.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.6
• /
• pp.684-690
• /
• 2018

In society of the big data is being recognized as one of the core technologies witch is analysis of the collected information, the intelligent evolution of society seems to be more oriented society through an optimized value creation based on a prediction technique. If we take advantage of technologies based on big data about various data and a large amount of data generated during system operation, it will be possible to support stable operation and prevention of faults and failures. In this paper, we suggested an environment using the collection and analysis of big data, and proposed an derive time series prediction model for predicting failure through server performance monitoring for data collected and analyzed. It can be capable of supporting stable operation of the IT systems through failure prediction model for the server operator.

• The KIPS Transactions:PartA
• /
• v.14A no.5
• /
• pp.269-278
• /
• 2007

Caching in a cache sorrel cluster environment has an advantage that minimizes the request and response tine of internet traffic and web user. Then, one of the methods that increases the hit ratio of cache is using the hash function with cooperative caching. It is keeping a fixed size of the total cache memory regardless of the number of cache servers. On the contrary, if there is no cooperative caching, the total size of cache memory increases proportional to the number of cache sowers since each cache server should keep all the cache data. The disadvantage of hashing method is that clients' requests stress a few servers in all the cache servers due to the characteristics of hashing md the overall performance of a cache server cluster depends on a few servers. In this paper, we propose the method that distributes uniformly client requests between cache servers using dynamic server information. We performed experiments using 16 PCs. Experimental results show the uniform distribution o

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.175-186
• /
• 2000

Over the years, the extensive use of networks and distributed systems has increased the need for authentication and digital signatures. Inperforming authentication on a massive scale, authentication servers that use multiple workstations or PCs are more economical than servers that use one inicomputer or mainframe. However, the establishment of authentication servers with multiple platforms can cause some security problems and increases the cost of key management because all platforms within the server must have the private key of the authentication server. We propose a scheme which can solve these problems. The proposed scheme can establish a strong authentication server with no additional key management and improve the performance of the authentication server up to 13 times.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.384-396
• /
• 2003

Hybrid query processing method is used for preventing server overload that is created by heavy user connection in Web GIS. In Hybrid query processing method, both server and client participate in spatial query processing. But, Hybrid query processing method is restricted in scalability of server and it can't be fundamentally solution for server overload. So, it is necessary for Web GIS to be brought in web clustering technique. In this thesis, we propose load-balancing method that uses proximity of query region. In this paper, we create tile groups that have relation each tile in same group is very close, and forward client request to the server that can have maximum rate of buffer reuse with considering characteristic of spatial query. With out load balancing method, buffet in server is optimized for exploring spatial index tree and increase rate of buffer reuse, so it can be reduced amount of disk access and increase system performance.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2497-2504
• /
• 2000

This paper is aimed at defining items of fault, and then constructing rules of fault diagnosis and recovery using INBANCA technology for the purpose of managing the weh server. The fault items of web server consist of the process fault, server overload, network interface fault, configuration and performance fault. Based on these items, the actual fault management is carried out fault referencing. In order to reference the fault, we have formulated the system-level fault diagnosis production rule and the service-level fault diagnosis rule, conjunction with translating management knowledge into active network. Also, adaptive recovery mechanism of web server is applied to defining recovery rule and constructing case library for case-based web server fault recovery. Finally, through the experiment, fault environment and applicability of each proposed production rule and recovering scheme are presented to verify justification of proposed diagnosis rules and recovery mechanism for fault management. An intelligent case-based fault management scheme proposed in this paper can minimize an effort of web master to remove fault incurred web administration and operation.

• Journal of Korea Game Society
• /
• v.9 no.6
• /
• pp.163-170
• /
• 2009

There is a request from the client, we almost apply dynamic memory allocating method using Accept() of looping method; thus, there could be process of connecting synchronously lots of client in most of On-line gaming server engine. However, this kind of method causes on-line gaming server which need to support and process the clients, longer loading and bottle necking. Therefore we propose the object pooling scheme to minimize the memory fragmentation and the load of the initialization to the client using an AcceptEx() and static allocating method for an efficient gaming server of the On-line in this paper. We design and implement the gaming server applying to our proposed scheme. Also, we show efficiency of our proposed scheme by performance analysis in this paper.

• Journal of Advanced Navigation Technology
• /
• v.18 no.6
• /
• pp.588-593
• /
• 2014

Recently, the smart devices has been possessed by a large majority of the adult, and offered various personalization services. This paper proposed the lightweight Intelligent Image Security System that notice the existence of any intruder in real time at the place of requiring the security by using smart device. The proposed image security system recognized whether or not intruder exists using the difference frame on the basis of Integral Image and the dynamic background updating algorithms. The intrusion notification is achieved by using the GCM push server that send massages in the application unit of user mobile device, and the SMTP mail server which is use of e-mail standard protocol. In case of the occurrence of intruder, GCM push server send an push-massage by the private mobile device, and SMTP mail server send the intruder's photograph and intrusion time. By the convergence of the various image processing algorithms and the performance of smart device, The proposed image security system can be applied to the various Intelligent Image Security field.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1200-1206
• /
• 2009

In this paper, we propose an energy-efficient MAC(Medium Access Control) protocol for processing context information in ubiquitous sensor network environments. CASMAC(Context Aware Sensor MAC) use context information for energy-efficient operation and its operation principle is as follows. First, we make scenarios with possible prediction for CASMAC. And then we save setted context information in server. When event occur at specific sensor node, and then it send three times sample data to server. According to context information, server process sample data. If server process sample data with event, it receive continuous data from event occur node by a transmission request signal. And then server send data transmission stop signal to event occur node when it do not need to data. If server process sample data with no event, it have not reply. Through we make energy consumption tables and an energy consumption model, we simulate analysis of CASMAC performance. In a result, we gains about 5.7 percents energy reduction compared to SMAC.

• Journal of the Korea Society for Simulation
• /
• v.24 no.4
• /
• pp.153-161
• /
• 2015

We propose a privacy-preserving location-based service (LBS) which supports top-k search service. The previous schemes hurt the privacy of either the user and the location of the objects because they are sent to the LBS server in a plaintext form. In the proposed method, by encrypting them with the fully-homomorphic encryption, we achieved the top-k search is possible while the information on them is not given to the LBS server. We performed a simulation on the proposed scheme with 16 locations where k is 3. The required time is 270 hours in a conventional desktop machine, which seems infeasible to be used in practice. However, as the progress of the hardware, the performance will be improved.