• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.597-604
• /
• 2009

An SMTP(Simple Mail Transfer Protocol) server was designed for delivering and storing user's email across a network. An SMTP server can be distributed as multiple servers for large service, huge users or massive emails. An SMTP server can be constructed by multiple servers with separating file system as email storing space, and each SMTP server can usually share each file system by using the NFS(Network File system). However the NFS is originally designed for sharing each file system across a network, and contains all attributes and features of regular file system. Using this NFS for email storing space of SMTP servers, it makes overhead due to unnecessary work of regular file system. In this paper, we propose a method to do directly operation with socket for reducing work overhead caused by the NFS. For doing directly operation with socket, this paper defines information based storing space structure and a protocol for storing emails. We performed experiments using Mailstone made by Netscape. The experimental results show the performance improvement of the proposed method compared to the existing method.

• Smart Media Journal
• /
• v.12 no.11
• /
• pp.145-153
• /
• 2023

In a P2P-based distributed storage system where peers frequently join and leave, it is essential to guarantee not only data availability but also playback quality comparable to that provided by local storage devices when playing back video files with real-time constraints. In addition, cloud storage services based on distributed storage systems provide each user with the functionality to share their files with other users, so when multiple users request playback of the same video file at the same time, all playback should be supported seamlessly in real time. Therefore, in this paper, we propose a scheme that process multiple simultaneous playback requests for each video file in real time as well as data availability in a P2P-based distributed storage system that supports file sharing. This scheme can support real-time simultaneous playback and efficiently use storage space by adjusting the amount of redundant data encoded through erasure coding according to the number of concurrent playback requests for each video file.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.614-618
• /
• 2002

Although there are a lot of file sharing mechanisms in the Internet such as NFS and P2P, FTP is one of the most common mechanisms used until now. In this paper, we propose a more enhanced file sharing mechanism, the Distributed File Server (DFS) method. The most remarkable feature of DFS is that it can be simply adopted in the current Internet FTP services by locating a DFS node between existing FTP servers and clients without changing any existing file transfer environment. To verify the proposed mechanism we implemented a DFS prototype on RedHat 7.2 system and we finally show that it can reduce the file storage problem caused by big-sized multimedia data.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.259-273
• /
• 2009

Most of large-scale distributed file systems decouple a metadata operation from read and write operations for a file. In the distributed file systems, a certain server named a metadata server (MDS) maintains metadata information in file system such as access information for a file, the position of a file in the repository, the namespace of the file system, and so on. But, the existing systems used restrictive metadata management schemes, because most of the distributed file systems designed to focus on the distributed management and the input/output performance of data rather than the metadata. Therefore, in the existing systems, the metadata throughput and expandability of the metadata server are limited. In this paper, we propose a new non-shared metadata management scheme in order to provide the high metadata throughput and scalability for a cluster of MDSs. First, we derive a dictionary partitioning scheme as a new metadata distribution technique. Then, we present a load balancing technique based on the distribution technique. It is shown through various experiments that our scheme outperforms existing metadata management schemes in terms of scalability and load balancing.

• The Journal of the Korea Contents Association
• /
• v.12 no.2
• /
• pp.30-39
• /
• 2012

In these day, some of IT venders already were going to cloud computing market, as well they are going to expand their territory for the cloud computing market through that based on their hardware and software technology, making collaboration between hardware and software vender. Distributed file system is very mainly technology for the cloud computing that must be protect performance and safety for high levels service requests as well data store. This paper introduced distributed file system for cloud computing and how to use this theory such as memory database, Hadoop file system, high availability database system. now In the market, this paper define a very large distributed processing architect as a reference by kind of distributed file systems through using technology in cloud computing market.

• The Journal of Society for e-Business Studies
• /
• v.4 no.1
• /
• pp.1-19
• /
• 1999

Workflow management system provides automation of job processes by maintaining shareability on information about various job process schedules and persons related to those schedules. Existing workflow management systems use file or database to store the information generated in those systems. However, file or database system could manage only non-complicated information for the workflow but not the information resources of an enterprise which is complicated and of various formats. Therefore, we need a data management system that could control those information resources. This system should manage the data which are distributed at several places geographically. Information Repository could meet those requirements. Information Repository may integrate, store and manage information resources requested by application systems. We have an international standard for the information repository, Information Resources Dictionary System(IRDS). The IRDS, however, does not support distributed environment. In this paper, we design and implement an information repository based on IRDS that may be operated in distributed environment. We verify that this information repository is more effective and is more effective than any other file or database system.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.2
• /
• pp.156-167
• /
• 1995

VDFS(V-kernel Distributed File System) constructed in this paper proposes an asymmetric Distributed File System so that various problems of existing symmetric structures like NFS ＆ RFS may be solved in small-sized system. Particulary, in this paper, server workload can be reduced by using a caching mechanism and remote access transparency can be improved by using a sharing file duplicately.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.491-494
• /
• 1998

This paper describes the design and implementation of file system which allows the collaborative computing in mobile environment. The design goal is to make a logically one file system in the distributed computer systems. The characteristics of frequent, foreseeable and variable disconnections in a mobile environment wrer taken into consideration. We introduce an auto-hoarding system that provides the availability of large number of nodes which are weakly and intermittently connected. The data consistency problems in distributed or replicated mobile data are also discussed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.64
• /
• pp.1-20
• /
• 2001

In distributed databases, file replication and workload allocation are important design issues. This paper solves these two issues simultaneously, The primary objective is to minimize the system response time that consists of local processing and communication overhead on a local area network. Workload (query transactions) is assigned among any sites in proportion to the remaining file request service rate of the each server The problem is presented in the form of a nonlinear integer programming model. The problem is proved to be NP-complete and thus an efficient heuristic is developed by employing its special structure. To illustrate its effectiveness, it is shown that the proposed heuristic is based on the heuristic of a non-redundant allocation that was provided to be effective. The model and heuristics are likely to provide more effective distributed database designs.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.547-549
• /
• 2007

Recently with increasing the use of parallel computing and cluster system which was connected high speed network, the interest about distributed and parallel file system is increasing. Specially, there are many researches, which focused on optimizing the performance of distributed and parallel file system for the more efficient use of cluster system. In this paper, we analyzed the performance of PVFS(Parallel Virtual File System) in small cluster system. In addition, to improve the PVFS performance we proposed the chancing the size of flow buffer according to the network speed and we optimized the PVFS performance on small cluster system.