• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.2
• /
• pp.101-108
• /
• 2008

In this paper, we develop system to backup automatically personal data by real time based on ECA model. This system backups data that is changed in user PC using CDP technology based on ECA model. Proposed ECA model defines file's change such as file creation, update, remove etc. in user PC to event for synchronization between server and user PC. If event is detected about file, proposed system examines condition that is defined and backup the file to server. Backup data that is stored to server can recovery on point of time that user wants. The proposed system can be applied to data management system for business, personal data management system, high-capacity contents management system etc.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.06a
• /
• pp.177-184
• /
• 2002

In these day, the storage capacity has been growing and the informations increase in geometrically progression in a modem information age. At present the situation is required that the exchanges and access of the informations is available without regard to time and space. In this paper we present a effective backup systems to backup the information of server that continuously has to be accessible in 365's days. There are two backup cases. one is a file-base backup and the other is a block-based backup. In general, a block-based backup has a good performance than a file-based backup but it is difficult to implement a block-based systems. First, we introduce the technique of backup and methods, on-line backup. Next, we present our backup systems based on client-server model and have a snapshot facility. Finally we introduce SCSI-Protocol in order to increase the data transfer rate.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.8-18
• /
• 2010

Traditional storage server suffers from duplicated data blocks which cause an waste of storage space and network bandwidth. To address this problem, various de-duplication mechanisms are proposed. Especially, lots of works are limited to backup server that exploits Contents-Defined Chunking (CDC). In backup server, duplicated blocks can be easily traced by using Anchor, therefore CDC scheme is widely used for backup server. In this paper, we propose a new de-duplication mechanism for improving a storage system. We focus on efficient algorithm for supporting general purpose de-duplication server including backup server, P2P server, and FTP server. The key idea is to adapt stride scheme on traditional fixed block duplication checking mechanism. Experimental result shows that the proposed mechanism can minimize computation time for detecting duplicated region of blocks and efficiently manage storage systems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.11-15
• /
• 2015

SSD(Solide State Disk) Memory is gradually replacing HDD(Hard Disk Drive) for high speed data input and output processing on Internet server system. In this paper, we proposed efficient data distribution storage algorithm in DRAM based SSD. And we did performance test for proposed algorithm and existing algorithm in the same server environment condition. The result of comparison of performance test is as fellows. Data backup processing time of proposed algorithm was reduced by half than that of existing algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.67-72
• /
• 2006

Because computer system is complex gradually from fast growth of the Internet and sudden increase of Internet user and scale is growing, and dependence for computer system is rising gradually, data damage by mistake or disaster is big enough to can not imagine. Usually is continuous if wish to inform through internet and must update data stably, we should manage so that precious data is not erased from sudden problem through periodic backup. Plan to protect data safely for this should be readied. This paper proposes system that can make effective backup environment because consider environment and achievement method in these data management side. That is, implements system that achieve data backup and restore selectively in internet. Backup and restore about data had stored through browser even if disconnect directly to server because it is possible connect in internet by advantage of proposing system are available. Also, This system can manage data stored to server more efficiently by using selectively both backup and restore two methods.

• Asia pacific journal of information systems
• /
• v.6 no.1
• /
• pp.21-38
• /
• 1996

This paper investigates the performance improvement opportunities through a resiliency mechanism in the distributed primary/backup database system. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. In order to perform continuous transaction processing despite failures, every state change of a transaction processing can be saved in the backup server. Obviously, this pessimistic synchronization may give more burdens than benefits to the system. Thus, the tracking needs not be done synchronously with the transaction progress. Instead, the state of all transaction processing in a system is saved periodically. This activity is referred to as a savepoint. Then, the question is how often the savepoint has to be done. We derive the optimal savepoint to identify the optimization parameters for the resilient transaction processing system.

• The Journal of Information Systems
• /
• v.4
• /
• pp.85-104
• /
• 1995

In a loosely-coupled distributed database server system, a server failure and/or a communication failure can be masked by a resiliency mechanism. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. The resiliency mechanism for transaction processing is achieved by keeping redundant information using a primary/backup approach. The purpose of this paper is to analyze the performance improvement opportunities with the resiliency mechanism and to present the design of the proposed system.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.657-668
• /
• 2008

Traditional off-the-shelf file server has several potential drawbacks to store data blocks. A first drawback is a lack of practical de-duplication consideration for storing data blocks, which leads to worse storage capacity waste. Second drawback is the requirement for high performance computer system for processing large data blocks. To address these problems, this paper proposes a clustering backup system that exploits file fingerprinting mechanism for block-level de-duplication. Our approach differs from the traditional file server systems in two ways. First, we avoid the data redundancy by multi-level file fingerprints technology which enables us to use storage capacity efficiently. Second, we applied a cluster technology to I/O subsystem, which effectively reduces data I/O time and network bandwidth usage. Experimental results show that the requirement for storage capacity and the I/O performance is noticeably improved.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.1
• /
• pp.32-39
• /
• 2015

The voice communications with wireless backbone based networks are evolving into a packet switching VoIP systems. In those networks, a call processing scheme is required for management of subscribers and connection between them. A VoIP service scheme for those systems requires reliable subscriber management and connection establishment schemes, but the conventional call processing schemes based on the centralized server has lack of reliability. Thus, the mutual-backup architecture of SIP-servers is required to ensure efficient subscriber management and reliable VoIP call processing capability, and the synchronization and call processing schemes should be changed as the architecture is changed. In this paper, a mutual-backup architecture of SIP-servers is proposed for wireless backbone based networks. A message format for synchronization and information exchange between SIP servers is also proposed in the paper. This paper also proposes a FSM scheme for the fast call processing in unreliable networks to detect multiple servers at a time. The performance analysis results show that the mutual backup server architecture increases the call processing success rates than conventional centralized server architecture. Also, the FSM scheme provides the smaller call processing times than conventional SIP, and the time is not increased although the number of SIP servers in the networks is increased.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.4
• /
• pp.795-804
• /
• 2009

An HSS(Home Subscriber Server) system requires a main-memory database on main-memory unit for the real-tine management of the subscriber information in the mobile communication service, in that the system controls not only basic data for handling calls of users, but also additional service data related to user authentication and operational data. Nonetheless, HSS-DBS system, requiring the reliability and stability, need more secure data store method and a back-up technique because the system have a long startup time and the big problem on the failures of main-memory. This paper proposes an efficient back-up replication technique, on the basis of enhancing the stability and performance of HSS system. The proposed shadowing back-up technique adopting the delayed recovery process, can help minimize the real-time back-up overloads by location registration, while the proposed backup replication method enables more stable system operations with replicating the data to remote server in real time.