• KIISE Transactions on Computing Practices
• /
• v.24 no.1
• /
• pp.10-16
• /
• 2018

The task of consolidating server workloads is critical for the efficiency of a datacenter in terms of reducing costs. However, as a greater number of workloads are consolidated in a single server, the performance of workloads might be degraded due to their contention to the limited shared resources. To reduce the performance degradation, scheduling for mitigating the contention of shared resources is necessary. In this paper, we present the Dynamic Voltage Frequency Scaling (DVFS) based memory-contention aware scheduling method for multi-threaded workloads. The proposed method uses two approaches: running memory-intensive threads on the limited cores to avoid concurrent memory accesses, and reducing the frequencies of the cores that run memory-intensive threads. With the proposed algorithm, we increased performance by 43% and reduced power consumption by 38% compared to the Completely Fair Scheduler(CFS), the default scheduler of Linux.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1234-1238
• /
• 2010

In recent, there have been done many studies on applications that monitor the information of mobile objects using Wireless Sensor Networks (WSN). A density query that finds out an area spread by density that a target object requires in the whole sensing field is a field of object monitoring applications. In this paper, we propose a novel homogeneous network-based in-network density query processing scheme that significantly reduces query processing costs and assures high accuracy. This scheme is based on the possibility-based expected region selection technique and the result compensation technique in order to enhance the accuracy of the density query and to minimize its energy consumption. To show the superiority of our proposed scheme, we compare it with the existing density query processing scheme. As a result, our proposed scheme reduces about 92% energy consumption for query processing, while its network lifetime increases compared to the existing scheme. In addition, the proposed scheme guarantees higher accuracy than the existing scheme in terms of the query result.

• KIISE Transactions on Computing Practices
• /
• v.23 no.4
• /
• pp.238-243
• /
• 2017

This paper presents a study regarding a systemic structure that forms a link between heterogeneous terminals and the WebRTC (Web real-time communication) based video-conferencing systems. This system consists of a WebRTC-based terminal, a signal server for the relaying of the necessary signals for media negotiations, an MCU provides an interworking interface for the heterogeneous terminal, and the heterogeneous terminals that interwork with the MCU. This technology enables the interoperability between the WebRTC-based video-conferencing solutions and the legacy devices. In addition to reducing the replacement costs regarding new-technology-based solutions, the existing legacy equipment enables the use of multiparty-conference, thereby increasing the use ability of the conferencing systems.

• KIISE Transactions on Computing Practices
• /
• v.23 no.7
• /
• pp.397-407
• /
• 2017

Wireless networks make the users' work more convenient and efficient, but such networks can impair the availability of network resources and can cause leakage of important corporate information when there are security threats. In particular, damage has increased because of security attacks that take advantage of the vulnerabilities created by a wireless AP (Access Point). Public organizations and companies have gradually selected the WIPS (Wireless Intrusion Prevention System) to block wireless security threats and protect the internal network. However, it is very costly for other organizations and companies to introduce the WIPS solution. This paper proposes implementing a WIPS Sensor by using Raspberry Pi to reduce these costs and to block the various wireless LAN security threats. This implementation would protect corporate information and provide consistent services at a relatively reasonable price.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.2
• /
• pp.223-230
• /
• 2013

Recently, a large number of corporations are adopting cloud solution in order to reduce IT-related costs. By the way, Digital Trace should have admissibility to be accepted as digital evidence in court, and integrity is one of the factors for admissibility. In this context, this research implemented integrity verification test to VM Data which was collected by well-known private cloud solutions such as Citrix, VMware, and MS Hyper-V. This paper suggests the effective way to verify integrity of VM data collected in private cloud computing environment based on the experiment and introduces the error that EnCase fails to mount VHD (Virtual Hard Disk) files properly.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.567-576
• /
• 2003

Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exists in spatial databases, is a challenging task due to the huge amounts of spatial data. Clustering algorithms are attractive for the task of class identification in spatial databases. Several methods for spatial clustering have been presented in recent years, but have the following several drawbacks increase costs due to computing distance among objects and process only memory-resident data. In this paper, we propose an efficient grid cell based spatial clustering method for spatial data mining. It focuses on resolving disadvantages of existing clustering algorithms. In details, it aims to reduce cost further for good efficiency on large databases. To do this, we devise a spatial clustering algorithm based on grid ceil structures including cell relationships.

• Journal of Internet Computing and Services
• /
• v.5 no.4
• /
• pp.11-22
• /
• 2004

Works that improve the process and notify the improved process, the product and the change of tasks to all users are essential in achieving project. Existent project management tools support the definition and the change of project activities, and configuration management tools support version check, workspace management. build management. etc. It costs too much to buy each tool. as well as, it is burdensome to learn usage for various tools. Therefore the web-based integrated tool is proposed to manage the process and artifacts at a time in this paper. The proposed tool defines component based development process model. and achieves recording of process progression, processing the request of change, reporting the progression of each task, product registering and change, version recording, artifact or form search, etc. using ebXML. Furthermore, the stakeholders get the systematic management and standardization by sharing information that are necessary in process achievement and configuration management in distributed environment using the integrated management tool.

• Journal of Internet Computing and Services
• /
• v.5 no.4
• /
• pp.77-94
• /
• 2004

Recently, the needs of index structure which manages moving objects efficiently have been increased because of the rapid development of location-based techniques. Existing index structures frequently need updates because moving objects change continuatively their positions. That caused entire performance loss of the index structures. In this paper, we propose a new index structure called the TPKDB-tree that is a spatio-temporal index structure based on KDB-tree. Our technique optimizes update costs and reduces a search time for moving objects and reduces unnecessary updates by expressing moving objects as linear functions. Thus, the TPKDB-tree efficiently supports the searches of future positions of moving objects by considering the changes of moving objects included in the node as time-parameter. To maximize space utilization, we propose the new update and split methods. Finally, we perform various experiments to show that our approach outperforms others.

• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.1-16
• /
• 2012

Cost-effective mobility management for the roaming mobile users is very important in the seamless services on next-generation wireless network (NGWN). MIPv6 (Mobile IPv6) is one of the mobility management schemes proposed by the IETF (The Internet Engineering Task Force) and various IPv6-based mobility management schemes have been developed. They are directly involved with data transfer from MN (Mobile Node). In this paper, two kinds of schemes in analyzing of mobility management schemes are proposed. The signaling transfer and packet delivery procedures for each mobility management schemes are analyzed, respectively. The signaling cost for mobility management schemes are calculated, and the cost of each protocol are analyzed numerically. In other word, applying the sum of signaling cost and packet delivery cost to each mobility management scheme, their costs are analyzed. Finally, our performance evaluation results that the network-based mobility management scheme shows better performance in terms of overall cost.

• KIISE Transactions on Computing Practices
• /
• v.22 no.10
• /
• pp.497-503
• /
• 2016

Emerging next-generation storage technologies such as non-volatile memory will help eliminate almost all of the storage latency that has plagued previous storage devices. In conventional storage systems, the latency of slow storage devices dominates access latency; hence, software efficiency is not critical. With low-latency storage, software costs can quickly dominate memory latency. Hence, researchers have proposed the memory mapped file I/O to avoid the software overhead. Mapping a file into the user memory space enables users to access the file directly. Therefore, it is possible to avoid the complicated I/O stack. This minimizes the number of user/kernel mode switchings. In addition, there is no data copy between kernel and user areas. Despite of the benefits in the memory mapped file I/O, its overhead still needs to be addressed, as the existing mechanism for the memory mapped file I/O is designed for slow block devices. In this paper, we identify the overheads of the memory mapped file I/O via experiments.