• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.95-101
• /
• 2004

The scheduling problem that maps independent tasks to heterogeneous resources in distributed computing systems is known as NP-complete［1］. GRID［2］ is an example of distributed systems that consisted of heterogeneous resources. Many algorithms to solve this problem have been presented［1,3,4,5］. The scheduling algorithm can be classified into static scheduling algorithms and dynmic scheduling algorithms. A dynamic scheduling algorithm can be used when we can not predict the priority of tasks. Moreover, a dynamic scheduling algorithm can be divided into on-line mode algorithm and batch mode algorithm according to the scheduling time［1,6］. In this paper, we propose a new on-line mode scheduling algorithm. By extensive simulation, we can see that our scheduling algorithm outperforms previous scheduling algorithms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.557-562
• /
• 2006

최근 기업환경에서는 분산되어 있는 정보를 통합하여 정보 공유의 필요성이 증가함에 따라 기존 레거시 시스템간의 협업을 하기 위한 상호 운용이 강조되고 있다. 독립적인 레거시 시스템의 상호 연결을 위해서는 플랫폼 이질성, 의미 이질성 등을 극복할 필요가 있다. 이러한 문제를 해결하기 위해 ISO/IEC 11179에서 진행하고 있는 XMDR을 이용하여 미들웨어를 설계하였다. 설계한 미들웨어를 레거시 시스템에 적용하여 데이터 공유 및 통합의 일관성을 유지할 수 있게 되었다. 하지만 설계된 미들웨어는 각 노드의 자원 상황과 작업 상황에 대한 조정기능이 없기 때문에 정보 활용의 효율성을 보장할 수 없다. 따라서 레거시 시스템을 관리하고 조정하는 방안이 필요하다. 본 논문에서는 정보를 요청하는 요청 에이전트와 정보를 제공하는 정보 에이전트간의 정확한 정보 교환을 할 수 있도록 조정하고, 각 레거시 시스템의 정보 모니터링과 작업 분배 및 로컬 노드의 자원 관리를 담당하는 협력 에이전트를 설계함으로써 통합된 정보를 효율적으로 활용할 수 있도록 한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.3
• /
• pp.669-678
• /
• 2018

This study developed information technology infrastructures for building a driving environment analysis platform using various big data, such as vehicle sensing data, public data, etc. First, a small platform server with a parallel structure for big data distribution processing was developed with H/W technology. Next, programs for big data collection/storage, processing/analysis, and information visualization were developed with S/W technology. The collection S/W was developed as a collection interface using Kafka, Flume, and Sqoop. The storage S/W was developed to be divided into a Hadoop distributed file system and Cassandra DB according to the utilization of data. Processing S/W was developed for spatial unit matching and time interval interpolation/aggregation of the collected data by applying the grid index method. An analysis S/W was developed as an analytical tool based on the Zeppelin notebook for the application and evaluation of a development algorithm. Finally, Information Visualization S/W was developed as a Web GIS engine program for providing various driving environment information and visualization. As a result of the performance evaluation, the number of executors, the optimal memory capacity, and number of cores for the development server were derived, and the computation performance was superior to that of the other cloud computing.

• The Journal of the Korea Contents Association
• /
• v.17 no.8
• /
• pp.619-630
• /
• 2017

With the growing popularity of smart devices, various location based services have been providing to users. Recently, some location based social applications that combine social services and location based services have been emerged. The demands of a k-nearest neighbors(k-NN) query which finds k closest locations from a user location are increased in the location based social network services. In this paper, we propose an approximate k-NN query processing method for fast response time in a large number of users environments. The proposed method performs efficient stream processing using big data distributed processing technologies. In this paper, we also propose a modified grid index method for indexing a large amount of location data. The proposed query processing method first retrieves the related cells by considering a user movement. By doing so, it can make an approximate k results set. In order to show the superiority of the proposed method, we conduct various performance evaluations with the existing method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.10
• /
• pp.669-674
• /
• 2017

Due to the depletion of fossil fuels and the increase in environmental pollution, electric vehicles are attracting attention as next-generation transportation and are becoming popular all over the world. As the interest in electric vehicles and the penetration rate increase, studies on the charging infrastructure with vehicle-to-grid (V2G) technology and information technology are actively under way. In particular, communication with the grid network is the most important factor for stable charging and load management of electric vehicles. However, with the existing centralized infrastructure, there are problems when control-message requests increase and the charging infrastructure cannot efficiently operate due to slow response speed. In this paper, we propose a new charging infrastructure using mobile edge computing (MEC) that mitigates congestion and provides low latency by applying distributed cloud computing technology to wireless base stations. Through a performance evaluation, we confirm that the proposed charging infrastructure (with low latency) can cope with peak conditions more efficiently than the existing charging infrastructure.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.51-62
• /
• 2006

The load of this kind of gores, which is heavier than that of any other precedent, and on enormous seamless virtual world characterize the MMORPG(Massively Multiplayer Online Role-Playing Game) genres. In this seamless environment, gamers can usually accept a set of independent spaces, which is being held by independent game servers, os a single big virtual world. Despite the efforts of some developers, gamers are suffered from huge message traffic which comes from the interaction between client and server and the interaction between fold sowers. In this paper, new gore server architecture using MigAgent is proposed which tries to reduce message traffic. Usually, message traffic reaches the climax when a PC(Player Character) is moving to other field server. MigAgent, designed in this thesis, tries to manage this kind of PCs and to ploy o role of user's agent to prepare for the unexpected situation. Improvement of this system is shown by the analysis of the effect of the size ratio of AOI (Area of Interest) and AC (Adjacent Cell).

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.65-70
• /
• 2019

In recently, ship trajectory data consisting of ship position, speed, course, and so on can be obtained from the Automatic Identification System device with which all ships should be equipped. These data are gathered more than 2GB every day at a crowed sea port and used for analysis of ship traffic statistic and patterns. In this study, we propose a method to process ship trajectory data efficiently with distributed computing resources using MapReduce algorithm. In data preprocessing phase, ship dynamic and static data are integrated into target dataset and filtered out ship trajectory that is not of interest. In mapping phase, we convert ship's position to Geohash code, and assign Geohash and ship MMSI to key and value. In reducing phase, key-value pairs are sorted according to the same key value and counted the ship traffic number in a grid cell. To evaluate the proposed method, we implemented it and compared it with IALA waterway risk assessment program(IWRAP) in their performance. The data processing performance improve 1 to 4 times that of the existing ship trajectory analysis program.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.135-139
• /
• 2007

Recently Data Centric Storage (DCS) schemes are variously studied for several applications (e.g. natural environment investigation, military application systems and environmental changes monitoring). In DCS scheme, data is stored at nodes within the network by name. There are several drawbacks in the existing schemes. The first is the inefficiency of the range query processing on not considered the locality of store point. the second is the non-homogeneity of store load of each sensors in case of the sensor distribution density is non-uniformed. In this paper, we propose a novel data centric storage scheme with the sensor distribution density which satisfied with the locality of data store location. This scheme divides whole sensor network area using grid and distributes the density bit map witch consist of the sensor density information of each cell. sensors use the density bit map for storing and searching the data. We evaluate our scheme with existing schemes. As a result, we show improved load balancing and more efficient range query processing than existing schemes in environment which sensors are distributed non-uniform.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.1-11
• /
• 2020

As an important basic building block of the smart grid environment, smart meter provides real-time electricity consumption information to the utility. However, ensuring information security and privacy in the smart meter data aggregation process is a non-trivial task. Even though the secure data aggregation for the smart meter has been a lot of attention from both academic and industry researchers in recent years, most of these studies are not secure against internal attackers or cannot provide data integrity. Besides, their computation costs are not satisfactory because the bilinear pairing operation or the hash-to-point operation is performed at the smart meter system. Recently, blockchains or distributed ledgers are an emerging technology that has drawn considerable interest from energy supply firms, startups, technology developers, financial institutions, national governments and the academic community. In particular, blockchains are identified as having the potential to bring significant benefits and innovation for the electricity consumption network. This study suggests a distributed, privacy-preserving, and simple secure smart meter data aggregation system, backed up by Blockchain technology. Smart meter data are aggregated and verified by a hierarchical Merkle tree, in which the consensus protocol is supported by the practical Byzantine fault tolerance algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.609-616
• /
• 2011

The Delay/Disruption Tolerant Network (DTN) is a network designed to operate effectively using the mobility and storage of intermediate nodes under no end-to-end guaranteed network. This new network paradigm is well-suited for networks which have unstable path and long latencies (e.g. interplanetary network, vehicular network). In this paper, we first found that each taxi has its own regularly visiting area and define this property as spatial regularity. We analyze 4000 taxi trace data in Shanghai and show the existence of spatial regularity experimentally. Based on a spatial regularity in urban environment, we present a new DTN routing method. We introduce a Weighted Center (WC) which represents spatial regularity of each node. Through the association with evenly distributed access points (APs) in urban environment, most of vehicles get their grid locations and calculate their WCs. Since our routing method only uses neighbors' WCs for building routing paths, it can be regarded as distributed and practical protocols. Our experiments involving realistic network scenarios created by the traces of about 1500 Shanghai taxies show that our routing method achieves the higher performance compared to ECT, LET by 10%~110%.