• Journal of the Korea Society of Computer and Information
• /
• v.24 no.9
• /
• pp.1-8
• /
• 2019

In this paper, we propose a performance isolation of shared space for virtualized SSD based storage systems, to solve the weakness in a VSSD framework. The proposed scheme adopts a CFQ scheduler and a shared space-based FTL for the fairness and the performance isolation for multiple users on virtualized SSD based storage systems. Using the CFQ scheduler, we ensure SLOs for the storage systems such as a service time, a allocated space, and a IO latency for users on the virtualized storage systems. In addition, to improve a throughput and reduce a computational latency for garbage collection, a shared space-based FTL is adopted to maintain the information of SLOs for users and it manages shared spaces among the users. In our experiments, the proposal improved the throughput of garbage collection by 7.11%, on average, and reduced the computational latency for garbage collection by 9.63% on average, compared to the previous work.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.605-612
• /
• 2005

With the increase in I/O performance and capacity, it becomes commonplace that storage systems are shared by multiple storage users. This paper proposes an efficient token-bucket-based performance control technique for the shared storage that can statistically guarantee demanded storage performance from different users. It also verifies the operational characteristics and performance of the proposed scheme under various types of I/O workloads.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3319-3338
• /
• 2016

Cloud storage is becoming more and more popular because of its elasticity and pay-as-you-go storage service manner. In some cloud storage scenarios, the data that are stored in the cloud may be shared by a group of users. To verify the integrity of cloud data in this kind of applications, many auditing schemes for shared cloud data have been proposed. However, all of these schemes do not consider the access authorization problem for users, which makes the revoked users still able to access the shared cloud data belonging to the group. In order to deal with this problem, we propose a novel public auditing scheme for shared cloud data in this paper. Different from previous work, in our scheme, the user in a group cannot any longer access the shared cloud data belonging to this group once this user is revoked. In addition, we propose a new random masking technique to make our scheme preserve both data privacy and identity privacy. Furthermore, our scheme supports to enroll a new user in a group and revoke an old user from a group. We analyze the security of the proposed scheme and justify its performance by concrete implementations.

• Journal of the Korean Society for Library and Information Science
• /
• v.55 no.1
• /
• pp.285-303
• /
• 2021

Efforts to establish a joint preservation facility for library collection are being discussed by some of regional representative libraries recently. In order for the efficient management and preservation of public library materials and to secure the space necessary for applying new services, there is a high demand for a cooperative shared storage for public libraries. The construction of a cooperative shared storage for public libraries is to minimize the cost of expanding the preservation space for each public library and to provide a pleasant service environment by separating the low-use materials stored in the library. Accordingly, discussions on the construction of a cooperative shared storage for public libraries are being initiated by some representative libraries. This study, in this regard, tried to propose a plan to build a cooperative shared storage for public libraries by a Seoul Metropolitan Library. To this end, it surveyed the estimate size of the collections of public libraries in Seoul and, based on this, proposed the size and strategies for the facility.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.211-222
• /
• 2006

The cluster system with shared-nothing storage cannot escape from the problem of skewed request toward specific contents. This paper, therefore, suggests streaming method using MDC (Multiple Description Coding) instead of using single original content; this method is able to cope with skewed request in shared-nothing storage server as well as to continue to provide services in case of the system failure. Also, the system can support adaptive streaming service according to user player type, network status, the load of server, and client.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.12
• /
• pp.4725-4747
• /
• 2020

Software defined networking (SDN) is considered to be one of the most promising paradigms in the future. To solve the scalability and performance problem that a single and centralized controller suffers from, the distributed multi-controller architecture is adopted, thus forms multi-domain SDN. In a multi-domain SDN network, it is of great importance to ensure a reliable control plane. In this paper, we focus on the reliability problem of multi-domain SDN against controller failure from perspectives of backup controller deployment and controller replication. We firstly propose a placement algorithm for backup controllers, which considers both the reliability and the cost factors. Then a controller replication mechanism based on shared data storage is proposed to solve the inconsistency between the active and standby controllers. We also propose a shared data storage layout method that considers both reliability and performance. Besides, a fault recovery and repair process is designed based on the controller backup and shared data storage mechanism. Simulations show that our approach can recover and repair controller failure. Evaluation results also show that the proposed backup controller placement approach is more effective than other methods.

• Journal of the Korean housing association
• /
• v.11 no.1
• /
• pp.115-124
• /
• 2000

The purpose of this research is to examine residents' needs for shared community spaces and to explore the relationships between these needs and characteristics of consumers such as age and employment status of the homemakers, family life cycle stage, occupation of the primary income provider, housing size, and homeownership. Statistical data were compiled to determine frequencies and percentage distributions, and subjected to General Linear Model and Duncan-test analysis.Most residents wanted to utilize the basements of their complexes for storage space. Further interest was shown for shared community spaces that would be run by residents themselves, such as vegetable gardens, indoor playgrounds for children, senior citizen's activity rooms, walking paths, study rooms, and lounges. Female residents under 45 years old were likely to express needs for storage spaces for bicycle, and multipurpose rooms for meetings and family events. Female residents with jobs were more likely to desire shared community spaces than full-time females residents were. These findings imply the need for consideration of diverse plans rather than uniform ones. This results can be usefully applied to develop new apartment housing for different social class residents.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.287-300
• /
• 2013

Cloud storage is provided as a service in order to keep pace with the increasing use of digital information. It can be used to store data via networks and various devices and is easy to access. Unlike existing removable storage, many users can use cloud storage because it has no storage capacity limit and does not require a storage medium. Cloud storage reliability has become a topic of importance, as many users employ it for saving great volumes of data. For protection against unethical administrators and attackers, a variety of cryptography systems, such as searchable encryption and proxy re-encryption, are being applied to cloud storage systems. However, the existing searchable encryption technology is inconvenient to use in a cloud storage environment where users upload their data. This is because this data is shared with others, as necessary, and the users with whom the data is shared change frequently. In this paper, we propose a searchable re-encryption scheme in which a user can safely share data with others by generating a searchable encryption index and then re-encrypt it.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.33-49
• /
• 2003

Recently, there have been large storage demands for manipulating multimedia data. To solve the tremendous storage demands, one of the major researches is the SAN(Storage Area Network) that provides the local file requests directly from shared-disk storage and also eliminates the server bottlenecks to performance and availability. SAN also improve the network latency and bandwidth through new channel interface like FC(Fibre Channel). But to manipulate the efficient storage network like SAN, traditional local file system and distributed file system are not adaptable and also are lack of researches in terms of a metadata structure for large-scale inode object such as file and directory. In this paper, we describe the architecture and design issues of our shared-disk file system and provide the efficient bitmap for providing the well-formed block allocation in each host, extent-based semi flat structure for storing large-scale file data, and two-phase directory structure of using Extendible Hashing. Also we describe a detailed algorithm for implementing the file system's device driver in Linux Kernel and compare our file system with the general file system like EXT2 and shard disk file system like GFS in terms of file creation, directory creation and I/O rate.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.616-627
• /
• 2005

In the shared storage file system, systems can directly access the shared storage device through specialized data-only subnetwork unlike in the network attached file server system. In this shared-storage architecture, data consistency is maintained by some designated set of lock servers which use control network to send and receive the lock information. Furthermore, lease mechanism is introduced to cope with the control network failure. But when the control network is partitioned, participating systems can no longer make progress after the lease term expires until the network recovers. This paper addresses this limitation and proposes a method that allows partitioned systems to make progress under the partition of control network. The proposed method works in a manner that each participating system is rotationally given a predefined lease term periodically. It is also shown that the proposed mechanism always preserves data consistency.