• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.8
• /
• pp.1962-1969
• /
• 2009

During past 20 years we have witnessed brilliant advances in major components of computer system, including CPU, memory, network device and HDD. Among these components, in spite of its tremendous advance in capacity, the HDD is the most performance dragging device until now and there is little affirmative forecasting that this problem will be resolved in the near future. We present a new approach to solve this problem using the NAND Flash memory. Researches utilizing Flash memory as storage medium are abundant these days, but almost all of them are targeted to mobile or embedded devices. Our research aims to develop the NAND Flash memory based storage system enough even for enterprise level server systems. This paper present structural and operational mechanism to overcome the weaknesses of existing NAND Flash memory based storage system, and its evaluation.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.399-406
• /
• 2010

Many problems are arisen due to the weakness in the security and invasion to privacy by malicious attacker or internal users while various data services are available in ubiquitous network environment. The matter of controlling security for various contents and large capacity of data has appeared as an important issue to solve this problem. The allocation methods of Ito, Saito and Nishizeki based on traditional polynomial require all shares to restore the secret information shared. On the contrary, the secret information can be restored if the shares beyond the threshold value is collected. In addition, it has the effect of distributed DBMS operation which distributes and restores the data, especially the flexibility in realization by using parameters t,v,k in combinatorial design which has regularity in DB server and share selection. This paper discuss the construction of new share allocation method and data distribution/storage management with the application of matrix structure of t-(v,k,1) design for allocating share when using secret sharing in management scheme to solve the matter of allocating share.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.232-235
• /
• 2015

In recent years, mobile devices are equipped with functionalities comparable to those computers. However, mobile devices have limited resources due to constraints, such as low processing power, limited memory, unpredictable connectivity, and limited battery life. To enhance the capacity of mobile devices, an interesting idea is to use cloud computing and virtualization techniques to shift the workload from mobile devices to a computational infrastructure. Those techniques consist of migrating resource-intensive computations from a mobile device to the resource-rich cloud, or server (called nearby infrastructure). In order to achieve their goals, researchers designed mobile cloud applications models (examples: CloneCloud, Cloudlet, and Weblet). In this paper, we want to highlight on cloudlet architecture (nearby infrastructure with mobile device), its methodology and discuss about the impact of distance between cloudlet and mobile device in our work design.

• Journal of Korea Entertainment Industry Association
• /
• v.5 no.1
• /
• pp.149-153
• /
• 2011

In this study, a configuration method for a cloud technology based VoD system through two different scenarios is proposed. The first scenario virtualizes DMC, content storages for each SO, and stream servers in the conventional VoD system in order to efficiently use the additionally required storage capacity and stream server. In the second scenario, it is proposed that cable broadcasting systems including VoD systems are to be changed as cloud in which the subscriber STB should have minimum programs and storage regions to connect networks, and the operating system and middle ware presented in the existing subscriber STB is moved to the cloud data center. In addition, the comparison of the application of the cloud technology for the cost of changing the existing system to STB and the cost of establishing a cloud VoD system is performed in order to analyze the cost reduction in broadcasting businesses based on the establishment of VoD systems.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1299-1306
• /
• 2023

In this paper, we present a system for undesignated cultural heritage management and real-time theft chase, which uses flash-based large-capacity storage. The proposed system is composed of 3 parts, such as a cultural management device, a flash-based server, and a monitoring service for managing cultural heritages and chasing thefts using IoT technologies. However flash-based storage needs methods to overcome the limited lifespan. Therefore, in this paper, we present a system, which uses the disk buffer in flash-based storage to overcome the disadvantage, and evaluate the system performance in various environments. In our experiments, LRU policy shows the number of direct writes in the flash-based storage by 10.7% on average compared with CLOCK and FCFS.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.196-201
• /
• 2018

Recently, various infrastructure-less IoT networking schemes have been studied to construct local IoT networks based on self-organization. This is, because RPL protocol, which is to support infrastructure based network construction is used to construct local IoT networks. Thus, a self-organization networking and ad hoc path between client and server in local IoT networks is not supported in basis RPL protocol. In this paper, we propose a self-organization networking scheme which support infrastructure-less based IoT network construction in low-power and lossy network based IoT environments consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Through simulation, we show that the proposed self-organization networking scheme improves the performance, in terms of the number of packets generated for end-to end data transmission and the end-to-end delay, compared to basis RPL protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.309-315
• /
• 2017

Recently it has drawn much attention on the technologies about Internet of Things (IoT) which connects objects with constrained resource and heterogenous communication module in order to communicate information via internet. We propose a real-time sensor monitoring system based on IPv6 over Bluetooth Low Energy (BLE), which is included in Bluetooth 4.2 Specification. Since this system uses a publish-subsribe based IoT protocol, so called Message Queueing Telemetry Transport (MQTT), neither transforming network data nor any proxy server is needed in order to transmit data. Through the web client connected to this system, you can monitor sensor data sent by BLE device in real-time, intermediated via MQTT broker and then delivered to the client via HTTP and websocket protocol. In this paper we evaluated network capacity and availability of the implemented test platform. Thus by using this system it is possible to make development cost low and to construct IoT network with heterogenous devices easily.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1105-1112
• /
• 2022

Field data monitoring systems such as renewable energy generation and smart farm integrated control are developing from PC and server to mobile first, and various wireless communication and application services have emerged with the development of IoT technology. Low-power wide-area networks are services optimized for low-power, low-capacity, and low-speed data transmission, and data collected in the field is transmitted to designated storage servers or cloud-based data platforms, enabling data monitoring. In this paper, we implement an IoT repeater that collects field data with a single device and transmits it to a wireless carrier cloud data flat using a low-power wide-area network, and a monitoring app using it. Using this, the system configuration is simpler, the cost of deployment and operation is lower, and effective data accumulation is possible.

• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.175-186
• /
• 2003

Mobile clients like a PDA need a cache and a spatial index to search and access map data efficiently. When a server transmits spatial objects to a mobile client which has a low storage capacity, some of them can be duplicated in a cache of the mobile client. Moreover, the cost for strong added data in the cache and reconfiguring spatial index is very high in the mobile client with low computing power. The scheme for processing duplicated objects and disturbing tasks of the mobile client which has low computing power is needed. In this paper, we classfy the method for strorng duplicated objects and present the scheme for the both caching objects and reconfiguring a spatial index of cached objects using the clipping technique. We propose the caching system based on an agent in order to distribute the overhead of a mobile client as well as to provide efficiently map services. We design and implement it, and evaluate the performance.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1163-1176
• /
• 2005

The Web is the largest distributed information space but, the individual's capacity to read and digest contents is essentially fixed. In these Web environments, mining traversal patterns is an important problem in Web mining with a host of application domains including system design and information services. Conventional traversal pattern mining systems use the inter-pages association in sessions with only a very restricted mechanism (based on vector or matrix) for generating frequent K-Pagesets. We extend a family of novel algorithms (termed WebPR - Web Page Recommend) for mining frequent traversal patterns and then pageset to recommend. We add a WebPR(A) algorithm into a family of WebPR algorithms, and propose a new winWebPR(T) algorithm introducing a window concept on WebPR(T). Including two extended algorithms, our experimentation with two real data sets, including LadyAsiana and KBS media server site, clearly validates that our method outperforms conventional methods.