• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.674-685
• /
• 1999

MIDAS-II는 한국전자통신연구원에서 개발한 바다 DBMS의 저장 시스템이다. MIDAS-II 볼륨은 데이터의 논리적 저장 단위인 파일을 저장하는 영역을 가리킨다. 본 논문에서는, MIDAS-II가 대용량 멀티미디어 데이터 서버의 저장 시스템으로 기능하도록 광 디스크 쥬크박스 또는 테이프 라이브러리와 같이 복수 개의 저장 매체 (platter , 예를 들어 디스크 또는 카트리지 테이프)로 구성된 Tera 바이트 급의 3창 저장 장치를 장착할 경우 이를 위한 볼륨 구조의 설계 및 구현에 대해 기술한다. 본 논문에서 제안하는 볼륨 구조는 3차 저장 장치 접근 시 성능 제고를 위하여 디스크 캐쉬 영역을 두고 있으며, 3차 저장 장치의 저장 매체별 관리 기능을 제공한다. Abstract MIDAS-II is the storage systemfor BADA DBMS developed at ETRI. A volume of MIDAS-II is the area where the files, the logical unit for storing data, are stored. This paaper describes the design and implementation of a new MIDAS-II volume structure for the tertiary storage device such as an optical disk juke box or a tape library equipped with multiple platters(disks or cartridge tapes, for example ). Incorporating thetertirary storage device of the order of tera bytes into MIDAS-II enables it to function as a storage system for a massive amount fo multimedia eata server. The volume structure for the tertiary storage device proposed in this paper features disk caching for performing improvement and direct control of theindividual platter.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.111-117
• /
• 2001

Most of the techniques for the performance estimation of unit-load AS/RS are a static model or computer simulation. Especially, their models have been developed under the assumption that the Storage/Retrieval (S/R) machine performs either single command(SC) or dual command(DC) only. In reality, depending on the operating policy and the status of the system at a particular time, the S/R machine performs a SC or a DC, or becomes idle. In order to resolve this weak point, we propose a stochastic model for the performance estimation of unit-load ASIRS by using a M/G/1 queueing model with a single server and two queues. Server utilization, expected numbers of waiting storage and retrieval commands and mean time spent in queue and system are found.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.395-401
• /
• 2004

In the current high network-centralized computing and enterprising environment, it is getting essential to transmit data reliably at very high rates. Until now previous client/server model based NFS(Network File System) or AFS(Andrew's Files System) have met the various demands but from now couldn't satisfy those of the today's scalable high-performance computing environment. Not only performance but data sharing service redundancy have risen as a serious problem. In case of NFS, the locking issue and cache cause file system to reboot and make problem when it is used simply as ip-take over for H/A service. In case of AFS, it provides file sharing redundancy but it is not possible until the storage supporting redundancy and equipments are prepared. Lustre is an open source based cluster file system developed to meet both demands. Lustre consists of three types of subsystems : MDS(Meta-Data Server) which offers the meta-data services, OST(Objec Storage Targets) which provide file I/O, and Lustre Clients which interact with OST and MDS. These subsystems with message exchanging and pursuing scalable high-performance file system service. In this paper, we compare the transmission speed of gigabytes file between Lustre and NFS on the basis of concurrent users and also present the high availability of the file system by removing more than one OST in operation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.169-177
• /
• 2014

It is essential to support the image and video analysis technology such as motion detection since the DVR and NVR storage were adopted in the real time visual surveillance system. Especially the network camera would be popular as a video input device. The traditional CCTV that supports analog video data get be replaced by the network camera. In this paper, we present the design and implementation of video surveillance system that provides the real time motion detection by the video storage server. The mobile application also has been implemented in order to provides the retrieval functionality of image analysis results. We develop the video analysis server with open source library OpenCV and implement the daemon process for video input processing and real-time image analysis in our video surveillance system.

• KIISE Transactions on Computing Practices
• /
• v.20 no.10
• /
• pp.555-560
• /
• 2014

This paper proposes the data security technology for the desktop virtualization environment using the separated software execution method. In the virtual environment where allocates separate VMs to the users, there is a benefit that the programs in one guest machine are isolated from the programs running in another guest machine, whereas in the separated execution environment that supports application virtualization, the isolation is not offered and it causes the data security problem because the applications are executed by the one root privilege in the server. To solve this problem, we provides the data security method using the server storage filter, the viewer filter, and the file mapping table in this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.466-483
• /
• 2017

Zen Cart is an open-source online store management system. It is used all over the world because of its stability and safety. Today, Zen Cart's session security mechanism is mainly used to verify user agents and check IP addresses. However, the security in verifying the user agent is lower and checking the IP address can affect the user's experience. This paper, which is based on the idea of session protection as proposed by Ben Adida, takes advantage of the HTML5's sessionStorage property to store the shared keys that are used in HMAC-SHA256 encryption. Moreover, the request path, current timestamp, and parameter are encrypted by using HMAC-SHA256 in the client. The client then submits the result to the web server as per request. Finally, the web server recalculates the HMAC-SHA256 value to validate the request by comparing it with the submitted value. In this way, the Zen Cart's open-source system is reinforced. Owing to the security and integrity of the HMAC-SHA256 algorithm, it can effectively protect the session security. Analysis and experimental results show that this mechanism can effectively protect the session security of Zen Cart without affecting the original performance.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.3
• /
• pp.263-272
• /
• 2017

The concept of Internet of Things (IoT) has been increasingly popular these days, and its areas of application have been broadened. However, if the data stored in an IoT system is damaged and cannot be recovered, our society would suffer considerable damages and chaos. Thus far, most of the studies on fault-tolerance have been focused on computer systems, and there has not been much research on fault-tolerance for IoT systems. In this study, therefore, a fault-tolerance method in IoT environments is proposed. In other words, based on the EVENODD method, one of the traditional fault-tolerance methods, a fault-tolerance storage and recovery method for the data stored in the IoT server is proposed, and the method is implemented on an oneM2M IoT system. The fault-tolerance method proposed in this paper consists of two phases - fault-tolerant data storage and recovery. In the fault-tolerant data storage phase, some F-T gateways are designated and fault-tolerant data are distributed in the F-T gateways' storage using the EVENODD method. In the fault-tolerant recovery phase, the IoT server initiates the recovery procedure after it receives fault-tolerant data from non-faulty F-T gateways. In other words, an EVENODD array is reconstructed and received data are merged to obtain the original data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.399-410
• /
• 2002

Web cache, which is functionally another word of proxy server, is located between client and server. Web cache has a limited storage area although it has broad bandwidth between client and proxy server, which are usually connected through LAN. Because of limited storage capacity, existing objects in web cache can be deleted for new objects by some rules called replacement algorithm. Hit rate and byte-hit rate are general metrics to evaluate replacement algorithms. Most of the replacement algorithms do satisfy only one metric, or sometimes none of them. In this paper, we propose two replacement algorithms to achieve both high hit rate and byte-hit rate with great satisfaction. In the first algorithm, the cache is appropriately partitioned according to file types as a basic model. In the second algorithm, the cache is composed of two levels; the upper level cache is managed by the basic algorithm, but the lower level is collectively used for all types of files as a shared area. To show the performance of the proposed algorithms, we evaluate hit rate and byte-hit rate of the proposed replacement algorithms using the trace driven simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.645-651
• /
• 2019

At a time when large amounts of data are being poured out, there are many changes in software architecture or data storage patterns because of the nature of the data being written, rather more read-intensive than writing. Accordingly, in this paper, the query model of Command Query Responsibility Segmentation (CQRS) pattern separating the responsibilities of commands and queries is used to implement an efficient high-capacity data lookup system in users' requirements. This paper uses the 2018 temperature, humidity and precipitation data of the Korea Meteorological Administration Open API to store about 2.3 billion data suitable for RDBMS (PostgreSQL) and NoSQL (MongoDB). It also compares and analyzes the performance of systems with CQRS pattern applied from the perspective of the web server (Web Server) implemented and systems without CQRS pattern, the storage structure performance of each database, and the performance corresponding to the data processing characteristics.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.253-256
• /
• 2000

In general, Automated Storage/Retrieval Systems (AS/RS ) have racks of equal sized cells to utilize the concept of unit-load. Most of the techniques for the performance estimation of a unit-load AS/RS are a static model or computer simulation. Especially, their models were developed under assumption that the Storage/Retrieval (S/R) machine performs only single command (SC) or dual command (DC). In reality, defending on the operating policy and the status of the system at a particular time, the S/B machine performs a SC or a DC, or becomes .: idle. In order to resolve these weak points, we propose a stochastic model for the performance estimation of unit-load AS/RS by using a single-server queueing model. Expected numbers of waiting storage and retrieval commands are found